/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 RABIN_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:39:32,326 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:39:32,380 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:39:32,409 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:39:32,409 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:39:32,410 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:39:32,412 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:39:32,412 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:39:32,413 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:39:32,416 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:39:32,417 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:39:32,417 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:39:32,417 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:39:32,418 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:39:32,418 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:39:32,419 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:39:32,419 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:39:32,419 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:39:32,419 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:39:32,420 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:39:32,420 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:39:32,420 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:39:32,420 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:39:32,421 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:39:32,421 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:39:32,421 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:39:32,421 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:39:32,422 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:39:32,422 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:39:32,422 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:39:32,423 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:39:32,423 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:39:32,424 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:39:32,425 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:39:32,425 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 -> RABIN_PETRI_NET [2023-10-12 17:39:32,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:39:32,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:39:32,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:39:32,685 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:39:32,686 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:39:32,687 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:39:32,687 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:39:32,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:39:32,717 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:39:32,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:39:32,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:39:32,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:39:32,730 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:39:32" (1/1) ... [2023-10-12 17:39:32,736 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:39:32" (1/1) ... [2023-10-12 17:39:32,741 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:39:32,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:39:32,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:39:32,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:39:32,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:39:32,752 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:39:32" (1/1) ... [2023-10-12 17:39:32,752 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:39:32" (1/1) ... [2023-10-12 17:39:32,754 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:39:32" (1/1) ... [2023-10-12 17:39:32,754 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:39:32" (1/1) ... [2023-10-12 17:39:32,756 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:39:32" (1/1) ... [2023-10-12 17:39:32,760 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:39:32" (1/1) ... [2023-10-12 17:39:32,761 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:39:32" (1/1) ... [2023-10-12 17:39:32,762 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:39:32" (1/1) ... [2023-10-12 17:39:32,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:39:32,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:39:32,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:39:32,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:39:32,764 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:39:32" (1/1) ... [2023-10-12 17:39:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,806 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:39:32,828 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:39:32,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:39:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:39:32,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:39:32,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:39:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:39:32,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:39:32,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:39:32,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:39:32,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:39:32,846 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:39:32,894 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:39:32,897 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:39:33,024 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:39:33,039 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:39:33,039 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:39:33,041 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:39:33 BoogieIcfgContainer [2023-10-12 17:39:33,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:39:33,043 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:39:33,043 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:39:33,048 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:39:33,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:39:33,049 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:39:32" (1/2) ... [2023-10-12 17:39:33,052 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91316d2 and model type dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:39:33, skipping insertion in model container [2023-10-12 17:39:33,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:39:33,053 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:39:33" (2/2) ... [2023-10-12 17:39:33,054 INFO L332 chiAutomizerObserver]: Analyzing ICFG dec-subseq-array.wvr.bpl [2023-10-12 17:39:33,099 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:39:33,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:39:33,144 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:39:33,144 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:39:33,148 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:39:33,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:39:33,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:39:33,155 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:39:33,167 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:39:33,181 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:39:33,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:39:33,190 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:39:33,190 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:39:33,191 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:39:33,192 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:39:33,688 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:39:33,688 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:39:33,699 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:39:33,699 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:39:33,700 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:39:33,700 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:39:33,700 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:39:33,700 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:39:33,700 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:39:33,700 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:39:33,701 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:39:33,704 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][13], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][4]][3:3A:[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][9]] [2023-10-12 17:39:33,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:33,706 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:39:33,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:33,707 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:33,710 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:39:33,712 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:39:33,715 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][13], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][4]][3:3A:[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][9]] [2023-10-12 17:39:33,715 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:33,715 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:39:33,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:33,716 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:33,720 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:39:33,720 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:39:33,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:39:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998775848] [2023-10-12 17:39:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:33,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:33,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:33,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:39:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:33,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756184216] [2023-10-12 17:39:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:33,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:33,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:33,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:33,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:39:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:33,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177518691] [2023-10-12 17:39:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:34,051 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:39:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:39:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177518691] [2023-10-12 17:39:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177518691] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:39:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:39:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:39:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050189240] [2023-10-12 17:39:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:39:34,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:39:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:39:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:39:34,133 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. 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:39:34,133 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:39:34,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:34,199 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:39:34,199 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:39:34,200 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:39:34,205 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-10-12 17:39:34,205 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 19 places, 23 transitions, 113 flow [2023-10-12 17:39:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:39:34,210 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 23 transitions, 113 flow [2023-10-12 17:39:34,210 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:39:34,210 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:39:34,213 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][0], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 3:3A:[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][2]][10:4A:[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[][5], 11:5A:[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][9]] [2023-10-12 17:39:34,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:34,214 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-10-12 17:39:34,214 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:39:34,214 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:34,215 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:39:34,215 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:39:34,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:39:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:34,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62354374] [2023-10-12 17:39:34,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:34,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:39:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007015072] [2023-10-12 17:39:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:34,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:39:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:34,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841189741] [2023-10-12 17:39:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:34,270 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:39:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:39:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841189741] [2023-10-12 17:39:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841189741] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:39:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:39:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:39:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599141341] [2023-10-12 17:39:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:39:34,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:39:34,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:39:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:39:34,363 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. 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:39:34,363 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:39:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:34,395 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:39:34,395 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:39:34,395 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:39:34,396 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-10-12 17:39:34,396 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 21 places, 26 transitions, 180 flow [2023-10-12 17:39:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:39:34,397 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 26 transitions, 180 flow [2023-10-12 17:39:34,397 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:39:34,398 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:39:34,400 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][0], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 6:3A:[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][4], 16:4A:[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][8]][17:5A:[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][13]] [2023-10-12 17:39:34,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:34,401 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2023-10-12 17:39:34,401 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:39:34,401 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:34,402 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:39:34,402 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:39:34,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2023-10-12 17:39:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757497194] [2023-10-12 17:39:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:34,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 2 times [2023-10-12 17:39:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324852737] [2023-10-12 17:39:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:34,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 127365305, now seen corresponding path program 1 times [2023-10-12 17:39:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978215615] [2023-10-12 17:39:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:34,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:34,559 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:34,560 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:34,560 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:34,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:34,560 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:34,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:34,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:34,560 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:34,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:39:34,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:34,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:34,575 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:39:34,589 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:39:34,623 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:39:34,713 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:34,716 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:34,720 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:39:34,723 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:39:34,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:39:34,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:34,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:34,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:34,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:34,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:34,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:34,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:34,777 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:39:34,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:34,779 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:39:34,790 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:39:34,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:34,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:34,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:34,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:34,801 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:39:34,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:34,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:34,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:34,841 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:39:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:34,842 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:39:34,845 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:39:34,847 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:39:34,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:34,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:34,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:34,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:34,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:34,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:34,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:34,885 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:39:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:34,887 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:39:34,890 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:39:34,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:39:34,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:34,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:34,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:34,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:34,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:34,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:34,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:34,950 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:39:34,950 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:39:34,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:34,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:34,955 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:39:34,956 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:39:34,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:34,966 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:34,966 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:34,966 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:39:34,971 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:39:34,973 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:34,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:35,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:35,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:35,015 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:35,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:35,016 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:39:35,019 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:39:35,112 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:39:35,114 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:39:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2023-10-12 17:39:35,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:39:35,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:35,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:39:35,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:35,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:39:35,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:35,122 INFO L430 stractBuchiCegarLoop]: Abstraction has has 25 places, 104 transitions, 928 flow [2023-10-12 17:39:35,123 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:39:35,123 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 104 transitions, 928 flow [2023-10-12 17:39:35,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:35,135 INFO L124 PetriNetUnfolderBase]: 9/23 cut-off events. [2023-10-12 17:39:35,138 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:39:35,138 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:35,142 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] 116#[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] 118#[L39, L58, L25-1]true [2023-10-12 17:39:35,142 INFO L750 eck$LassoCheckResult]: Loop: 118#[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[] 116#[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] 118#[L39, L58, L25-1]true [2023-10-12 17:39:35,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 1 times [2023-10-12 17:39:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825483571] [2023-10-12 17:39:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:35,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,181 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:39:35,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315008410] [2023-10-12 17:39:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:35,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 2 times [2023-10-12 17:39:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:35,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525160261] [2023-10-12 17:39:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:35,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:35,248 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:39:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:39:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525160261] [2023-10-12 17:39:35,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525160261] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:39:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870443538] [2023-10-12 17:39:35,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:39:35,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:39:35,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:35,251 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:39:35,259 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:39:35,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:39:35,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:39:35,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:35,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:35,314 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:39:35,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:39:35,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870443538] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:39:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:39:35,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:39:35,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432640523] [2023-10-12 17:39:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:39:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:39:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:39:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:39:35,395 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 25 places, 104 transitions, 928 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:39:35,395 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:39:35,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:35,452 INFO L124 PetriNetUnfolderBase]: 92/170 cut-off events. [2023-10-12 17:39:35,452 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-10-12 17:39:35,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 170 events. 92/170 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 527 event pairs, 5 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 708. Up to 152 conditions per place. [2023-10-12 17:39:35,455 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 54 selfloop transitions, 14 changer transitions 0/68 dead transitions. [2023-10-12 17:39:35,455 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 27 places, 68 transitions, 725 flow [2023-10-12 17:39:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:39:35,456 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 68 transitions, 725 flow [2023-10-12 17:39:35,457 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:39:35,457 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 68 transitions, 725 flow [2023-10-12 17:39:35,464 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][0], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 4:3A:[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][3], 15:4A:[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][7], 35:5A:[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][15]][61:6A:[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][26], 62:7A:[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][44]] [2023-10-12 17:39:35,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:35,464 INFO L124 PetriNetUnfolderBase]: 30/61 cut-off events. [2023-10-12 17:39:35,464 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:39:35,464 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:35,465 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:39:35,465 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:39:35,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 2 times [2023-10-12 17:39:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959503485] [2023-10-12 17:39:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:35,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:39:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:35,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762369406] [2023-10-12 17:39:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:35,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2138975869, now seen corresponding path program 3 times [2023-10-12 17:39:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577997068] [2023-10-12 17:39:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:35,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:35,642 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:35,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:35,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:35,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:35,643 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:35,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:35,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:35,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:35,643 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:39:35,643 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:35,643 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:35,645 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:35,647 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:39:35,650 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:35,679 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:39:35,866 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:35,866 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:35,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:35,868 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:39:35,874 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:39:35,877 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:39:35,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:35,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:35,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:35,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:35,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:35,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:35,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:35,907 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:39:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:35,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:35,909 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:39:35,916 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:39:35,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:35,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:35,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:35,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:35,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:35,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:35,928 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:39:35,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:35,942 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:39:35,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:35,944 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:39:35,952 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:39:35,957 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:39:35,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:35,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:35,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:35,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:35,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:35,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:35,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:35,988 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:39:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:35,990 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:39:35,993 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:39:35,994 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:39:36,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:36,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:36,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:36,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:36,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:36,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:36,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:36,037 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:39:36,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:36,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:36,038 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:39:36,041 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:39:36,042 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:39:36,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:36,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:36,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:36,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:36,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:36,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:36,073 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:36,088 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:39:36,089 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:39:36,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:36,095 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:39:36,097 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:39:36,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:36,109 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:36,109 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:36,109 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:39:36,117 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:39:36,121 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:39:36,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:36,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:36,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:36,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:36,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:36,169 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:39:36,170 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:39:36,318 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:39:36,321 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:39:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:39:36,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:39:36,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:36,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:39:36,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:36,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:39:36,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:36,325 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 340 transitions, 4305 flow [2023-10-12 17:39:36,325 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:39:36,325 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 340 transitions, 4305 flow [2023-10-12 17:39:36,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:36,351 INFO L124 PetriNetUnfolderBase]: 65/120 cut-off events. [2023-10-12 17:39:36,351 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-10-12 17:39:36,351 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:36,353 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 [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] 118#[L39, 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] 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] 118#[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[] 116#[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] 118#[L39, L58, L25-1]true [2023-10-12 17:39:36,353 INFO L750 eck$LassoCheckResult]: Loop: 118#[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[] 116#[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] 118#[L39, L58, L25-1]true [2023-10-12 17:39:36,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1458778110, now seen corresponding path program 1 times [2023-10-12 17:39:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620790427] [2023-10-12 17:39:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:36,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:36,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:36,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 3 times [2023-10-12 17:39:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200754737] [2023-10-12 17:39:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:36,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:36,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:36,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1726427704, now seen corresponding path program 2 times [2023-10-12 17:39:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:36,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014655360] [2023-10-12 17:39:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:36,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:36,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:36,739 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:36,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:36,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:36,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:36,740 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:36,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:36,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:36,740 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:36,740 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:39:36,740 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:36,740 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:36,742 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:39:36,745 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:39:36,748 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:39:36,751 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:39:36,754 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:39:36,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:37,098 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:37,099 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,105 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:39:37,108 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:39:37,110 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:39:37,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:37,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:37,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:37,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:37,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:37,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:37,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:37,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,141 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:39:37,145 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:39:37,147 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:39:37,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:37,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:37,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:37,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:37,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:37,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:37,180 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:39:37,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,182 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:39:37,192 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:39:37,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:37,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:37,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:37,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:37,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:37,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:37,203 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:39:37,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:37,221 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:39:37,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,226 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:39:37,236 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:39:37,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:37,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:37,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:37,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:37,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:37,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:37,252 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:39:37,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:37,256 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:39:37,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,258 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:39:37,260 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:39:37,261 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:39:37,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:37,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:37,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:37,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:37,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:37,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:37,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:37,292 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:39:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,293 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:39:37,301 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:39:37,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:37,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:37,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:37,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:37,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:37,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:37,317 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:39:37,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:37,330 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:39:37,330 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:39:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:37,333 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:39:37,334 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:39:37,335 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:37,357 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:37,357 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:37,357 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:39:37,367 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:39:37,369 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:39:37,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:37,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:37,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:37,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:37,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:37,413 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:39:37,414 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:39:37,497 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:39:37,498 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:39:37,499 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:39:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:39:37,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:39:37,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:37,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:39:37,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:37,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:39:37,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:37,500 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 1700 transitions, 24925 flow [2023-10-12 17:39:37,500 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:39:37,500 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 1700 transitions, 24925 flow [2023-10-12 17:39:37,520 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:39:37,615 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:37,616 INFO L124 PetriNetUnfolderBase]: 194/353 cut-off events. [2023-10-12 17:39:37,616 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:39:37,616 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:37,616 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] 116#[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] 116#[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] 118#[L39, 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] 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] 118#[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[] 116#[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] 118#[L39, L58, L25-1]true [2023-10-12 17:39:37,617 INFO L750 eck$LassoCheckResult]: Loop: 118#[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[] 116#[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] 118#[L39, L58, L25-1]true [2023-10-12 17:39:37,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1334115097, now seen corresponding path program 3 times [2023-10-12 17:39:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229186247] [2023-10-12 17:39:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:37,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:37,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:37,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:39:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935089206] [2023-10-12 17:39:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:37,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:37,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:37,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2110615777, now seen corresponding path program 4 times [2023-10-12 17:39:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:37,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293310782] [2023-10-12 17:39:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:37,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:37,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:38,081 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:38,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:38,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:38,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:38,082 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:38,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:38,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:38,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:39:38,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:38,082 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:38,084 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:39:38,087 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:39:38,089 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:39:38,092 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:39:38,094 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:38,098 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:39:38,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:38,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:38,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,535 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:39:38,547 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:39:38,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:39:38,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:38,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:38,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:38,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:38,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:38,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:38,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:38,573 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:39:38,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,574 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:39:38,581 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:39:38,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:38,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:38,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:38,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:38,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:38,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:38,593 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:39:38,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:38,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,617 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:39:38,625 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:39:38,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:38,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:38,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:38,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:38,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:38,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:38,637 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:39:38,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:38,653 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:39:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,654 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:39:38,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:39:38,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:38,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:38,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:38,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:38,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:38,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:38,674 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:39:38,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:38,688 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:39:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,690 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:39:38,694 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:39:38,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:38,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:38,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:38,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:38,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:38,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:38,710 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:39:38,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:38,720 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:39:38,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,722 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:39:38,728 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:39:38,732 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:39:38,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:38,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:38,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:38,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:38,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:38,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:38,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:38,760 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:39:38,760 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:39:38,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:38,765 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:39:38,768 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:39:38,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:38,790 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:38,790 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:38,791 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:39:38,796 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:39:38,804 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:39:38,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:38,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:38,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:38,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:38,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:38,856 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:39:38,856 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:39:38,973 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:39:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:39:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:39:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:38,976 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:39:38,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:39,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:39,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:39,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:39,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:39,021 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:39:39,021 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:39:39,122 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:39:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:39:39,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:39:39,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:39,125 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:39:39,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:39,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:39,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:39,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:39,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:39,165 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:39:39,166 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:39:39,167 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:39,231 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 252 transitions. [2023-10-12 17:39:39,233 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:39:39,417 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:39:39,437 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:39:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2023-10-12 17:39:39,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:39:39,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:39,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:39:39,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:39,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:39:39,439 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:39:39,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:39,439 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 19200 transitions, 320700 flow [2023-10-12 17:39:39,439 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:39:39,439 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 19200 transitions, 320700 flow [2023-10-12 17:39:40,490 ERROR L47 etriNetUnfolderRabin]: [1:1A:[104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[][156], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][457], 4:3A:[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][1004], 13:4A:[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][2217], 38:5A:[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][4376], 70:6A:[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][4545], 140:7A:[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][7436]][258:8A:[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][12585], 259:9A:[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][7616]] [2023-10-12 17:39:41,005 ERROR L47 etriNetUnfolderRabin]: [1:1A:[104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[][156], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][457], 3:3A:[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][756], 7:4A:[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][1005], 20:5A:[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][2216], 45:6A:[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][4377], 105:7A:[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][4544], 232:8A:[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][7437]][439:9A:[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][12584], 440:10A:[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][7617]] [2023-10-12 17:39:41,185 ERROR L47 etriNetUnfolderRabin]: [1:1A:[104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[][156], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][457], 3:3A:[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][756], 9:4A:[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[][1557], 18:5A:[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][1004], 40:6A:[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][2217], 80:7A:[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][4376], 153:8A:[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][4545], 295:9A:[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][7436]][496:10A:[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][12585], 497:11A:[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][7616]] [2023-10-12 17:39:41,475 ERROR L47 etriNetUnfolderRabin]: [1:1A:[104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[][156], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][457], 3:3A:[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][756], 11:4A:[92] L39-->thread2EXIT: Formula: (and (<= v_end_24 v_start_16) (<= v_N_7 v_i_20)) InVars {start=v_start_16, N=v_N_7, i=v_i_20, end=v_end_24} OutVars{start=v_start_16, N=v_N_7, i=v_i_20, end=v_end_24} AuxVars[] AssignedVars[][1857], 19:5A:[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][1004], 42:6A:[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][2217], 94:7A:[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][4376], 214:8A:[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][4545], 417:9A:[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][7436]][602:10A:[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][12585], 603:11A:[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][7616]] [2023-10-12 17:39:42,978 ERROR L47 etriNetUnfolderRabin]: [1:1A:[104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[][156], 2:2A:[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][457], 3:3A:[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][756], 9:4A:[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[][1557], 18:5A:[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][1004], 40:6A:[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][2217], 82:7A:[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][8184], 172:8A:[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][10673], 348:9A:[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[][5929]][563:10A:[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][9732], 756:11A:[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[][12855], 938:12A:[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][14359], 1109:13A:[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][10498], 1110:14A:[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][11459]] [2023-10-12 17:39:44,171 INFO L124 PetriNetUnfolderBase]: 820/1421 cut-off events. [2023-10-12 17:39:44,171 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2023-10-12 17:39:44,172 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:39:44,176 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:39:44 BoogieIcfgContainer [2023-10-12 17:39:44,176 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:39:44,176 INFO L158 Benchmark]: Toolchain (without parser) took 11459.40ms. Allocated memory was 176.2MB in the beginning and 428.9MB in the end (delta: 252.7MB). Free memory was 128.7MB in the beginning and 348.4MB in the end (delta: -219.8MB). Peak memory consumption was 230.6MB. Max. memory is 8.0GB. [2023-10-12 17:39:44,177 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 129.7MB in the end (delta: 136.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:39:44,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.93ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 127.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:44,177 INFO L158 Benchmark]: Boogie Preprocessor took 19.28ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 126.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:44,177 INFO L158 Benchmark]: RCFGBuilder took 278.23ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 116.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:39:44,178 INFO L158 Benchmark]: BuchiAutomizer took 11133.39ms. Allocated memory was 176.2MB in the beginning and 428.9MB in the end (delta: 252.7MB). Free memory was 116.0MB in the beginning and 348.4MB in the end (delta: -232.5MB). Peak memory consumption was 217.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:44,179 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.26ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 129.7MB in the end (delta: 136.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.93ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 127.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.28ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 126.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 278.23ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 116.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 11133.39ms. Allocated memory was 176.2MB in the beginning and 428.9MB in the end (delta: 252.7MB). Free memory was 116.0MB in the beginning and 348.4MB in the end (delta: -232.5MB). Peak memory consumption was 217.0MB. 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). 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 4.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. 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: inital94 mio100 ax100 hnf100 lsp93 ukn80 mio100 lsp61 div100 bol108 ite100 ukn100 eq186 hnf88 smp100 dnf145 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 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: 70, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 93, unknown conditional: 0, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:39:44,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:44,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...