Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947700292.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PhilosophersDyn-COL-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-00
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-01
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-02
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-03
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-04
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-05
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-06
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-07
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-08
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-09
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678815980949

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 17:46:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 17:46:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:46:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 17:46:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 17:46:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 701 ms
[2023-03-14 17:46:23] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 17:46:23] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 6 ms.
[2023-03-14 17:46:23] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-COL-20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10005 steps, including 418 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 17:46:23] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-14 17:46:23] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-14 17:46:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-14 17:46:23] [INFO ] Flatten gal took : 14 ms
FORMULA PhilosophersDyn-COL-20-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 17:46:23] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(20), Philosopher(20)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 17:46:24] [INFO ] Unfolded HLPN to a Petri net with 540 places and 17220 transitions 140780 arcs in 217 ms.
[2023-03-14 17:46:24] [INFO ] Unfolded 13 HLPN properties in 14 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-14 17:46:24] [INFO ] Reduced 379 identical enabling conditions.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
FORMULA PhilosophersDyn-COL-20-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 140 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2023-03-14 17:46:26] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2023-03-14 17:46:27] [INFO ] Computed 79 place invariants in 896 ms
[2023-03-14 17:46:33] [INFO ] Dead Transitions using invariants and state equation in 6827 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-14 17:46:35] [INFO ] Computed 79 place invariants in 1904 ms
[2023-03-14 17:46:35] [INFO ] Implicit Places using invariants in 2025 ms returned []
Implicit Place search using SMT only with invariants took 2027 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 83 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9108 ms. Remains : 540/540 places, 15470/17030 transitions.
Support contains 540 out of 540 places after structural reductions.
[2023-03-14 17:46:38] [INFO ] Flatten gal took : 1348 ms
[2023-03-14 17:46:47] [INFO ] Flatten gal took : 1733 ms
[2023-03-14 17:46:56] [INFO ] Input system was already deterministic with 15470 transitions.
Finished random walk after 415 steps, including 47 resets, run visited all 15 properties in 40 ms. (steps per millisecond=10 )
FORMULA PhilosophersDyn-COL-20-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p2)&&p1)||p0))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2913 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:47:01] [INFO ] Invariant cache hit.
[2023-03-14 17:47:06] [INFO ] Dead Transitions using invariants and state equation in 4829 ms found 0 transitions.
[2023-03-14 17:47:06] [INFO ] Invariant cache hit.
[2023-03-14 17:47:07] [INFO ] Implicit Places using invariants in 857 ms returned []
Implicit Place search using SMT only with invariants took 858 ms to find 0 implicit places.
[2023-03-14 17:47:07] [INFO ] Invariant cache hit.
[2023-03-14 17:47:12] [INFO ] Dead Transitions using invariants and state equation in 4953 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13570 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s66 1) (LT s86 1)) (OR (LT s74 1) (LT s94 1)) (OR (LT s79 1) (LT s99 1)) (OR (LT s64 1) (LT s84 1)) (OR (LT s68 1) (LT s88 1)) (OR (LT s72...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12235 reset in 6640 ms.
Product exploration explored 100000 steps with 12211 reset in 6159 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1142 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:47:27] [INFO ] Invariant cache hit.
[2023-03-14 17:47:28] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0) p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (NOT (AND (NOT p0) p2))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (F (NOT (AND p1 (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 404 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2721 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:47:32] [INFO ] Invariant cache hit.
[2023-03-14 17:47:36] [INFO ] Dead Transitions using invariants and state equation in 4825 ms found 0 transitions.
[2023-03-14 17:47:36] [INFO ] Invariant cache hit.
[2023-03-14 17:47:37] [INFO ] Implicit Places using invariants in 799 ms returned []
Implicit Place search using SMT only with invariants took 800 ms to find 0 implicit places.
[2023-03-14 17:47:37] [INFO ] Invariant cache hit.
[2023-03-14 17:47:42] [INFO ] Dead Transitions using invariants and state equation in 5220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13571 ms. Remains : 540/540 places, 15470/15470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 65 steps, including 7 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12573 reset in 4619 ms.
Product exploration explored 100000 steps with 12593 reset in 4658 ms.
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2564 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:47:55] [INFO ] Invariant cache hit.
[2023-03-14 17:48:00] [INFO ] Dead Transitions using invariants and state equation in 5247 ms found 0 transitions.
[2023-03-14 17:48:00] [INFO ] Invariant cache hit.
[2023-03-14 17:48:01] [INFO ] Implicit Places using invariants in 801 ms returned []
Implicit Place search using SMT only with invariants took 803 ms to find 0 implicit places.
[2023-03-14 17:48:01] [INFO ] Invariant cache hit.
[2023-03-14 17:48:06] [INFO ] Dead Transitions using invariants and state equation in 4879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13496 ms. Remains : 540/540 places, 15470/15470 transitions.
Treatment of property PhilosophersDyn-COL-20-LTLFireability-00 finished in 71172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 115 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:48:10] [INFO ] Invariant cache hit.
[2023-03-14 17:48:15] [INFO ] Dead Transitions using invariants and state equation in 5256 ms found 0 transitions.
[2023-03-14 17:48:15] [INFO ] Invariant cache hit.
[2023-03-14 17:48:16] [INFO ] Implicit Places using invariants in 1373 ms returned []
Implicit Place search using SMT only with invariants took 1374 ms to find 0 implicit places.
[2023-03-14 17:48:16] [INFO ] Invariant cache hit.
[2023-03-14 17:48:21] [INFO ] Dead Transitions using invariants and state equation in 5067 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11816 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s28 1) (LT s307 1)) (OR (LT s12 1) (LT s32 1) (LT s385 1)) (OR (LT s2 1) (LT s22 1) (LT s198 1)) (OR (LT s4 1) (LT s24 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 8771 ms.
Product exploration explored 100000 steps with 50000 reset in 8535 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-20-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLFireability-03 finished in 29511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2880 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:48:42] [INFO ] Invariant cache hit.
[2023-03-14 17:48:47] [INFO ] Dead Transitions using invariants and state equation in 5044 ms found 0 transitions.
[2023-03-14 17:48:47] [INFO ] Invariant cache hit.
[2023-03-14 17:48:47] [INFO ] Implicit Places using invariants in 180 ms returned []
Implicit Place search using SMT only with invariants took 181 ms to find 0 implicit places.
[2023-03-14 17:48:47] [INFO ] Invariant cache hit.
[2023-03-14 17:48:52] [INFO ] Dead Transitions using invariants and state equation in 5047 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13169 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s87 1) (GEQ s135 1) (GEQ s167 1)) (AND (GEQ s83 1) (GEQ s93 1) (GEQ s121 1) (GEQ s213 1)) (AND (GEQ s92 1) (GEQ s95 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 6 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-04 finished in 13325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(X(X(!p1)) U (X(X(G(!p1)))||(!p2&&X(X(!p1)))))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 45 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:48:53] [INFO ] Invariant cache hit.
[2023-03-14 17:48:58] [INFO ] Dead Transitions using invariants and state equation in 5171 ms found 0 transitions.
[2023-03-14 17:48:58] [INFO ] Invariant cache hit.
[2023-03-14 17:48:58] [INFO ] Implicit Places using invariants in 193 ms returned []
Implicit Place search using SMT only with invariants took 194 ms to find 0 implicit places.
[2023-03-14 17:48:58] [INFO ] Invariant cache hit.
[2023-03-14 17:49:03] [INFO ] Dead Transitions using invariants and state equation in 5123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10538 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, p1, true]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s101 1) (GEQ s100 1) (GEQ s103 1) (GEQ s102 1) (GEQ s106 1) (GEQ s104 1) (GEQ s107 1) (GEQ s105 1) (GEQ s110 1) (GEQ s111 1) (GEQ s108 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 6 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-06 finished in 11032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p1))&&p0))&&(!p2 U (p3||G(!p2)))))'
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 47 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:49:04] [INFO ] Invariant cache hit.
[2023-03-14 17:49:09] [INFO ] Dead Transitions using invariants and state equation in 5679 ms found 0 transitions.
[2023-03-14 17:49:09] [INFO ] Invariant cache hit.
[2023-03-14 17:49:10] [INFO ] Implicit Places using invariants in 771 ms returned []
Implicit Place search using SMT only with invariants took 772 ms to find 0 implicit places.
[2023-03-14 17:49:10] [INFO ] Invariant cache hit.
[2023-03-14 17:49:15] [INFO ] Dead Transitions using invariants and state equation in 5259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11770 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NOT (OR (AND (GEQ s66 1) (GEQ s86 1)) (AND (GEQ s74 1) (GEQ s94 1)) (AND (GEQ s79 1) (GEQ s99 1)) (AND (GEQ s64 1) (GEQ s84 1)) (AND (GEQ s68 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32418 reset in 8987 ms.
Product exploration explored 100000 steps with 32436 reset in 8979 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 342 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1))), (X (X p1)), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 437 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND p3 (NOT p1)), (AND p3 (NOT p1)), (NOT p1)]
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 64 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:49:35] [INFO ] Invariant cache hit.
[2023-03-14 17:49:40] [INFO ] Dead Transitions using invariants and state equation in 5093 ms found 0 transitions.
[2023-03-14 17:49:40] [INFO ] Invariant cache hit.
[2023-03-14 17:49:41] [INFO ] Implicit Places using invariants in 737 ms returned []
Implicit Place search using SMT only with invariants took 738 ms to find 0 implicit places.
[2023-03-14 17:49:41] [INFO ] Invariant cache hit.
[2023-03-14 17:49:46] [INFO ] Dead Transitions using invariants and state equation in 4913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10811 ms. Remains : 540/540 places, 15470/15470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p1), (X p3)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p3 p1), (X p3)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 32410 reset in 6678 ms.
Product exploration explored 100000 steps with 32424 reset in 6581 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2882 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:50:03] [INFO ] Invariant cache hit.
[2023-03-14 17:50:08] [INFO ] Dead Transitions using invariants and state equation in 5017 ms found 0 transitions.
[2023-03-14 17:50:08] [INFO ] Invariant cache hit.
[2023-03-14 17:50:13] [INFO ] Dead Transitions using invariants and state equation in 4997 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12900 ms. Remains : 540/540 places, 15470/15470 transitions.
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 50 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:50:13] [INFO ] Invariant cache hit.
[2023-03-14 17:50:19] [INFO ] Dead Transitions using invariants and state equation in 5533 ms found 0 transitions.
[2023-03-14 17:50:19] [INFO ] Invariant cache hit.
[2023-03-14 17:50:20] [INFO ] Implicit Places using invariants in 817 ms returned []
Implicit Place search using SMT only with invariants took 819 ms to find 0 implicit places.
[2023-03-14 17:50:20] [INFO ] Invariant cache hit.
[2023-03-14 17:50:25] [INFO ] Dead Transitions using invariants and state equation in 4969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11374 ms. Remains : 540/540 places, 15470/15470 transitions.
Treatment of property PhilosophersDyn-COL-20-LTLFireability-08 finished in 84832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 56 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:50:28] [INFO ] Invariant cache hit.
[2023-03-14 17:50:34] [INFO ] Dead Transitions using invariants and state equation in 5288 ms found 0 transitions.
[2023-03-14 17:50:34] [INFO ] Invariant cache hit.
[2023-03-14 17:50:35] [INFO ] Implicit Places using invariants in 1426 ms returned []
Implicit Place search using SMT only with invariants took 1427 ms to find 0 implicit places.
[2023-03-14 17:50:35] [INFO ] Invariant cache hit.
[2023-03-14 17:50:40] [INFO ] Dead Transitions using invariants and state equation in 5076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11854 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s8 1) (LT s28 1) (LT s307 1)) (OR (LT s12 1) (LT s32 1) (LT s385 1)) (OR (LT s2 1) (LT s22 1) (LT s198 1)) (OR (LT s4 1) (LT s24 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-09 finished in 11991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 48 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:50:40] [INFO ] Invariant cache hit.
[2023-03-14 17:50:45] [INFO ] Dead Transitions using invariants and state equation in 4928 ms found 0 transitions.
[2023-03-14 17:50:45] [INFO ] Invariant cache hit.
[2023-03-14 17:50:46] [INFO ] Implicit Places using invariants in 173 ms returned []
Implicit Place search using SMT only with invariants took 174 ms to find 0 implicit places.
[2023-03-14 17:50:46] [INFO ] Invariant cache hit.
[2023-03-14 17:50:50] [INFO ] Dead Transitions using invariants and state equation in 4811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9963 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s120 1) (LT s121 1) (LT s122 1) (LT s123 1) (LT s124 1) (LT s125 1) (LT s126 1) (LT s127 1) (LT s128 1) (LT s129 1) (LT s130 1) (LT s131 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7826 ms.
Product exploration explored 100000 steps with 50000 reset in 7675 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLFireability-10 finished in 25915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2568 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:51:09] [INFO ] Invariant cache hit.
[2023-03-14 17:51:14] [INFO ] Dead Transitions using invariants and state equation in 4860 ms found 0 transitions.
[2023-03-14 17:51:14] [INFO ] Invariant cache hit.
[2023-03-14 17:51:14] [INFO ] Implicit Places using invariants in 170 ms returned []
Implicit Place search using SMT only with invariants took 171 ms to find 0 implicit places.
[2023-03-14 17:51:14] [INFO ] Invariant cache hit.
[2023-03-14 17:51:19] [INFO ] Dead Transitions using invariants and state equation in 4784 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12388 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s87 1) (GEQ s135 1) (GEQ s167 1)) (AND (GEQ s83 1) (GEQ s93 1) (GEQ s121 1) (GEQ s213 1)) (AND (GEQ s92 1) (GEQ s95 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 6 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-11 finished in 12753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))||(p2&&X(!p1))||p0)))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 50 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:51:19] [INFO ] Invariant cache hit.
[2023-03-14 17:51:24] [INFO ] Dead Transitions using invariants and state equation in 4708 ms found 0 transitions.
[2023-03-14 17:51:24] [INFO ] Invariant cache hit.
[2023-03-14 17:51:25] [INFO ] Implicit Places using invariants in 1364 ms returned []
Implicit Place search using SMT only with invariants took 1365 ms to find 0 implicit places.
[2023-03-14 17:51:25] [INFO ] Invariant cache hit.
[2023-03-14 17:51:30] [INFO ] Dead Transitions using invariants and state equation in 4753 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10878 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), false, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(OR (GEQ s101 1) (GEQ s100 1) (GEQ s103 1) (GEQ s102 1) (GEQ s106 1) (GEQ s104 1) (GEQ s107 1) (GEQ s105 1) (GEQ s110 1) (GEQ s111 1) (GEQ s108 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7492 ms.
Product exploration explored 100000 steps with 50000 reset in 7495 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-20-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLFireability-13 finished in 26404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 47 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:51:45] [INFO ] Invariant cache hit.
[2023-03-14 17:51:50] [INFO ] Dead Transitions using invariants and state equation in 4828 ms found 0 transitions.
[2023-03-14 17:51:50] [INFO ] Invariant cache hit.
[2023-03-14 17:51:51] [INFO ] Implicit Places using invariants in 710 ms returned []
Implicit Place search using SMT only with invariants took 712 ms to find 0 implicit places.
[2023-03-14 17:51:51] [INFO ] Invariant cache hit.
[2023-03-14 17:51:56] [INFO ] Dead Transitions using invariants and state equation in 4846 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10436 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s8 1) (LT s28 1) (LT s307 1)) (OR (LT s12 1) (LT s32 1) (LT s385 1)) (OR (LT s2 1) (LT s22 1) (LT s198 1)) (OR (LT s4 1) (LT s24 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-14 finished in 10581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2699 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:51:59] [INFO ] Invariant cache hit.
[2023-03-14 17:52:03] [INFO ] Dead Transitions using invariants and state equation in 4805 ms found 0 transitions.
[2023-03-14 17:52:03] [INFO ] Invariant cache hit.
[2023-03-14 17:52:04] [INFO ] Implicit Places using invariants in 693 ms returned []
Implicit Place search using SMT only with invariants took 693 ms to find 0 implicit places.
[2023-03-14 17:52:04] [INFO ] Invariant cache hit.
[2023-03-14 17:52:09] [INFO ] Dead Transitions using invariants and state equation in 4751 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12949 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s28 1) (GEQ s307 1)) (AND (GEQ s12 1) (GEQ s32 1) (GEQ s385 1)) (AND (GEQ s2 1) (GEQ s22 1) (GEQ s198 1)) (AND (GEQ s4 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11430 reset in 6886 ms.
Product exploration explored 100000 steps with 11456 reset in 6948 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 363 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1159 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:52:25] [INFO ] Invariant cache hit.
[2023-03-14 17:52:26] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-14 17:52:26] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 42 ms returned sat
[2023-03-14 17:52:26] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:52:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-14 17:52:26] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 17:52:32] [INFO ] After 5737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:52:32] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 17:52:43] [INFO ] After 10650ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 17:52:43] [INFO ] After 16875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1991 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:52:45] [INFO ] Invariant cache hit.
[2023-03-14 17:52:50] [INFO ] Dead Transitions using invariants and state equation in 5012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7006 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1150 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33799 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33799 steps, saw 9426 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:52:54] [INFO ] Invariant cache hit.
[2023-03-14 17:52:55] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 17:52:55] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 43 ms returned sat
[2023-03-14 17:52:55] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:52:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-14 17:52:55] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 42 ms returned sat
[2023-03-14 17:53:01] [INFO ] After 5202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:53:01] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 17:53:11] [INFO ] After 10466ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 17:53:11] [INFO ] After 15977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1802 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1802 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1792 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:53:15] [INFO ] Invariant cache hit.
[2023-03-14 17:53:16] [INFO ] Implicit Places using invariants in 777 ms returned []
Implicit Place search using SMT only with invariants took 786 ms to find 0 implicit places.
[2023-03-14 17:53:16] [INFO ] Invariant cache hit.
[2023-03-14 17:53:20] [INFO ] Dead Transitions using invariants and state equation in 4880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7461 ms. Remains : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 630 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:53:21] [INFO ] Invariant cache hit.
[2023-03-14 17:53:22] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 17:53:22] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 17:53:22] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:53:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2023-03-14 17:53:22] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 43 ms returned sat
[2023-03-14 17:53:27] [INFO ] After 5167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:53:28] [INFO ] After 6118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 641 ms.
[2023-03-14 17:53:29] [INFO ] After 6937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 446 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p0 p1)]
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2608 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:53:32] [INFO ] Invariant cache hit.
[2023-03-14 17:53:37] [INFO ] Dead Transitions using invariants and state equation in 5142 ms found 0 transitions.
[2023-03-14 17:53:37] [INFO ] Invariant cache hit.
[2023-03-14 17:53:38] [INFO ] Implicit Places using invariants in 706 ms returned []
Implicit Place search using SMT only with invariants took 707 ms to find 0 implicit places.
[2023-03-14 17:53:38] [INFO ] Invariant cache hit.
[2023-03-14 17:53:43] [INFO ] Dead Transitions using invariants and state equation in 4809 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13272 ms. Remains : 540/540 places, 15470/15470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 363 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1146 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:53:45] [INFO ] Invariant cache hit.
[2023-03-14 17:53:46] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-14 17:53:46] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 45 ms returned sat
[2023-03-14 17:53:46] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:53:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 17:53:46] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 43 ms returned sat
[2023-03-14 17:53:51] [INFO ] After 5394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:53:52] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 17:54:02] [INFO ] After 10562ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 17:54:02] [INFO ] After 16285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1767 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:54:04] [INFO ] Invariant cache hit.
[2023-03-14 17:54:09] [INFO ] Dead Transitions using invariants and state equation in 4836 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6605 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1149 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33532 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33532 steps, saw 9356 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:54:13] [INFO ] Invariant cache hit.
[2023-03-14 17:54:14] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2023-03-14 17:54:14] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 48 ms returned sat
[2023-03-14 17:54:14] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:54:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 17:54:14] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 17:54:19] [INFO ] After 5443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:54:19] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-14 17:54:30] [INFO ] After 10493ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 17:54:30] [INFO ] After 16244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1808 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1808 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1784 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:54:34] [INFO ] Invariant cache hit.
[2023-03-14 17:54:34] [INFO ] Implicit Places using invariants in 709 ms returned []
Implicit Place search using SMT only with invariants took 710 ms to find 0 implicit places.
[2023-03-14 17:54:34] [INFO ] Invariant cache hit.
[2023-03-14 17:54:39] [INFO ] Dead Transitions using invariants and state equation in 4793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7289 ms. Remains : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 606 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:54:40] [INFO ] Invariant cache hit.
[2023-03-14 17:54:40] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 17:54:40] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 45 ms returned sat
[2023-03-14 17:54:40] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:54:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-14 17:54:41] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 44 ms returned sat
[2023-03-14 17:54:46] [INFO ] After 5325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:54:47] [INFO ] After 6229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 633 ms.
[2023-03-14 17:54:48] [INFO ] After 7032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 429 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 107 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 119 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 11460 reset in 6709 ms.
Product exploration explored 100000 steps with 11457 reset in 6818 ms.
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2583 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-14 17:55:04] [INFO ] Invariant cache hit.
[2023-03-14 17:55:09] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
[2023-03-14 17:55:09] [INFO ] Invariant cache hit.
[2023-03-14 17:55:10] [INFO ] Implicit Places using invariants in 711 ms returned []
Implicit Place search using SMT only with invariants took 712 ms to find 0 implicit places.
[2023-03-14 17:55:10] [INFO ] Invariant cache hit.
[2023-03-14 17:55:15] [INFO ] Dead Transitions using invariants and state equation in 4839 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12998 ms. Remains : 540/540 places, 15470/15470 transitions.
Treatment of property PhilosophersDyn-COL-20-LTLFireability-15 finished in 201812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p2)&&p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p1))&&p0))&&(!p2 U (p3||G(!p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
[2023-03-14 17:55:19] [INFO ] Flatten gal took : 705 ms
[2023-03-14 17:55:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 23 ms.
[2023-03-14 17:55:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 540 places, 15470 transitions and 120800 arcs took 71 ms.
Total runtime 537250 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-COL-20
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

BK_STOP 1678816716836

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 1588 Killed lola --conf=$BIN_DIR/configfiles/ltlfireabilityconf --formula=$DIR/LTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PhilosophersDyn-COL-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947700292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-20.tgz
mv PhilosophersDyn-COL-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;