/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/inc-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:03,905 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:03,987 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:40:04,020 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:04,021 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:04,021 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:04,023 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:04,023 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:04,023 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:04,027 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:04,027 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:04,027 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:04,028 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:04,029 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:04,029 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:04,030 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:04,030 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:04,030 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:04,030 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:04,030 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:04,031 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:04,032 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:04,032 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:04,032 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:04,033 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:04,033 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:04,033 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:04,033 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:04,033 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:04,034 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:04,035 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:04,035 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:04,035 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:04,036 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:04,037 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:40:04,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:04,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:04,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:04,273 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:04,274 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:04,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl [2023-10-12 17:40:04,275 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl' [2023-10-12 17:40:04,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:04,298 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:04,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:04,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:04,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:04,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,320 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:04,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:04,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:04,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:04,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:04,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:04,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:04,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:04,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:04,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/1) ... [2023-10-12 17:40:04,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:04,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:04,371 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:40:04,378 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:40:04,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:04,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:04,406 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:04,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:04,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:04,407 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:40:04,454 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:04,457 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:04,574 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:04,589 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:04,590 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:04,593 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:04 BoogieIcfgContainer [2023-10-12 17:40:04,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:04,594 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:04,594 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:04,604 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:04,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:04,605 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:04" (1/2) ... [2023-10-12 17:40:04,607 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10cd1383 and model type inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:04, skipping insertion in model container [2023-10-12 17:40:04,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:04,607 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:04" (2/2) ... [2023-10-12 17:40:04,612 INFO L332 chiAutomizerObserver]: Analyzing ICFG inc-subseq-array.wvr.bpl [2023-10-12 17:40:04,662 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:40:04,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:40:04,722 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:04,722 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:40:04,732 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:40:04,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:40:04,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:40:04,740 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:04,757 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:40:04,760 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:40:04,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:40:04,769 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:04,770 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:40:04,770 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:40:04,771 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:40:05,293 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:40:05,293 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:40:05,308 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:05,308 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:05,309 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:05,309 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:05,309 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:05,309 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:05,309 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:05,310 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:05,310 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:40:05,313 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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][9]] [2023-10-12 17:40:05,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:05,315 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:05,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:05,316 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:05,320 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:05,322 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:40:05,325 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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][9]] [2023-10-12 17:40:05,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:05,326 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:05,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:05,326 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:05,331 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:40:05,331 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (= v_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]true [2023-10-12 17:40:05,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:40:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:05,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861874838] [2023-10-12 17:40:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:05,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:05,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:40:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:05,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709813733] [2023-10-12 17:40:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:05,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:40:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272186650] [2023-10-12 17:40:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:05,642 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:40:05,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:05,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272186650] [2023-10-12 17:40:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272186650] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:40:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069689002] [2023-10-12 17:40:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:05,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:40:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:40:05,710 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:40:05,710 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:05,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:05,777 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:40:05,778 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:40:05,778 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:40:05,780 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-10-12 17:40:05,780 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 19 places, 23 transitions, 113 flow [2023-10-12 17:40:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:40:05,786 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 23 transitions, 113 flow [2023-10-12 17:40:05,786 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:05,786 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:40:05,789 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old][9]] [2023-10-12 17:40:05,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:05,789 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-10-12 17:40:05,789 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:05,789 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:05,790 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:40:05,790 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#[L40, L23, L58]true [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 60#[L23, L39, L58]true [2023-10-12 17:40:05,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:40:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913933549] [2023-10-12 17:40:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:05,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:40:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:05,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14299056] [2023-10-12 17:40:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:05,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:05,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:05,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:40:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135888552] [2023-10-12 17:40:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135888552] [2023-10-12 17:40:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135888552] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:05,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:40:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787589636] [2023-10-12 17:40:05,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:05,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:40:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:40:05,968 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:40:05,968 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:05,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:06,007 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:40:06,007 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:40:06,007 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:40:06,008 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-10-12 17:40:06,009 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 21 places, 26 transitions, 180 flow [2023-10-12 17:40:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:40:06,010 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 26 transitions, 180 flow [2023-10-12 17:40:06,010 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:06,010 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:40:06,013 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][13]] [2023-10-12 17:40:06,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:06,013 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2023-10-12 17:40:06,013 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:40:06,013 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:06,014 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [2023-10-12 17:40:06,014 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (= v_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]true [2023-10-12 17:40:06,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2023-10-12 17:40:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769524566] [2023-10-12 17:40:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:06,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 2 times [2023-10-12 17:40:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611896306] [2023-10-12 17:40:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:06,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash 127365305, now seen corresponding path program 1 times [2023-10-12 17:40:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036196876] [2023-10-12 17:40:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:06,179 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:06,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:06,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:06,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:06,180 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:06,180 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:06,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:06,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:06,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:06,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:06,181 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:06,197 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:40:06,211 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:40:06,253 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:40:06,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:06,346 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:06,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:06,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:06,357 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:40:06,359 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:40:06,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:06,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:06,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:06,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:06,370 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:40:06,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:06,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:06,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:06,392 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:40:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:06,395 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:40:06,397 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:40:06,399 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:40:06,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:06,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:06,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:06,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:06,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:06,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:06,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:06,440 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:40:06,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:06,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:06,444 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:40:06,445 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:40:06,446 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:40:06,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:06,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:06,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:06,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:06,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:06,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:06,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:06,482 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:40:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:06,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:06,484 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:40:06,489 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:40:06,489 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:40:06,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:06,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:06,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:06,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:06,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:06,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:06,525 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:06,559 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:40:06,559 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:40:06,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:06,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:06,567 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:40:06,568 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:40:06,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:06,618 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:06,619 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:06,619 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:06,625 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:40:06,628 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:06,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:06,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:06,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:06,677 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:06,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:06,678 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:40:06,681 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:40:06,777 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:40:06,780 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:40:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2023-10-12 17:40:06,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:06,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:06,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:06,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:06,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:40:06,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:06,789 INFO L430 stractBuchiCegarLoop]: Abstraction has has 25 places, 104 transitions, 928 flow [2023-10-12 17:40:06,789 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:06,789 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 104 transitions, 928 flow [2023-10-12 17:40:06,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:06,801 INFO L124 PetriNetUnfolderBase]: 9/23 cut-off events. [2023-10-12 17:40:06,803 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:40:06,803 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:06,809 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#[L40, L23, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 118#[L39, L58, L25-1]true [2023-10-12 17:40:06,810 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 118#[L39, L58, L25-1]true [2023-10-12 17:40:06,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 1 times [2023-10-12 17:40:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588948228] [2023-10-12 17:40:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:06,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:40:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758159027] [2023-10-12 17:40:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:06,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:06,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 2 times [2023-10-12 17:40:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:06,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572139678] [2023-10-12 17:40:06,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:06,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:06,906 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:40:06,974 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:40:06,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:06,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572139678] [2023-10-12 17:40:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572139678] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:40:06,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309041172] [2023-10-12 17:40:06,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:40:06,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:40:06,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:06,981 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:40:06,985 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:40:07,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:40:07,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:40:07,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:07,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:07,057 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:40:07,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:40:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309041172] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:40:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:40:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324801454] [2023-10-12 17:40:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:07,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:40:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:40:07,147 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:40:07,147 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:07,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:07,215 INFO L124 PetriNetUnfolderBase]: 92/170 cut-off events. [2023-10-12 17:40:07,215 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-10-12 17:40:07,216 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:40:07,219 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 54 selfloop transitions, 14 changer transitions 0/68 dead transitions. [2023-10-12 17:40:07,219 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 27 places, 68 transitions, 725 flow [2023-10-12 17:40:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:40:07,221 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 68 transitions, 725 flow [2023-10-12 17:40:07,221 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:40:07,221 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 68 transitions, 725 flow [2023-10-12 17:40:07,232 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][44]] [2023-10-12 17:40:07,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:07,233 INFO L124 PetriNetUnfolderBase]: 30/61 cut-off events. [2023-10-12 17:40:07,233 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:40:07,233 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:07,234 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]true [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [2023-10-12 17:40:07,234 INFO L750 eck$LassoCheckResult]: Loop: 77#[L57-1, L25-1]true [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 40#[L23, L57-1]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 77#[L57-1, L25-1]true [2023-10-12 17:40:07,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 2 times [2023-10-12 17:40:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684321263] [2023-10-12 17:40:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:07,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:07,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:07,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:40:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:07,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934982201] [2023-10-12 17:40:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:07,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:07,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:07,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2138975869, now seen corresponding path program 3 times [2023-10-12 17:40:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667240319] [2023-10-12 17:40:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:07,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:07,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:07,471 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:07,471 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:07,471 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:07,471 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:07,471 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:07,471 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:07,472 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:07,472 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:07,472 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:40:07,472 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:07,472 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:07,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:07,476 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:40:07,479 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:40:07,655 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:07,656 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:07,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:07,815 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:40:07,818 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:40:07,820 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:40:07,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:07,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:07,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:07,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:07,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:07,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:07,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:07,853 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:40:07,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:07,854 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:40:07,864 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:40:07,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:07,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:07,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:07,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:07,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:07,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:07,889 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:40:07,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:07,925 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:40:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:07,927 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:40:07,933 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:40:07,934 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:40:07,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:07,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:07,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:07,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:07,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:07,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:07,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:07,969 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:40:07,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:07,971 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:40:07,980 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:40:07,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:07,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:07,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:07,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:07,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:07,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:08,005 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:40:08,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:08,020 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:40:08,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:08,022 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:40:08,023 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:40:08,025 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:40:08,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:08,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:08,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:08,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:08,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:08,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:08,051 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:08,064 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:40:08,064 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:40:08,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:08,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:08,071 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:40:08,072 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:40:08,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:08,098 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:08,098 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:08,098 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:40:08,105 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:40:08,109 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:40:08,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:08,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:08,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:08,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:08,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:08,150 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:40:08,150 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:40:08,296 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:40:08,299 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:40:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:40:08,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:40:08,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:08,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:40:08,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:08,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:40:08,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:08,304 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 340 transitions, 4305 flow [2023-10-12 17:40:08,304 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:40:08,304 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 340 transitions, 4305 flow [2023-10-12 17:40:08,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:08,335 INFO L124 PetriNetUnfolderBase]: 65/120 cut-off events. [2023-10-12 17:40:08,335 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-10-12 17:40:08,335 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:08,337 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 118#[L39, L58, L25-1]true [2023-10-12 17:40:08,337 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 118#[L39, L58, L25-1]true [2023-10-12 17:40:08,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1458778110, now seen corresponding path program 1 times [2023-10-12 17:40:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:08,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652392810] [2023-10-12 17:40:08,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:08,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:08,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:08,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 3 times [2023-10-12 17:40:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864250624] [2023-10-12 17:40:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:08,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:08,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:08,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1726427704, now seen corresponding path program 2 times [2023-10-12 17:40:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398945488] [2023-10-12 17:40:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:08,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:08,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:08,616 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:40:08,700 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:08,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:08,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:08,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:08,701 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:08,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:08,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:08,701 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:08,701 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:40:08,701 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:08,701 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:08,704 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:40:08,707 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:40:08,710 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:08,714 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:40:08,717 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:40:08,719 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:40:09,042 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:09,042 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,044 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:40:09,057 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:40:09,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:09,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:09,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:09,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:09,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:09,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:09,069 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:40:09,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:09,083 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:40:09,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,085 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:40:09,096 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:40:09,099 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:40:09,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:09,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:09,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:09,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:09,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:09,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:09,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:09,113 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:40:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,114 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:40:09,117 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:40:09,118 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:40:09,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:09,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:09,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:09,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:09,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:09,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:09,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:09,155 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:40:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,157 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:40:09,170 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:40:09,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:09,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:09,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:09,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:09,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:09,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:09,183 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:40:09,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:09,195 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:40:09,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,196 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:40:09,201 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:40:09,201 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:40:09,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:09,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:09,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:09,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:09,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:09,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:09,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:09,229 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:40:09,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,230 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:40:09,233 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:40:09,234 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:40:09,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:09,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:09,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:09,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:09,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:09,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:09,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:09,272 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:40:09,273 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:40:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:09,277 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:40:09,284 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:40:09,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:09,306 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:09,306 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:09,306 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:40:09,313 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:40:09,315 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:40:09,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:09,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:09,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:09,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:09,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:09,357 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:40:09,357 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:40:09,421 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:40:09,421 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:40:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:40:09,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:40:09,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:09,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:40:09,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:09,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:40:09,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:09,423 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 1700 transitions, 24925 flow [2023-10-12 17:40:09,423 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:40:09,423 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 1700 transitions, 24925 flow [2023-10-12 17:40:09,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:09,530 INFO L124 PetriNetUnfolderBase]: 194/353 cut-off events. [2023-10-12 17:40:09,530 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:40:09,530 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:09,531 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#[L40, L23, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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#[L40, L23, L58]true [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 118#[L39, L58, L25-1]true [2023-10-12 17:40:09,531 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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 118#[L39, L58, L25-1]true [2023-10-12 17:40:09,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1334115097, now seen corresponding path program 3 times [2023-10-12 17:40:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:09,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656549497] [2023-10-12 17:40:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:09,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:09,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:09,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:40:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80205488] [2023-10-12 17:40:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:09,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:09,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:09,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2110615777, now seen corresponding path program 4 times [2023-10-12 17:40:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294521507] [2023-10-12 17:40:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:09,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:09,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:09,946 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:09,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:09,947 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:09,947 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:09,947 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:09,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:09,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:09,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:09,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:40:09,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:09,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:09,949 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:40:09,952 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:40:09,954 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:40:09,957 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:40:09,959 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:40:09,980 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:40:09,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:10,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:10,421 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:10,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,423 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:40:10,425 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:40:10,426 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:40:10,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:10,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:10,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:10,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:10,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:10,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:10,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:10,454 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:40:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,455 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:40:10,465 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:40:10,473 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:40:10,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:10,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:10,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:10,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:10,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:10,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:10,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:10,488 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:40:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,490 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:40:10,491 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:40:10,493 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:40:10,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:10,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:10,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:10,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:10,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:10,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:10,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:10,529 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:40:10,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,531 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:40:10,546 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:40:10,549 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:40:10,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:10,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:10,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:10,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:10,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:10,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:10,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:10,578 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:40:10,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,580 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:40:10,588 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:40:10,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:10,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:10,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:10,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:10,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:10,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:10,603 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:40:10,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:10,620 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:40:10,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,622 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:40:10,625 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:40:10,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:10,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:10,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:10,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:10,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:10,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:10,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:10,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:10,665 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:40:10,665 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:40:10,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:10,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:10,669 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:40:10,672 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:40:10,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:10,698 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:10,698 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:10,698 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:40:10,709 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:40:10,720 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:40:10,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:10,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:10,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:10,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:10,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:10,767 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:40:10,767 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:40:10,879 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:40:10,880 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:40:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:40:10,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:40:10,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:10,881 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:10,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:10,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:10,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:10,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:10,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:10,920 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:40:10,920 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:40:11,018 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:40:11,019 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:40:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:40:11,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:40:11,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:11,020 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:11,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:11,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:11,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:11,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:11,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:11,062 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:40:11,062 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:40:11,063 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:40:11,128 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:40:11,130 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:40:11,271 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:40:11,271 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:40:11,272 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:40:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2023-10-12 17:40:11,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:40:11,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:11,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:40:11,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:11,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:40:11,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:11,273 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 19200 transitions, 320700 flow [2023-10-12 17:40:11,273 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:40:11,273 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 19200 transitions, 320700 flow [2023-10-12 17:40:11,563 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:40:12,369 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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:40:12,936 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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:40:13,107 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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:40:13,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[][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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:40:14,896 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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][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)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old][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_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i][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) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end][11459]] [2023-10-12 17:40:16,052 INFO L124 PetriNetUnfolderBase]: 820/1421 cut-off events. [2023-10-12 17:40:16,053 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2023-10-12 17:40:16,053 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:16,059 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:16 BoogieIcfgContainer [2023-10-12 17:40:16,059 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:16,060 INFO L158 Benchmark]: Toolchain (without parser) took 11762.01ms. Allocated memory was 188.7MB in the beginning and 362.8MB in the end (delta: 174.1MB). Free memory was 140.4MB in the beginning and 162.3MB in the end (delta: -21.9MB). Peak memory consumption was 261.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:16,061 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 188.7MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:16,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.70ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 138.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:16,061 INFO L158 Benchmark]: Boogie Preprocessor took 15.50ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 137.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:16,062 INFO L158 Benchmark]: RCFGBuilder took 254.30ms. Allocated memory is still 188.7MB. Free memory was 137.7MB in the beginning and 127.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:40:16,062 INFO L158 Benchmark]: BuchiAutomizer took 11465.50ms. Allocated memory was 188.7MB in the beginning and 362.8MB in the end (delta: 174.1MB). Free memory was 127.5MB in the beginning and 162.3MB in the end (delta: -34.8MB). Peak memory consumption was 248.8MB. Max. memory is 8.0GB. [2023-10-12 17:40:16,063 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.27ms. Allocated memory is still 188.7MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.70ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 138.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.50ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 137.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.30ms. Allocated memory is still 188.7MB. Free memory was 137.7MB in the beginning and 127.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 11465.50ms. Allocated memory was 188.7MB in the beginning and 362.8MB in the end (delta: 174.1MB). Free memory was 127.5MB in the beginning and 162.3MB in the end (delta: -34.8MB). Peak memory consumption was 248.8MB. 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.3s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. 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.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.4s 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: 38ms 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.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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: 69, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 44, dependent conditional: 0, dependent unconditional: 44, 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:40:16,081 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:40:16,285 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...