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-167873947600251.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 Philosophers-PT-002000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 77M
-rw-r--r-- 1 mcc users 2.1M Feb 25 16:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Feb 25 16:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.8M Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 702K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.1M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4M Feb 25 20:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17M Feb 25 20:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8M Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 527K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.5M 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 Philosophers-PT-002000-LTLCardinality-00
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-01
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-02
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-03
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-04
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-05
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-06
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-07
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-08
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-09
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-10
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-11
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-12
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-13
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-14
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678807175412

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-002000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 15:19:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 15:19:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:19:37] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2023-03-14 15:19:37] [INFO ] Transformed 10000 places.
[2023-03-14 15:19:37] [INFO ] Transformed 10000 transitions.
[2023-03-14 15:19:37] [INFO ] Parsed PT model containing 10000 places and 10000 transitions and 32000 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 1525 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-002000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 74 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 15:19:39] [INFO ] Computed 4000 place invariants in 65 ms
[2023-03-14 15:19:40] [INFO ] Implicit Places using invariants in 1057 ms returned []
Implicit Place search using SMT only with invariants took 1081 ms to find 0 implicit places.
[2023-03-14 15:19:40] [INFO ] Invariant cache hit.
[2023-03-14 15:19:41] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2189 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2023-03-14 15:19:42] [INFO ] Flatten gal took : 554 ms
[2023-03-14 15:19:43] [INFO ] Flatten gal took : 361 ms
[2023-03-14 15:19:44] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6859 ms. (steps per millisecond=1 ) properties (out of 27) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1799 ms. (steps per millisecond=5 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3023 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 15:19:58] [INFO ] Invariant cache hit.
[2023-03-14 15:20:02] [INFO ] [Real]Absence check using 4000 positive place invariants in 1362 ms returned sat
[2023-03-14 15:20:03] [INFO ] After 3736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 15:20:05] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1254 ms returned sat
[2023-03-14 15:20:25] [INFO ] After 15983ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-14 15:20:28] [INFO ] After 18445ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-14 15:20:28] [INFO ] After 25119ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 3 properties in 757 ms. (steps per millisecond=2 )
Parikh walk visited 3 properties in 766 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-PT-002000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F((p0&&(G((p1 U p2))||G(p0)))))'
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 417 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:20:29] [INFO ] Invariant cache hit.
[2023-03-14 15:20:31] [INFO ] Implicit Places using invariants in 1169 ms returned []
Implicit Place search using SMT only with invariants took 1170 ms to find 0 implicit places.
[2023-03-14 15:20:31] [INFO ] Invariant cache hit.
[2023-03-14 15:20:31] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2460 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 9430 steps with 0 reset in 10008 ms.
Product exploration timeout after 9510 steps with 0 reset in 10002 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 p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 423 ms. Reduced automaton from 3 states, 14 edges and 3 AP (stutter insensitive) to 3 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5692 ms. (steps per millisecond=1 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3770 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:21:09] [INFO ] Invariant cache hit.
[2023-03-14 15:21:15] [INFO ] [Real]Absence check using 4000 positive place invariants in 4081 ms returned sat
[2023-03-14 15:21:18] [INFO ] After 8152ms 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 p0 p2 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 647 ms. Reduced automaton from 3 states, 14 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 389 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:21:20] [INFO ] Invariant cache hit.
[2023-03-14 15:21:21] [INFO ] Implicit Places using invariants in 1055 ms returned []
Implicit Place search using SMT only with invariants took 1067 ms to find 0 implicit places.
[2023-03-14 15:21:21] [INFO ] Invariant cache hit.
[2023-03-14 15:21:22] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2308 ms. Remains : 10000/10000 places, 10000/10000 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 p0 p2 (NOT p1)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2)))]
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Finished random walk after 150 steps, including 0 resets, run visited all 6 properties in 200 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 435 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Product exploration timeout after 16410 steps with 0 reset in 10003 ms.
Product exploration timeout after 15760 steps with 0 reset in 10001 ms.
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 223 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:21:48] [INFO ] Invariant cache hit.
[2023-03-14 15:21:49] [INFO ] Implicit Places using invariants in 963 ms returned []
Implicit Place search using SMT only with invariants took 964 ms to find 0 implicit places.
[2023-03-14 15:21:49] [INFO ] Invariant cache hit.
[2023-03-14 15:21:50] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2161 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-00 finished in 81316 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)))'
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 946 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:21:51] [INFO ] Invariant cache hit.
[2023-03-14 15:21:52] [INFO ] Implicit Places using invariants in 922 ms returned []
Implicit Place search using SMT only with invariants took 924 ms to find 0 implicit places.
[2023-03-14 15:21:52] [INFO ] Invariant cache hit.
[2023-03-14 15:21:53] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2832 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 541 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s7677 s7678 s7679 s7680 s7681 s7682 s7683 s7684 s7685 s7686 s7687 s7688 s7689 s7690 s7691 s7692 s7693 s7694 s7695 s7696 s7697 s7698 s7699 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 14320 steps with 95 reset in 10001 ms.
Product exploration timeout after 13880 steps with 88 reset in 10006 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 88 steps, including 0 resets, run visited all 1 properties in 64 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2023-03-14 15:22:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1002 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:22:32] [INFO ] Invariant cache hit.
[2023-03-14 15:22:33] [INFO ] Implicit Places using invariants in 936 ms returned []
Implicit Place search using SMT only with invariants took 942 ms to find 0 implicit places.
[2023-03-14 15:22:33] [INFO ] Invariant cache hit.
[2023-03-14 15:22:34] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2933 ms. Remains : 10000/10000 places, 10000/10000 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 130 steps, including 0 resets, run visited all 1 properties in 106 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-14 15:22:37] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 14270 steps with 92 reset in 10004 ms.
Product exploration timeout after 14000 steps with 94 reset in 10006 ms.
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 674 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:23:13] [INFO ] Invariant cache hit.
[2023-03-14 15:23:14] [INFO ] Implicit Places using invariants in 962 ms returned []
Implicit Place search using SMT only with invariants took 973 ms to find 0 implicit places.
[2023-03-14 15:23:14] [INFO ] Invariant cache hit.
[2023-03-14 15:23:15] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2626 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-01 finished in 84721 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((p0||G(p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 310 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:23:15] [INFO ] Invariant cache hit.
[2023-03-14 15:23:16] [INFO ] Implicit Places using invariants in 976 ms returned []
Implicit Place search using SMT only with invariants took 983 ms to find 0 implicit places.
[2023-03-14 15:23:16] [INFO ] Invariant cache hit.
[2023-03-14 15:23:17] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2252 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ (ADD s5661 s5662 s5663 s5664 s5665 s5666 s5667 s5668 s5672 s5673 s5674 s5675 s5676 s5757 s5758 s5759 s5760 s5761 s5762 s5763 s5764 s5765 s5766 s57...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2663 steps with 0 reset in 2488 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-03 finished in 4901 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((G(!p0)||(G(p1) U p0))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 576 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:23:20] [INFO ] Invariant cache hit.
[2023-03-14 15:23:21] [INFO ] Implicit Places using invariants in 863 ms returned []
Implicit Place search using SMT only with invariants took 864 ms to find 0 implicit places.
[2023-03-14 15:23:21] [INFO ] Invariant cache hit.
[2023-03-14 15:23:22] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2378 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, false, (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ (ADD s5661 s5662 s5663 s5664 s5665 s5666 s5667 s5668 s5672 s5673 s5674 s5675 s5676 s5757 s5758 s5759 s5760 s5761 s5762 s5763 s5764 s5765 s5766 s57...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2983 steps with 0 reset in 2829 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-04 finished in 5433 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 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 589 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:23:26] [INFO ] Invariant cache hit.
[2023-03-14 15:23:27] [INFO ] Implicit Places using invariants in 843 ms returned []
Implicit Place search using SMT only with invariants took 844 ms to find 0 implicit places.
[2023-03-14 15:23:27] [INFO ] Invariant cache hit.
[2023-03-14 15:23:28] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2383 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-07 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 (GT 2 (ADD s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 s1937 s1938 s193...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 21360 steps with 0 reset in 10002 ms.
Product exploration timeout after 20690 steps with 0 reset in 10003 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)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 550 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:23:50] [INFO ] Invariant cache hit.
[2023-03-14 15:23:51] [INFO ] Implicit Places using invariants in 944 ms returned []
Implicit Place search using SMT only with invariants took 945 ms to find 0 implicit places.
[2023-03-14 15:23:51] [INFO ] Invariant cache hit.
[2023-03-14 15:23:51] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2349 ms. Remains : 10000/10000 places, 10000/10000 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 : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration timeout after 21570 steps with 0 reset in 10002 ms.
Product exploration timeout after 21160 steps with 0 reset in 10001 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 444 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:24:13] [INFO ] Invariant cache hit.
[2023-03-14 15:24:14] [INFO ] Implicit Places using invariants in 882 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
[2023-03-14 15:24:14] [INFO ] Invariant cache hit.
[2023-03-14 15:24:15] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2177 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-07 finished in 50103 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)||X(G(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 944 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:24:16] [INFO ] Invariant cache hit.
[2023-03-14 15:24:17] [INFO ] Implicit Places using invariants in 949 ms returned []
Implicit Place search using SMT only with invariants took 952 ms to find 0 implicit places.
[2023-03-14 15:24:17] [INFO ] Invariant cache hit.
[2023-03-14 15:24:18] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2770 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s9658), p1:(GT s3220 s9665)], 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, null, null][false, false, false, false]]
Product exploration timeout after 47630 steps with 6 reset in 10001 ms.
Product exploration timeout after 32660 steps with 7 reset in 10001 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) p1), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4380 steps, including 1 resets, run visited all 3 properties in 1864 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1086 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:24:42] [INFO ] Invariant cache hit.
[2023-03-14 15:24:43] [INFO ] Implicit Places using invariants in 889 ms returned []
Implicit Place search using SMT only with invariants took 890 ms to find 0 implicit places.
[2023-03-14 15:24:43] [INFO ] Invariant cache hit.
[2023-03-14 15:24:44] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2940 ms. Remains : 10000/10000 places, 10000/10000 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) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9892 steps, including 2 resets, run visited all 3 properties in 3601 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 49910 steps with 5 reset in 10001 ms.
Product exploration timeout after 56570 steps with 3 reset in 10002 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1996 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1996 places in 2 ms
Iterating global reduction 0 with 1996 rules applied. Total rules applied 1996 place count 10000 transition count 10000
Deduced a syphon composed of 1996 places in 4 ms
Applied a total of 1996 rules in 3412 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 15:25:13] [INFO ] Computed 4000 place invariants in 30 ms
[2023-03-14 15:25:14] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10000/10000 places, 10000/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4377 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1309 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 15:25:15] [INFO ] Computed 4000 place invariants in 27 ms
[2023-03-14 15:25:16] [INFO ] Implicit Places using invariants in 885 ms returned []
Implicit Place search using SMT only with invariants took 885 ms to find 0 implicit places.
[2023-03-14 15:25:16] [INFO ] Invariant cache hit.
[2023-03-14 15:25:17] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3132 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-08 finished in 61859 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((p0||(p0 U p1)))&&(p2 U (p3||G(p2)))))'
Support contains 8 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1991 Post agglomeration using F-continuation condition.Transition count delta: 1991
Deduced a syphon composed of 1991 places in 1 ms
Reduce places removed 1991 places and 0 transitions.
Iterating global reduction 0 with 3982 rules applied. Total rules applied 3982 place count 8009 transition count 8009
Applied a total of 3982 rules in 2369 ms. Remains 8009 /10000 variables (removed 1991) and now considering 8009/10000 (removed 1991) transitions.
// Phase 1: matrix 8009 rows 8009 cols
[2023-03-14 15:25:20] [INFO ] Computed 4000 place invariants in 13 ms
[2023-03-14 15:25:26] [INFO ] Implicit Places using invariants in 6378 ms returned []
[2023-03-14 15:25:26] [INFO ] Invariant cache hit.
[2023-03-14 15:25:32] [INFO ] Implicit Places using invariants and state equation in 6432 ms returned []
Implicit Place search using SMT with State Equation took 12812 ms to find 0 implicit places.
[2023-03-14 15:25:33] [INFO ] Redundant transitions in 917 ms returned []
[2023-03-14 15:25:33] [INFO ] Invariant cache hit.
[2023-03-14 15:25:40] [INFO ] Dead Transitions using invariants and state equation in 6301 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8009/10000 places, 8009/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22414 ms. Remains : 8009/10000 places, 8009/10000 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p3) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p3:(LEQ s7532 s3409), p2:(LEQ s1575 s3709), p0:(LEQ s124 s8001), p1:(AND (LEQ s124 s8001) (LEQ s3798 s5471))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 19860 steps with 12 reset in 10005 ms.
Stack based approach found an accepted trace after 4068 steps with 2 reset with depth 644 and stack size 644 in 2123 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-09 finished in 34718 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&&X(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1098 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 15:25:53] [INFO ] Computed 4000 place invariants in 29 ms
[2023-03-14 15:25:54] [INFO ] Implicit Places using invariants in 986 ms returned []
Implicit Place search using SMT only with invariants took 989 ms to find 0 implicit places.
[2023-03-14 15:25:54] [INFO ] Invariant cache hit.
[2023-03-14 15:25:55] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3057 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s7263 s3140) (LEQ 3 s5429)), p1:(LEQ s7263 s3140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 19570 steps with 6539 reset in 10005 ms.
Product exploration timeout after 18880 steps with 6273 reset in 10009 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1273 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3539 ms. (steps per millisecond=2 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:26:21] [INFO ] Invariant cache hit.
[2023-03-14 15:26:22] [INFO ] After 1061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:26:25] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1376 ms returned sat
[2023-03-14 15:26:25] [INFO ] After 2421ms SMT Verify possible using all constraints in natural 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 429 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1097 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:26:26] [INFO ] Invariant cache hit.
[2023-03-14 15:26:27] [INFO ] Implicit Places using invariants in 853 ms returned []
Implicit Place search using SMT only with invariants took 854 ms to find 0 implicit places.
[2023-03-14 15:26:27] [INFO ] Invariant cache hit.
[2023-03-14 15:26:28] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2949 ms. Remains : 10000/10000 places, 10000/10000 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 p0 p1), (X p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 5837 steps, including 1 resets, run visited all 2 properties in 2235 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 19730 steps with 6568 reset in 10017 ms.
Product exploration timeout after 18910 steps with 6297 reset in 10001 ms.
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1048 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 15:26:53] [INFO ] Invariant cache hit.
[2023-03-14 15:26:53] [INFO ] Implicit Places using invariants in 839 ms returned []
Implicit Place search using SMT only with invariants took 844 ms to find 0 implicit places.
[2023-03-14 15:26:53] [INFO ] Invariant cache hit.
[2023-03-14 15:26:54] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2763 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-10 finished in 62657 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(!p0)&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1995 Post agglomeration using F-continuation condition.Transition count delta: 1995
Deduced a syphon composed of 1995 places in 2 ms
Reduce places removed 1995 places and 0 transitions.
Iterating global reduction 0 with 3990 rules applied. Total rules applied 3990 place count 8005 transition count 8005
Applied a total of 3990 rules in 2262 ms. Remains 8005 /10000 variables (removed 1995) and now considering 8005/10000 (removed 1995) transitions.
// Phase 1: matrix 8005 rows 8005 cols
[2023-03-14 15:26:57] [INFO ] Computed 4000 place invariants in 21 ms
[2023-03-14 15:26:58] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-14 15:26:58] [INFO ] Invariant cache hit.
[2023-03-14 15:27:04] [INFO ] Implicit Places using invariants and state equation in 6606 ms returned []
Implicit Place search using SMT with State Equation took 7422 ms to find 0 implicit places.
[2023-03-14 15:27:05] [INFO ] Redundant transitions in 847 ms returned []
[2023-03-14 15:27:05] [INFO ] Invariant cache hit.
[2023-03-14 15:27:12] [INFO ] Dead Transitions using invariants and state equation in 6789 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8005/10000 places, 8005/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17349 ms. Remains : 8005/10000 places, 8005/10000 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) p0), true, p0, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT s2267 s5626), p0:(OR (LEQ 2 s8002) (LEQ s2921 s5464)), p2:(LEQ 1 s6767)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 507 steps with 0 reset in 323 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-12 finished in 17889 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(X((F(X(p0)) U p1))))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1119 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 15:27:14] [INFO ] Computed 4000 place invariants in 20 ms
[2023-03-14 15:27:15] [INFO ] Implicit Places using invariants in 949 ms returned []
Implicit Place search using SMT only with invariants took 962 ms to find 0 implicit places.
[2023-03-14 15:27:15] [INFO ] Invariant cache hit.
[2023-03-14 15:27:15] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2961 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s704 s8873) (LEQ s9956 s5412))], 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 timeout after 27540 steps with 17 reset in 10002 ms.
Product exploration timeout after 27730 steps with 11 reset in 10003 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 : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 458 steps, including 0 resets, run visited all 1 properties in 293 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F p1)]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2023-03-14 15:27:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1997 Post agglomeration using F-continuation condition.Transition count delta: 1997
Deduced a syphon composed of 1997 places in 2 ms
Reduce places removed 1997 places and 0 transitions.
Iterating global reduction 0 with 3994 rules applied. Total rules applied 3994 place count 8003 transition count 8003
Applied a total of 3994 rules in 2306 ms. Remains 8003 /10000 variables (removed 1997) and now considering 8003/10000 (removed 1997) transitions.
// Phase 1: matrix 8003 rows 8003 cols
[2023-03-14 15:27:54] [INFO ] Computed 4000 place invariants in 34 ms
[2023-03-14 15:28:00] [INFO ] Implicit Places using invariants in 6232 ms returned []
[2023-03-14 15:28:00] [INFO ] Invariant cache hit.
[2023-03-14 15:28:06] [INFO ] Implicit Places using invariants and state equation in 6444 ms returned []
Implicit Place search using SMT with State Equation took 12688 ms to find 0 implicit places.
[2023-03-14 15:28:07] [INFO ] Redundant transitions in 580 ms returned []
[2023-03-14 15:28:07] [INFO ] Invariant cache hit.
[2023-03-14 15:28:13] [INFO ] Dead Transitions using invariants and state equation in 5993 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8003/10000 places, 8003/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21593 ms. Remains : 8003/10000 places, 8003/10000 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 : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1)]
Finished random walk after 1430 steps, including 0 resets, run visited all 1 properties in 794 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F p1)]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2023-03-14 15:28:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration timeout after 18430 steps with 13 reset in 10001 ms.
Stack based approach found an accepted trace after 5508 steps with 5 reset with depth 186 and stack size 186 in 3137 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-13 finished in 90163 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 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1011 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 15:28:44] [INFO ] Computed 4000 place invariants in 21 ms
[2023-03-14 15:28:45] [INFO ] Implicit Places using invariants in 856 ms returned []
Implicit Place search using SMT only with invariants took 859 ms to find 0 implicit places.
[2023-03-14 15:28:45] [INFO ] Invariant cache hit.
[2023-03-14 15:28:45] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2717 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1506 s8453)], 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 timeout after 22330 steps with 15 reset in 10003 ms.
Product exploration timeout after 28020 steps with 13 reset in 10001 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 316 steps, including 0 resets, run visited all 1 properties in 203 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-14 15:29:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 1998
Deduced a syphon composed of 1998 places in 1 ms
Reduce places removed 1998 places and 0 transitions.
Iterating global reduction 0 with 3996 rules applied. Total rules applied 3996 place count 8002 transition count 8002
Applied a total of 3996 rules in 2291 ms. Remains 8002 /10000 variables (removed 1998) and now considering 8002/10000 (removed 1998) transitions.
// Phase 1: matrix 8002 rows 8002 cols
[2023-03-14 15:29:24] [INFO ] Computed 4000 place invariants in 11 ms
[2023-03-14 15:29:30] [INFO ] Implicit Places using invariants in 6308 ms returned []
[2023-03-14 15:29:30] [INFO ] Invariant cache hit.
[2023-03-14 15:29:36] [INFO ] Implicit Places using invariants and state equation in 6345 ms returned []
Implicit Place search using SMT with State Equation took 12685 ms to find 0 implicit places.
[2023-03-14 15:29:37] [INFO ] Redundant transitions in 607 ms returned []
[2023-03-14 15:29:37] [INFO ] Invariant cache hit.
[2023-03-14 15:29:43] [INFO ] Dead Transitions using invariants and state equation in 5911 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8002/10000 places, 8002/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21500 ms. Remains : 8002/10000 places, 8002/10000 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 437 steps, including 0 resets, run visited all 1 properties in 279 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-14 15:29:44] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration timeout after 21570 steps with 12 reset in 10002 ms.
Stack based approach found an accepted trace after 1124 steps with 1 reset with depth 507 and stack size 507 in 718 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-15 finished in 86722 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((p0&&(G((p1 U p2))||G(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' '!(G(F(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' '!(F(G(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((F(p0)||X(G(p1)))))'
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&&X(p1)))))'
Found a Shortening insensitive property : Philosophers-PT-002000-LTLCardinality-10
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 1998
Deduced a syphon composed of 1998 places in 1 ms
Reduce places removed 1998 places and 0 transitions.
Iterating global reduction 0 with 3996 rules applied. Total rules applied 3996 place count 8002 transition count 8002
Applied a total of 3996 rules in 2320 ms. Remains 8002 /10000 variables (removed 1998) and now considering 8002/10000 (removed 1998) transitions.
// Phase 1: matrix 8002 rows 8002 cols
[2023-03-14 15:30:12] [INFO ] Computed 4000 place invariants in 11 ms
[2023-03-14 15:30:19] [INFO ] Implicit Places using invariants in 6359 ms returned []
[2023-03-14 15:30:19] [INFO ] Invariant cache hit.
[2023-03-14 15:30:25] [INFO ] Implicit Places using invariants and state equation in 6212 ms returned []
Implicit Place search using SMT with State Equation took 12602 ms to find 0 implicit places.
[2023-03-14 15:30:25] [INFO ] Invariant cache hit.
[2023-03-14 15:30:31] [INFO ] Dead Transitions using invariants and state equation in 5939 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8002/10000 places, 8002/10000 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 20871 ms. Remains : 8002/10000 places, 8002/10000 transitions.
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s7263 s3140) (LEQ 3 s5429)), p1:(LEQ s7263 s3140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 20350 steps with 6795 reset in 10003 ms.
Product exploration timeout after 19600 steps with 6441 reset in 10001 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 838 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4473 ms. (steps per millisecond=2 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:30:57] [INFO ] Invariant cache hit.
[2023-03-14 15:30:58] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:31:00] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1145 ms returned sat
[2023-03-14 15:31:00] [INFO ] After 1890ms SMT Verify possible using all constraints in natural 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 8002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8002/8002 places, 8002/8002 transitions.
Applied a total of 0 rules in 574 ms. Remains 8002 /8002 variables (removed 0) and now considering 8002/8002 (removed 0) transitions.
[2023-03-14 15:31:01] [INFO ] Invariant cache hit.
[2023-03-14 15:31:07] [INFO ] Implicit Places using invariants in 6425 ms returned []
[2023-03-14 15:31:07] [INFO ] Invariant cache hit.
[2023-03-14 15:31:13] [INFO ] Implicit Places using invariants and state equation in 6380 ms returned []
Implicit Place search using SMT with State Equation took 12807 ms to find 0 implicit places.
[2023-03-14 15:31:13] [INFO ] Invariant cache hit.
[2023-03-14 15:31:19] [INFO ] Dead Transitions using invariants and state equation in 6009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19392 ms. Remains : 8002/8002 places, 8002/8002 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 p0 p1), (X p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 9503 steps, including 2 resets, run visited all 2 properties in 4389 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 20390 steps with 6808 reset in 10008 ms.
Product exploration timeout after 19620 steps with 6577 reset in 10002 ms.
Support contains 3 out of 8002 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8002/8002 places, 8002/8002 transitions.
Applied a total of 0 rules in 586 ms. Remains 8002 /8002 variables (removed 0) and now considering 8002/8002 (removed 0) transitions.
[2023-03-14 15:31:46] [INFO ] Invariant cache hit.
[2023-03-14 15:31:52] [INFO ] Implicit Places using invariants in 6134 ms returned []
[2023-03-14 15:31:52] [INFO ] Invariant cache hit.
[2023-03-14 15:31:58] [INFO ] Implicit Places using invariants and state equation in 6374 ms returned []
Implicit Place search using SMT with State Equation took 12510 ms to find 0 implicit places.
[2023-03-14 15:31:58] [INFO ] Invariant cache hit.
[2023-03-14 15:32:04] [INFO ] Dead Transitions using invariants and state equation in 6359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19464 ms. Remains : 8002/8002 places, 8002/8002 transitions.
Treatment of property Philosophers-PT-002000-LTLCardinality-10 finished in 115011 ms.
[2023-03-14 15:32:05] [INFO ] Flatten gal took : 301 ms
[2023-03-14 15:32:05] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-14 15:32:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 10000 transitions and 32000 arcs took 39 ms.
Total runtime 748590 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-002000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA Philosophers-PT-002000-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-002000-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678808153590

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 1.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 19 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 24 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 29 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 34 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-PT-002000-LTLCardinality-00
lola: time limit : 712 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-PT-002000-LTLCardinality-00
lola: result : false
lola: markings : 635
lola: fired transitions : 635
lola: time used : 0.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 0 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 39 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-PT-002000-LTLCardinality-01
lola: time limit : 890 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/890 1/32 Philosophers-PT-002000-LTLCardinality-01 74 m, 14 m/sec, 73 t fired, .

Time elapsed: 44 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/890 1/32 Philosophers-PT-002000-LTLCardinality-01 224 m, 30 m/sec, 223 t fired, .

Time elapsed: 49 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/890 1/32 Philosophers-PT-002000-LTLCardinality-01 1300 m, 215 m/sec, 1299 t fired, .

Time elapsed: 54 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/890 1/32 Philosophers-PT-002000-LTLCardinality-01 2888 m, 317 m/sec, 2887 t fired, .

Time elapsed: 59 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/890 1/32 Philosophers-PT-002000-LTLCardinality-01 4651 m, 352 m/sec, 4650 t fired, .

Time elapsed: 64 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/890 1/32 Philosophers-PT-002000-LTLCardinality-01 6878 m, 445 m/sec, 6877 t fired, .

Time elapsed: 69 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/890 1/32 Philosophers-PT-002000-LTLCardinality-01 9711 m, 566 m/sec, 9710 t fired, .

Time elapsed: 74 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
lola: FINISHED task # 4 (type EXCL) for Philosophers-PT-002000-LTLCardinality-01
lola: result : false
lola: markings : 16327
lola: fired transitions : 16328
lola: time used : 38.000000
lola: memory pages used : 2
lola: LAUNCH task # 13 (type EXCL) for 12 Philosophers-PT-002000-LTLCardinality-10
lola: time limit : 1174 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 1/1174 1/32 Philosophers-PT-002000-LTLCardinality-10 10857 m, 2171 m/sec, 27459 t fired, .

Time elapsed: 79 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 6/1174 2/32 Philosophers-PT-002000-LTLCardinality-10 52445 m, 8317 m/sec, 161281 t fired, .

Time elapsed: 84 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 11/1174 3/32 Philosophers-PT-002000-LTLCardinality-10 90577 m, 7626 m/sec, 295532 t fired, .

Time elapsed: 89 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 16/1174 4/32 Philosophers-PT-002000-LTLCardinality-10 125516 m, 6987 m/sec, 431761 t fired, .

Time elapsed: 94 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 21/1174 4/32 Philosophers-PT-002000-LTLCardinality-10 159935 m, 6883 m/sec, 568101 t fired, .

Time elapsed: 99 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 26/1174 5/32 Philosophers-PT-002000-LTLCardinality-10 193066 m, 6626 m/sec, 704942 t fired, .

Time elapsed: 104 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 31/1174 6/32 Philosophers-PT-002000-LTLCardinality-10 225820 m, 6550 m/sec, 842286 t fired, .

Time elapsed: 109 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 36/1174 7/32 Philosophers-PT-002000-LTLCardinality-10 258207 m, 6477 m/sec, 979720 t fired, .

Time elapsed: 114 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 41/1174 8/32 Philosophers-PT-002000-LTLCardinality-10 290287 m, 6416 m/sec, 1117557 t fired, .

Time elapsed: 119 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 46/1174 8/32 Philosophers-PT-002000-LTLCardinality-10 321293 m, 6201 m/sec, 1256287 t fired, .

Time elapsed: 124 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 51/1174 9/32 Philosophers-PT-002000-LTLCardinality-10 353731 m, 6487 m/sec, 1394001 t fired, .

Time elapsed: 129 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 56/1174 10/32 Philosophers-PT-002000-LTLCardinality-10 384067 m, 6067 m/sec, 1532817 t fired, .

Time elapsed: 134 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 61/1174 11/32 Philosophers-PT-002000-LTLCardinality-10 416359 m, 6458 m/sec, 1670039 t fired, .

Time elapsed: 139 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 66/1174 11/32 Philosophers-PT-002000-LTLCardinality-10 446631 m, 6054 m/sec, 1808723 t fired, .

Time elapsed: 144 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 71/1174 12/32 Philosophers-PT-002000-LTLCardinality-10 483621 m, 7398 m/sec, 1942076 t fired, .

Time elapsed: 149 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 76/1174 13/32 Philosophers-PT-002000-LTLCardinality-10 512243 m, 5724 m/sec, 2056214 t fired, .

Time elapsed: 154 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 81/1174 13/32 Philosophers-PT-002000-LTLCardinality-10 544647 m, 6480 m/sec, 2182418 t fired, .

Time elapsed: 159 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 87/1174 14/32 Philosophers-PT-002000-LTLCardinality-10 567580 m, 4586 m/sec, 2272245 t fired, .

Time elapsed: 165 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 94/1174 15/32 Philosophers-PT-002000-LTLCardinality-10 597669 m, 6017 m/sec, 2397657 t fired, .

Time elapsed: 172 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 99/1174 15/32 Philosophers-PT-002000-LTLCardinality-10 623077 m, 5081 m/sec, 2502316 t fired, .

Time elapsed: 177 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 104/1174 16/32 Philosophers-PT-002000-LTLCardinality-10 653561 m, 6096 m/sec, 2628551 t fired, .

Time elapsed: 182 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 109/1174 17/32 Philosophers-PT-002000-LTLCardinality-10 683643 m, 6016 m/sec, 2755900 t fired, .

Time elapsed: 187 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 114/1174 17/32 Philosophers-PT-002000-LTLCardinality-10 704747 m, 4220 m/sec, 2847355 t fired, .

Time elapsed: 192 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 119/1174 18/32 Philosophers-PT-002000-LTLCardinality-10 728949 m, 4840 m/sec, 2954863 t fired, .

Time elapsed: 197 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 124/1174 18/32 Philosophers-PT-002000-LTLCardinality-10 753980 m, 5006 m/sec, 3066471 t fired, .

Time elapsed: 202 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 129/1174 19/32 Philosophers-PT-002000-LTLCardinality-10 775941 m, 4392 m/sec, 3164413 t fired, .

Time elapsed: 207 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 134/1174 19/32 Philosophers-PT-002000-LTLCardinality-10 795858 m, 3983 m/sec, 3250625 t fired, .

Time elapsed: 212 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 139/1174 20/32 Philosophers-PT-002000-LTLCardinality-10 824285 m, 5685 m/sec, 3380851 t fired, .

Time elapsed: 217 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-PT-002000-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 144/1174 20/32 Philosophers-PT-002000-LTLCardinality-10 844471 m, 4037 m/sec, 3469848 t fired, .

Time elapsed: 222 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 5
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 1995 Killed lola --conf=$BIN_DIR/configfiles/ltlcardinalityconf --formula=$DIR/LTLCardinality.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="Philosophers-PT-002000"
export BK_EXAMINATION="LTLCardinality"
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 Philosophers-PT-002000, examination is LTLCardinality"
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-167873947600251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-002000.tgz
mv Philosophers-PT-002000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;