/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/queue-add-2-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:41,373 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:41,433 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:41,457 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:41,458 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:41,458 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:41,459 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:41,459 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:41,460 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:41,462 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:41,463 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:41,463 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:41,463 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:41,464 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:41,464 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:41,465 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:41,465 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:41,465 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:41,465 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:41,465 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:41,466 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:41,466 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:41,467 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:41,467 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:41,467 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:41,467 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:41,467 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:41,468 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:41,468 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:41,468 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:41,469 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:41,469 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:41,469 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:41,470 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:41,470 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:41,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:41,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:41,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:41,695 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:41,695 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:41,696 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/queue-add-2-nl.wvr.bpl [2023-10-12 17:40:41,696 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl' [2023-10-12 17:40:41,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:41,718 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:41,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:41,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:41,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:41,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,736 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:41,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:41,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:41,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:41,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:41,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:41,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:41,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:41,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:41,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/1) ... [2023-10-12 17:40:41,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:41,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:41,776 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:41,781 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:41,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:41,802 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:41,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:41,802 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:41,803 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:41,803 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:41,840 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:41,842 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:41,939 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:41,951 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:41,951 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:41,952 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:41 BoogieIcfgContainer [2023-10-12 17:40:41,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:41,953 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:41,953 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:41,956 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:41,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:41,957 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:41" (1/2) ... [2023-10-12 17:40:41,957 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14a80d80 and model type queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:41, skipping insertion in model container [2023-10-12 17:40:41,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:41,958 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:41" (2/2) ... [2023-10-12 17:40:41,958 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-2-nl.wvr.bpl [2023-10-12 17:40:42,001 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:40:42,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 78 flow [2023-10-12 17:40:42,059 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:40:42,060 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:40:42,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:40:42,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 78 flow [2023-10-12 17:40:42,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 27 transitions, 66 flow [2023-10-12 17:40:42,068 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:42,078 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 66 flow [2023-10-12 17:40:42,079 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 66 flow [2023-10-12 17:40:42,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 66 flow [2023-10-12 17:40:42,086 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:40:42,086 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:40:42,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:40:42,087 INFO L119 LiptonReduction]: Number of co-enabled transitions 198 [2023-10-12 17:40:42,565 INFO L134 LiptonReduction]: Checked pairs total: 172 [2023-10-12 17:40:42,565 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:40:42,576 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:42,576 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:42,576 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:42,576 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:42,577 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:42,577 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:42,577 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:42,577 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:42,578 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:40:42,581 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][4], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][0], 4:3A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][5]][5:4A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][11]] [2023-10-12 17:40:42,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:42,585 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:40:42,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:42,586 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:42,588 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:42,590 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:40:42,592 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][4], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][0], 4:3A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][5]][5:4A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][11]] [2023-10-12 17:40:42,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:42,592 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:40:42,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:42,592 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:42,596 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 44#[L61-1, L25-1]true [2023-10-12 17:40:42,596 INFO L750 eck$LassoCheckResult]: Loop: 44#[L61-1, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 44#[L61-1, L25-1]true [2023-10-12 17:40:42,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 98092, now seen corresponding path program 1 times [2023-10-12 17:40:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708735667] [2023-10-12 17:40:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:42,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:42,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:42,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2023-10-12 17:40:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423464202] [2023-10-12 17:40:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:42,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:42,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:42,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 3040961, now seen corresponding path program 1 times [2023-10-12 17:40:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993633313] [2023-10-12 17:40:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:42,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:42,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:42,840 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:42,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:42,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:42,841 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:42,842 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:42,842 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:42,842 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:42,842 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:42,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:42,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:42,842 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:42,853 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:42,862 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:42,865 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:42,872 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:42,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:42,946 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:42,948 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:42,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:42,952 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:42,953 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:42,955 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:42,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:42,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:42,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:42,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:42,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:42,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:42,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:42,989 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:42,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:42,990 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:42,992 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:42,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:43,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:43,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:43,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:43,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:43,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:43,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:43,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:43,028 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:43,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,030 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:43,032 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:43,034 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:43,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:43,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:43,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:43,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:43,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:43,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:43,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:43,093 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:40:43,094 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:40:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,098 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:43,099 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:43,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:43,140 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:43,141 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:43,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:40:43,146 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:43,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:43,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:43,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:43,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:43,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:43,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:43,203 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:43,234 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:43,313 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:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2023-10-12 17:40:43,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:43,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:43,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:43,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:43,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:43,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:43,322 INFO L430 stractBuchiCegarLoop]: Abstraction has has 23 places, 65 transitions, 320 flow [2023-10-12 17:40:43,322 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:43,322 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 65 transitions, 320 flow [2023-10-12 17:40:43,324 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][20], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][0], 3:3A:[90] L61-1-->$Ultimate##0: 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][5], 8:4A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][30]][9:5A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][60]] [2023-10-12 17:40:43,324 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:43,324 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2023-10-12 17:40:43,324 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:40:43,324 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:43,325 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: 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] 84#[L62, $Ultimate##0, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 86#[L45-1, L62, $Ultimate##0]true [2023-10-12 17:40:43,325 INFO L750 eck$LassoCheckResult]: Loop: 86#[L45-1, L62, $Ultimate##0]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 86#[L45-1, L62, $Ultimate##0]true [2023-10-12 17:40:43,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash 3041574, now seen corresponding path program 1 times [2023-10-12 17:40:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:43,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012842839] [2023-10-12 17:40:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:43,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,349 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:40:43,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:43,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482491289] [2023-10-12 17:40:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:43,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash 94288904, now seen corresponding path program 1 times [2023-10-12 17:40:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786789202] [2023-10-12 17:40:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:43,427 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:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786789202] [2023-10-12 17:40:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786789202] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:43,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:40:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517222470] [2023-10-12 17:40:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:40:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:40:43,514 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 23 places, 65 transitions, 320 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:43,514 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:43,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:43,541 INFO L124 PetriNetUnfolderBase]: 33/61 cut-off events. [2023-10-12 17:40:43,541 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:40:43,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 61 events. 33/61 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 161. Up to 48 conditions per place. [2023-10-12 17:40:43,543 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 25 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-10-12 17:40:43,543 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 22 places, 30 transitions, 201 flow [2023-10-12 17:40:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:40:43,544 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 30 transitions, 201 flow [2023-10-12 17:40:43,545 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:43,545 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 30 transitions, 201 flow [2023-10-12 17:40:43,549 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][0], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 3:3A:[90] L61-1-->$Ultimate##0: 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], 6:4A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][4], 16:5A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][3], 35:6A:[108] L25-1-->thread1EXIT: Formula: (and (= v_x_23 (+ v_C_12 v_x_24)) (= (select v_q_30 v_q_back_52) 0) (= v_q_back_51 (+ v_q_back_52 1)) (<= v_N_15 v_i_12)) InVars {q=v_q_30, q_back=v_q_back_52, N=v_N_15, i=v_i_12, x=v_x_24, C=v_C_12} OutVars{q=v_q_30, q_back=v_q_back_51, N=v_N_15, i=v_i_12, x=v_x_23, C=v_C_12} AuxVars[] AssignedVars[q_back, x][7]][36:7A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][27]] [2023-10-12 17:40:43,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:43,550 INFO L124 PetriNetUnfolderBase]: 18/35 cut-off events. [2023-10-12 17:40:43,550 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:40:43,550 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:43,550 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: 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] 84#[L62, $Ultimate##0, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 86#[L45-1, L62, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 103#[L45-1, L62, L25-1]true [108] L25-1-->thread1EXIT: Formula: (and (= v_x_23 (+ v_C_12 v_x_24)) (= (select v_q_30 v_q_back_52) 0) (= v_q_back_51 (+ v_q_back_52 1)) (<= v_N_15 v_i_12)) InVars {q=v_q_30, q_back=v_q_back_52, N=v_N_15, i=v_i_12, x=v_x_24, C=v_C_12} OutVars{q=v_q_30, q_back=v_q_back_51, N=v_N_15, i=v_i_12, x=v_x_23, C=v_C_12} AuxVars[] AssignedVars[q_back, x] 105#[L45-1, L62, thread1EXIT]true [2023-10-12 17:40:43,550 INFO L750 eck$LassoCheckResult]: Loop: 105#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 105#[L45-1, L62, thread1EXIT]true [2023-10-12 17:40:43,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1372012404, now seen corresponding path program 1 times [2023-10-12 17:40:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610778092] [2023-10-12 17:40:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:43,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 2 times [2023-10-12 17:40:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:43,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148987943] [2023-10-12 17:40:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:43,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash 417288546, now seen corresponding path program 1 times [2023-10-12 17:40:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128580145] [2023-10-12 17:40:43,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:43,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:43,698 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:43,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:43,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:43,699 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:43,699 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:43,699 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,699 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:43,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:43,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:43,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:43,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:43,700 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:43,703 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:43,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:43,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:43,709 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:43,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:43,716 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:43,828 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:43,927 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:43,927 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,929 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:43,931 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:43,933 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:43,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:43,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:43,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:43,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:43,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:43,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:43,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:43,966 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:43,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:40:43,974 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:43,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:43,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:43,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:43,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:43,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:43,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:43,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:43,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:43,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,998 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:44,000 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:44,005 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:44,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,029 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:44,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,031 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:44,033 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:44,034 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:44,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,062 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:44,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,064 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:44,071 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:44,071 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:44,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,100 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:44,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,101 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:44,105 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:44,106 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:44,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,139 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:44,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,140 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:44,142 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:44,144 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:44,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,169 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:44,179 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:40:44,179 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:40:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,181 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:44,183 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:44,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:44,205 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:44,205 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:44,205 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2023-10-12 17:40:44,211 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:44,212 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:44,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:44,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:44,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:44,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:44,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:44,249 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:44,249 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:44,309 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:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:40:44,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:40:44,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:44,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:40:44,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:44,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:40:44,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:44,311 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 150 transitions, 1305 flow [2023-10-12 17:40:44,311 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:44,311 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 150 transitions, 1305 flow [2023-10-12 17:40:44,316 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][1], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][6], 3:3A:[90] L61-1-->$Ultimate##0: 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][11], 5:4A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][16], 16:5A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][31], 42:6A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][91]][44:7A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][136]] [2023-10-12 17:40:44,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:44,317 INFO L124 PetriNetUnfolderBase]: 22/43 cut-off events. [2023-10-12 17:40:44,317 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:40:44,317 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:44,317 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: 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] 84#[L62, $Ultimate##0, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 149#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 149#[L62, L25-1, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:44,318 INFO L750 eck$LassoCheckResult]: Loop: 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:44,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1372041953, now seen corresponding path program 1 times [2023-10-12 17:40:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370591549] [2023-10-12 17:40:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 3 times [2023-10-12 17:40:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429999917] [2023-10-12 17:40:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash 416372527, now seen corresponding path program 1 times [2023-10-12 17:40:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989824337] [2023-10-12 17:40:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,469 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:44,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:44,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:44,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:44,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:44,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:44,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:44,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:40:44,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:44,469 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:44,470 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:44,472 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:44,475 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:44,480 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:44,482 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:44,484 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:44,507 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:44,659 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:44,659 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:44,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,660 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:44,669 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:44,672 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:44,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,695 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:44,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,696 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:44,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:40:44,699 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:44,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,725 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:44,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,726 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:44,727 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:44,729 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:44,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,753 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:44,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,754 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:44,758 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:44,759 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:44,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,787 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:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,789 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:44,791 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:44,793 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:44,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,821 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:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,822 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:44,824 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:44,826 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:44,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,833 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:40:44,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,851 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:40:44,851 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:40:44,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:44,886 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:44,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,887 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:44,903 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:44,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:44,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:44,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:44,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:44,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:44,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:44,924 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:44,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:44,943 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:40:44,943 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:40:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,946 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:44,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:44,976 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:44,991 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:44,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:44,992 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:44,992 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:40:44,998 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:44,998 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:45,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,028 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:45,028 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:45,080 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:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:40:45,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:40:45,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:40:45,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:40:45,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,085 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 750 transitions, 8025 flow [2023-10-12 17:40:45,085 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:40:45,085 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 750 transitions, 8025 flow [2023-10-12 17:40:45,105 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][6], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][31], 3:3A:[90] L61-1-->$Ultimate##0: 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][56], 5:4A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][81], 19:5A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][206], 38:6A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][284], 66:7A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][630]][67:8A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][680]] [2023-10-12 17:40:45,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,106 INFO L124 PetriNetUnfolderBase]: 35/66 cut-off events. [2023-10-12 17:40:45,106 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:40:45,106 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,106 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: 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] 84#[L62, $Ultimate##0, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 149#[L62, L25-1, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 103#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:45,106 INFO L750 eck$LassoCheckResult]: Loop: 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:45,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 416366017, now seen corresponding path program 2 times [2023-10-12 17:40:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038790199] [2023-10-12 17:40:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 4 times [2023-10-12 17:40:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414521546] [2023-10-12 17:40:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash 22444749, now seen corresponding path program 3 times [2023-10-12 17:40:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189322564] [2023-10-12 17:40:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189322564] [2023-10-12 17:40:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189322564] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:40:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605429518] [2023-10-12 17:40:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:45,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:40:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:40:45,241 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 32 places, 750 transitions, 8025 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:45,241 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:45,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:45,310 INFO L124 PetriNetUnfolderBase]: 73/159 cut-off events. [2023-10-12 17:40:45,311 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:40:45,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 159 events. 73/159 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 582 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 731. Up to 146 conditions per place. [2023-10-12 17:40:45,316 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 93 selfloop transitions, 35 changer transitions 0/128 dead transitions. [2023-10-12 17:40:45,317 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 32 places, 128 transitions, 1626 flow [2023-10-12 17:40:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:40:45,318 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 128 transitions, 1626 flow [2023-10-12 17:40:45,319 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:40:45,319 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 128 transitions, 1626 flow [2023-10-12 17:40:45,340 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][0], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 3:3A:[90] L61-1-->$Ultimate##0: 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], 5:4A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][3], 14:5A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][6], 38:6A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][20], 69:7A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][44], 113:8A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][76]][114:9A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][109]] [2023-10-12 17:40:45,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,341 INFO L124 PetriNetUnfolderBase]: 54/113 cut-off events. [2023-10-12 17:40:45,341 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-10-12 17:40:45,341 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,341 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: 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] 84#[L62, $Ultimate##0, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 149#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 149#[L62, L25-1, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 103#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:45,341 INFO L750 eck$LassoCheckResult]: Loop: 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:45,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,342 INFO L85 PathProgramCache]: Analyzing trace with hash 22646528, now seen corresponding path program 4 times [2023-10-12 17:40:45,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810558597] [2023-10-12 17:40:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 5 times [2023-10-12 17:40:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102092160] [2023-10-12 17:40:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 702042478, now seen corresponding path program 5 times [2023-10-12 17:40:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203655941] [2023-10-12 17:40:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,561 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:45,561 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:45,561 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:45,561 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:45,561 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:45,561 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,561 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:45,561 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:45,561 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:40:45,561 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:45,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:45,563 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:45,564 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:45,571 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:45,572 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:45,575 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:45,576 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:45,578 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:45,795 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:45,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:45,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,797 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:45,799 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:45,838 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:45,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,878 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:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,879 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:45,881 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:45,883 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:45,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,912 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:45,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,913 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:45,914 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:45,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:45,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:40:45,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,937 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:45,937 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:45,939 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:45,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-10-12 17:40:45,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,953 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:45,954 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:45,956 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:45,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:40:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,977 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:45,978 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:45,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:45,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,995 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:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,129 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:46,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:40:46,132 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:46,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:46,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:46,149 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:40:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,150 INFO L229 MonitoredProcess]: Starting monitored process 29 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:46,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:40:46,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:46,160 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:46,160 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:46,160 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:40:46,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,167 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:40:46,196 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:46,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,224 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:46,225 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:46,269 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:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:40:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:40:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:40:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:40:46,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,271 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 640 transitions, 9410 flow [2023-10-12 17:40:46,271 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:40:46,271 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 640 transitions, 9410 flow [2023-10-12 17:40:46,296 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][3], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][8], 3:3A:[90] L61-1-->$Ultimate##0: 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][13], 5:4A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][18], 14:5A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][33], 34:6A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][63], 61:7A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][203], 96:8A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][348], 141:9A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][336], 186:10A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][384]][187:11A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][549]] [2023-10-12 17:40:46,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:46,297 INFO L124 PetriNetUnfolderBase]: 86/186 cut-off events. [2023-10-12 17:40:46,297 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-10-12 17:40:46,297 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:46,297 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: 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] 84#[L62, $Ultimate##0, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 149#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 149#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 149#[L62, L25-1, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:46,297 INFO L750 eck$LassoCheckResult]: Loop: 103#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 103#[L45-1, L62, L25-1]true [2023-10-12 17:40:46,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash 294736527, now seen corresponding path program 6 times [2023-10-12 17:40:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763785029] [2023-10-12 17:40:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 6 times [2023-10-12 17:40:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:46,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596559750] [2023-10-12 17:40:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 546897855, now seen corresponding path program 7 times [2023-10-12 17:40:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197407303] [2023-10-12 17:40:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,634 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:46,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:46,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:46,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:46,635 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:46,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:46,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:46,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:40:46,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:46,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:46,636 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:46,638 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:46,725 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:46,727 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:46,729 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:46,735 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:46,737 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:46,953 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:46,953 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:46,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,954 INFO L229 MonitoredProcess]: Starting monitored process 30 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:46,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:40:46,957 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:46,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,972 INFO L229 MonitoredProcess]: Starting monitored process 31 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:46,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:40:46,975 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:46,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:46,992 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:40:46,992 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:40:46,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,993 INFO L229 MonitoredProcess]: Starting monitored process 32 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:46,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:40:46,996 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:47,003 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:47,003 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:47,003 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:40:47,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:47,011 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:40:47,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,054 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:47,055 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:47,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:47,128 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:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:40:47,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:47,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,129 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:47,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,161 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:47,161 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:47,208 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:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:40:47,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:47,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,210 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:47,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,241 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:47,241 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:47,242 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:47,299 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 248 transitions. [2023-10-12 17:40:47,301 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:40:47,339 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:40:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2023-10-12 17:40:47,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 171 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:47,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 171 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:40:47,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 171 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:40:47,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,341 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 6600 transitions, 111000 flow [2023-10-12 17:40:47,341 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:40:47,341 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 6600 transitions, 111000 flow [2023-10-12 17:40:47,779 ERROR L47 etriNetUnfolderRabin]: [1:1A:[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][36], 2:2A:[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][97], 3:3A:[90] L61-1-->$Ultimate##0: 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][156], 5:4A:[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][217], 14:5A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][364], 34:6A:[102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s][1117], 73:7A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][2444], 143:8A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][4233], 247:9A:[109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x][2833], 316:10A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][3952]][319:11A:[110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s][5597]] [2023-10-12 17:40:47,861 INFO L124 PetriNetUnfolderBase]: 169/406 cut-off events. [2023-10-12 17:40:47,861 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-10-12 17:40:47,861 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:47,865 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:47 BoogieIcfgContainer [2023-10-12 17:40:47,865 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:47,866 INFO L158 Benchmark]: Toolchain (without parser) took 6147.66ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 136.6MB in the beginning and 116.8MB in the end (delta: 19.8MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:47,866 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 137.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:47,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.57ms. Allocated memory is still 180.4MB. Free memory was 136.6MB in the beginning and 135.0MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:40:47,866 INFO L158 Benchmark]: Boogie Preprocessor took 15.52ms. Allocated memory is still 180.4MB. Free memory was 135.0MB in the beginning and 134.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:47,867 INFO L158 Benchmark]: RCFGBuilder took 198.39ms. Allocated memory is still 180.4MB. Free memory was 134.0MB in the beginning and 123.8MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:47,867 INFO L158 Benchmark]: BuchiAutomizer took 5912.22ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 123.6MB in the beginning and 116.8MB in the end (delta: 6.9MB). Peak memory consumption was 115.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:47,868 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.20ms. Allocated memory is still 180.4MB. Free memory is still 137.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.57ms. Allocated memory is still 180.4MB. Free memory was 136.6MB in the beginning and 135.0MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.52ms. Allocated memory is still 180.4MB. Free memory was 135.0MB in the beginning and 134.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 198.39ms. Allocated memory is still 180.4MB. Free memory was 134.0MB in the beginning and 123.8MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5912.22ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 123.6MB in the beginning and 116.8MB in the end (delta: 6.9MB). Peak memory consumption was 115.4MB. 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 (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. One nondeterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 315 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital85 mio100 ax100 hnf100 lsp58 ukn97 mio100 lsp74 div100 bol114 ite100 ukn100 eq178 hnf91 smp100 dnf232 smp66 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - 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, 32 PlacesBefore, 18 PlacesAfterwards, 27 TransitionsBefore, 13 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 129, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 129, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 129, unknown conditional: 0, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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:47,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...