/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/queue-add-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:14,975 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:15,038 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:42:15,054 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:15,054 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:15,054 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:15,055 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:15,055 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:15,056 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:15,056 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:15,056 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:15,056 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:15,057 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:15,057 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:15,057 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:15,057 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:15,057 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:15,058 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:15,058 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:15,058 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:15,058 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:15,065 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:15,065 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:15,065 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:15,065 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:15,065 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:15,065 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:15,066 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:15,066 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:15,066 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:15,066 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:15,066 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:15,066 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:15,067 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:15,067 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:42:15,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:15,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:15,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:15,265 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:15,266 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:15,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl [2023-10-12 17:42:15,267 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl' [2023-10-12 17:42:15,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:15,291 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:15,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:15,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:15,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:15,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,312 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:15,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:15,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:15,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:15,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:15,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:15,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:15,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:15,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:15,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,347 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:42:15,350 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:42:15,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:15,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:15,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:15,384 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:42:15,419 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:15,420 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:15,517 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:15,535 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:15,535 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:15,537 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:15 BoogieIcfgContainer [2023-10-12 17:42:15,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:15,537 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:15,537 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:15,542 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:15,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:15,543 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/2) ... [2023-10-12 17:42:15,544 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ea238c9 and model type queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:15, skipping insertion in model container [2023-10-12 17:42:15,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:15,544 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:15" (2/2) ... [2023-10-12 17:42:15,553 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-2.wvr.bpl [2023-10-12 17:42:15,592 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:42:15,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 72 flow [2023-10-12 17:42:15,626 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-10-12 17:42:15,626 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:42:15,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:42:15,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 72 flow [2023-10-12 17:42:15,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2023-10-12 17:42:15,647 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:15,656 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 60 flow [2023-10-12 17:42:15,658 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 60 flow [2023-10-12 17:42:15,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 60 flow [2023-10-12 17:42:15,663 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-10-12 17:42:15,663 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:42:15,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:42:15,664 INFO L119 LiptonReduction]: Number of co-enabled transitions 142 [2023-10-12 17:42:15,952 INFO L134 LiptonReduction]: Checked pairs total: 132 [2023-10-12 17:42:15,953 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:42:15,962 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:15,962 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:15,962 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:15,962 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:15,962 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:15,962 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:15,962 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:15,962 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:15,963 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:42:15,965 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][5], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][4], 3:3A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][0]][4:4A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][11]] [2023-10-12 17:42:15,966 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:15,967 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:42:15,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:15,967 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:15,969 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:15,969 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:42:15,970 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][5], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][4], 3:3A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][0]][4:4A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][11]] [2023-10-12 17:42:15,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:15,970 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:42:15,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:15,971 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:15,974 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 41#[L22-1, L55-1]true [2023-10-12 17:42:15,974 INFO L750 eck$LassoCheckResult]: Loop: 41#[L22-1, L55-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 41#[L22-1, L55-1]true [2023-10-12 17:42:15,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 89065, now seen corresponding path program 1 times [2023-10-12 17:42:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791278918] [2023-10-12 17:42:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 126, now seen corresponding path program 1 times [2023-10-12 17:42:16,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259020289] [2023-10-12 17:42:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2761110, now seen corresponding path program 1 times [2023-10-12 17:42:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300589043] [2023-10-12 17:42:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,167 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:16,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:16,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:16,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:16,168 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:16,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,168 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:16,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:16,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:16,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:16,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:16,178 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:42:16,193 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:42:16,195 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:42:16,244 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:16,247 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:16,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,249 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:42:16,250 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:42:16,252 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:42:16,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:16,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:16,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:16,295 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:42:16,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,297 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:42:16,304 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:42:16,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:16,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:16,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:16,315 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:42:16,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:16,329 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:42:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,331 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:42:16,334 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:42:16,335 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:42:16,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:16,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:16,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:16,369 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:42:16,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,371 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:42:16,379 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:42:16,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:16,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:16,396 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:42:16,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:16,431 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:16,431 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:16,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,435 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:42:16,436 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:42:16,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:16,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:16,459 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:16,459 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:42:16,465 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:42:16,467 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:16,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:16,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:16,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:16,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:16,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:16,508 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:42:16,528 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:42:16,611 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:42:16,620 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:42:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:42:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:16,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:42:16,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:16,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:42:16,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:16,627 INFO L430 stractBuchiCegarLoop]: Abstraction has has 23 places, 65 transitions, 320 flow [2023-10-12 17:42:16,627 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:16,628 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 65 transitions, 320 flow [2023-10-12 17:42:16,632 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][25], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][20], 5:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][15], 14:4A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][30]][15:5A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][60]] [2023-10-12 17:42:16,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:16,633 INFO L124 PetriNetUnfolderBase]: 6/14 cut-off events. [2023-10-12 17:42:16,633 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:42:16,633 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:16,634 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[$Ultimate##0, L56, $Ultimate##0]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 83#[L56, $Ultimate##0, L40-1]true [2023-10-12 17:42:16,634 INFO L750 eck$LassoCheckResult]: Loop: 83#[L56, $Ultimate##0, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 83#[L56, $Ultimate##0, L40-1]true [2023-10-12 17:42:16,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2761728, now seen corresponding path program 1 times [2023-10-12 17:42:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954562706] [2023-10-12 17:42:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 1 times [2023-10-12 17:42:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858630120] [2023-10-12 17:42:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash 85613666, now seen corresponding path program 1 times [2023-10-12 17:42:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585358557] [2023-10-12 17:42:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:16,734 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:42:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585358557] [2023-10-12 17:42:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585358557] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:16,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:42:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103517973] [2023-10-12 17:42:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:42:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:42:16,811 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:42:16,811 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:16,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:16,847 INFO L124 PetriNetUnfolderBase]: 33/61 cut-off events. [2023-10-12 17:42:16,847 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:42:16,847 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 126 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:42:16,851 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 25 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-10-12 17:42:16,851 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 22 places, 30 transitions, 201 flow [2023-10-12 17:42:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:42:16,853 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 30 transitions, 201 flow [2023-10-12 17:42:16,854 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:16,854 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 30 transitions, 201 flow [2023-10-12 17:42:16,864 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][0], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 15:4A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][7], 20:5A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][2], 31:6A:[96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back][5]][32:7A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][25]] [2023-10-12 17:42:16,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:16,864 INFO L124 PetriNetUnfolderBase]: 15/31 cut-off events. [2023-10-12 17:42:16,864 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:42:16,864 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:16,865 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[$Ultimate##0, L56, $Ultimate##0]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 83#[L56, $Ultimate##0, L40-1]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 100#[L22-1, L56, L40-1]true [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 102#[L56, L40-1, thread1EXIT]true [2023-10-12 17:42:16,865 INFO L750 eck$LassoCheckResult]: Loop: 102#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 102#[L56, L40-1, thread1EXIT]true [2023-10-12 17:42:16,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1640944608, now seen corresponding path program 1 times [2023-10-12 17:42:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784102317] [2023-10-12 17:42:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 2 times [2023-10-12 17:42:16,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205368666] [2023-10-12 17:42:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 670324802, now seen corresponding path program 1 times [2023-10-12 17:42:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933078671] [2023-10-12 17:42:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,005 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:17,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:17,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:17,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:17,006 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:17,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:17,006 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:17,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:42:17,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:17,006 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:17,008 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:42:17,010 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:42:17,035 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:42:17,038 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:42:17,040 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:42:17,042 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:42:17,193 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:17,193 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:17,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,197 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:42:17,216 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:42:17,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:17,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:17,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:17,231 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:42:17,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:17,243 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:42:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,273 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:42:17,275 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:42:17,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,281 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:42:17,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,295 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:42:17,315 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:42:17,315 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:42:17,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:17,347 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:42:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,352 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:42:17,352 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:42:17,368 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:42:17,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:17,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:17,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:17,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:17,392 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:17,392 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:17,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,399 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:42:17,403 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:17,416 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:42:17,437 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:17,438 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:17,438 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:42:17,447 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:42:17,448 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:17,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:17,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:17,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:17,475 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:42:17,475 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:42:17,529 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:42:17,531 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:42:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:42:17,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:42:17,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:42:17,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:42:17,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,535 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 150 transitions, 1305 flow [2023-10-12 17:42:17,535 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:42:17,535 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 150 transitions, 1305 flow [2023-10-12 17:42:17,544 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][2], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][7], 4:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][17], 5:4A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][12], 16:5A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][32], 44:6A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][97]][46:7A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][127]] [2023-10-12 17:42:17,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:17,544 INFO L124 PetriNetUnfolderBase]: 24/45 cut-off events. [2023-10-12 17:42:17,544 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:42:17,544 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:17,545 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[$Ultimate##0, L56, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 146#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 146#[L22-1, $Ultimate##0, L56]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:17,545 INFO L750 eck$LassoCheckResult]: Loop: 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:17,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1640971519, now seen corresponding path program 1 times [2023-10-12 17:42:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243011373] [2023-10-12 17:42:17,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 3 times [2023-10-12 17:42:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28910186] [2023-10-12 17:42:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 669490561, now seen corresponding path program 1 times [2023-10-12 17:42:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326748989] [2023-10-12 17:42:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,718 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:17,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:17,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:17,718 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:17,718 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:17,718 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,718 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:17,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:17,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:42:17,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:17,719 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:17,722 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:42:17,747 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:42:17,750 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:42:17,752 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:42:17,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:17,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:17,884 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:42:17,887 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:42:17,914 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:17,914 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:17,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,916 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:42:17,923 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:42:17,923 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:42:17,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:17,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:17,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:17,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:17,951 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:17,951 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:42:17,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,953 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:42:17,955 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:42:17,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:17,989 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:17,989 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:17,989 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:42:17,995 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:42:17,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:18,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:18,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:18,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:18,020 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:42:18,021 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:42:18,066 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:42:18,067 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:42:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:42:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:42:18,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:42:18,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:18,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:42:18,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:18,068 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 750 transitions, 8025 flow [2023-10-12 17:42:18,068 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:42:18,068 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 750 transitions, 8025 flow [2023-10-12 17:42:18,077 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][14], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][39], 4:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][89], 14:4A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][189], 15:5A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][63], 35:6A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][160], 55:7A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][662]][57:8A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][637]] [2023-10-12 17:42:18,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:18,077 INFO L124 PetriNetUnfolderBase]: 28/56 cut-off events. [2023-10-12 17:42:18,077 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-10-12 17:42:18,078 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:18,078 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[$Ultimate##0, L56, $Ultimate##0]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 83#[L56, $Ultimate##0, L40-1]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 100#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:18,078 INFO L750 eck$LassoCheckResult]: Loop: 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:18,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 670324771, now seen corresponding path program 2 times [2023-10-12 17:42:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115790655] [2023-10-12 17:42:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 4 times [2023-10-12 17:42:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059191846] [2023-10-12 17:42:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -694768481, now seen corresponding path program 3 times [2023-10-12 17:42:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478578252] [2023-10-12 17:42:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,122 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:42:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478578252] [2023-10-12 17:42:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478578252] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:18,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:42:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758024849] [2023-10-12 17:42:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:42:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:42:18,169 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:42:18,169 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:18,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:18,225 INFO L124 PetriNetUnfolderBase]: 73/159 cut-off events. [2023-10-12 17:42:18,225 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:42:18,226 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 24. Compared 583 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:42:18,228 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 93 selfloop transitions, 35 changer transitions 0/128 dead transitions. [2023-10-12 17:42:18,228 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 32 places, 128 transitions, 1626 flow [2023-10-12 17:42:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:42:18,231 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 128 transitions, 1626 flow [2023-10-12 17:42:18,231 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:42:18,231 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 128 transitions, 1626 flow [2023-10-12 17:42:18,245 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][0], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][2], 5:4A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][3], 13:5A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][6], 36:6A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][18], 62:7A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][41], 107:8A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][73]][109:9A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][107]] [2023-10-12 17:42:18,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:18,246 INFO L124 PetriNetUnfolderBase]: 53/108 cut-off events. [2023-10-12 17:42:18,246 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-10-12 17:42:18,246 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:18,247 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[$Ultimate##0, L56, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 146#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 146#[L22-1, $Ultimate##0, L56]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 100#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:18,248 INFO L750 eck$LassoCheckResult]: Loop: 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:18,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash -720629084, now seen corresponding path program 4 times [2023-10-12 17:42:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651903062] [2023-10-12 17:42:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 5 times [2023-10-12 17:42:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15100888] [2023-10-12 17:42:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -864665026, now seen corresponding path program 5 times [2023-10-12 17:42:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015782944] [2023-10-12 17:42:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,463 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:18,463 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:18,463 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:18,463 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:18,463 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:18,463 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:18,463 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:18,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:18,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:42:18,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:18,464 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:18,467 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:42:18,526 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:42:18,529 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:42:18,531 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:42:18,534 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:42:18,536 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:42:18,698 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:18,698 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:18,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:18,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:18,699 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:42:18,701 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:42:18,703 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:42:18,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:18,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:18,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:18,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:18,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:18,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:18,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:18,733 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:42:18,734 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:42:18,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:18,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:18,735 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:42:18,737 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:42:18,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:18,759 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:18,759 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:18,759 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:42:18,762 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:42:18,764 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:42:18,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:18,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:18,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:18,787 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:42:18,787 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:42:18,830 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:42:18,830 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:42:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:42:18,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:42:18,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:18,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:42:18,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:18,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:42:18,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:18,831 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 640 transitions, 9410 flow [2023-10-12 17:42:18,831 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:42:18,831 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 640 transitions, 9410 flow [2023-10-12 17:42:18,854 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][0], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][10], 5:4A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][15], 13:5A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][30], 32:6A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][70], 54:7A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][185], 90:8A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][320], 139:9A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][311], 184:10A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][368]][186:11A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][538]] [2023-10-12 17:42:18,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:18,854 INFO L124 PetriNetUnfolderBase]: 87/185 cut-off events. [2023-10-12 17:42:18,854 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-10-12 17:42:18,854 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:18,855 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[$Ultimate##0, L56, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 146#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 146#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 146#[L22-1, $Ultimate##0, L56]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:18,855 INFO L750 eck$LassoCheckResult]: Loop: 100#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 100#[L22-1, L56, L40-1]true [2023-10-12 17:42:18,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1033024565, now seen corresponding path program 6 times [2023-10-12 17:42:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444103920] [2023-10-12 17:42:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 6 times [2023-10-12 17:42:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035931756] [2023-10-12 17:42:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1958990345, now seen corresponding path program 7 times [2023-10-12 17:42:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699363331] [2023-10-12 17:42:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:42:18,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:42:19,095 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:19,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:19,096 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:19,096 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:19,096 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:19,096 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,096 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:19,096 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:19,096 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:42:19,096 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:19,096 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:19,097 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:42:19,175 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:42:19,177 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:42:19,179 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:42:19,181 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:42:19,183 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:42:19,394 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:19,394 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:19,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,397 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:42:19,399 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:42:19,401 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:42:19,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:19,428 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:19,429 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:42:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,430 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:42:19,437 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:42:19,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:19,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:19,458 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:19,459 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:42:19,463 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:42:19,466 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:42:19,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,498 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:42:19,498 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:42:19,564 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:42:19,566 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:42:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:42:19,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:19,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:19,566 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:19,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,592 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:42:19,592 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:42:19,638 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:42:19,638 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:42:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:42:19,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:19,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:19,639 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:19,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,673 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:42:19,673 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:42:19,674 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:42:19,722 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 214 transitions. [2023-10-12 17:42:19,723 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:42:19,751 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:42:19,752 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:42:19,752 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:42:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2023-10-12 17:42:19,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:19,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:19,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:42:19,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:19,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:42:19,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:19,753 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 6600 transitions, 111000 flow [2023-10-12 17:42:19,753 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:42:19,753 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 6600 transitions, 111000 flow [2023-10-12 17:42:19,922 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:42:20,098 ERROR L47 etriNetUnfolderRabin]: [1:1A:[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[][4], 2:2A:[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][65], 3:3A:[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][124], 5:4A:[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][185], 13:5A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][362], 32:6A:[93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s][965], 66:7A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][2262], 134:8A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][3955], 235:9A:[95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i][2567], 298:10A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][3746]][301:11A:[98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s][5471]] [2023-10-12 17:42:20,187 INFO L124 PetriNetUnfolderBase]: 169/406 cut-off events. [2023-10-12 17:42:20,187 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-10-12 17:42:20,187 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:42:20,191 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:20 BoogieIcfgContainer [2023-10-12 17:42:20,191 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:20,192 INFO L158 Benchmark]: Toolchain (without parser) took 4900.18ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 142.7MB in the beginning and 127.4MB in the end (delta: 15.3MB). Peak memory consumption was 158.4MB. Max. memory is 8.0GB. [2023-10-12 17:42:20,192 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 189.8MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:20,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.66ms. Allocated memory is still 189.8MB. Free memory was 142.6MB in the beginning and 141.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:20,192 INFO L158 Benchmark]: Boogie Preprocessor took 11.91ms. Allocated memory is still 189.8MB. Free memory was 141.1MB in the beginning and 140.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:20,192 INFO L158 Benchmark]: RCFGBuilder took 210.80ms. Allocated memory is still 189.8MB. Free memory was 140.1MB in the beginning and 129.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:42:20,193 INFO L158 Benchmark]: BuchiAutomizer took 4653.76ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 129.7MB in the beginning and 127.4MB in the end (delta: 2.3MB). Peak memory consumption was 145.8MB. Max. memory is 8.0GB. [2023-10-12 17:42:20,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22ms. Allocated memory is still 189.8MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.66ms. Allocated memory is still 189.8MB. Free memory was 142.6MB in the beginning and 141.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.91ms. Allocated memory is still 189.8MB. Free memory was 141.1MB in the beginning and 140.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.80ms. Allocated memory is still 189.8MB. Free memory was 140.1MB in the beginning and 129.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 4653.76ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 129.7MB in the beginning and 127.4MB in the end (delta: 2.3MB). Peak memory consumption was 145.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (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 4.5s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. 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, 480 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 273 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital69 mio100 ax100 hnf100 lsp72 ukn97 mio100 lsp74 div100 bol114 ite100 ukn100 eq178 hnf91 smp100 dnf232 smp66 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 100ms 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.3s - 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.3s, 29 PlacesBefore, 18 PlacesAfterwards, 24 TransitionsBefore, 13 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 132 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 92, unknown conditional: 0, unknown unconditional: 92] , 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:42:20,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...