About the Execution of LTSMin+red for Philosophers-COL-002000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2899.628 | 3600000.00 | 12419545.00 | 4558.10 | ??TFFTFFTT??FFFF | normal |
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.r297-tall-167873950000147.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 ltsminxred
Input is Philosophers-COL-002000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950000147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 14:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:21 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 3.9K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 96K 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-COL-002000-LTLCardinality-00
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-01
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-02
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-03
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-04
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-05
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-06
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-07
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-08
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-09
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-10
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-11
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-12
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-13
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-14
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679455238344
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-002000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:20:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 03:20:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 03:20:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 775 ms
[2023-03-22 03:20:41] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 03:20:41] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 03:20:41] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-002000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10009 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 03:20:41] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 03:20:41] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:20:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 03:20:41] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 03:20:41] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 03:20:41] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2001 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=153 )
Parikh walk visited 1 properties in 14 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-COL-002000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 03:20:41] [INFO ] Flatten gal took : 14 ms
[2023-03-22 03:20:41] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 2000) 2000) 2000)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 03:20:42] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions 32000 arcs in 160 ms.
[2023-03-22 03:20:42] [INFO ] Unfolded 12 HLPN properties in 27 ms.
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 104 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 03:20:42] [INFO ] Computed 4000 place invariants in 68 ms
[2023-03-22 03:20:44] [INFO ] Implicit Places using invariants in 1797 ms returned []
Implicit Place search using SMT only with invariants took 1811 ms to find 0 implicit places.
[2023-03-22 03:20:44] [INFO ] Invariant cache hit.
[2023-03-22 03:20:45] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3012 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2023-03-22 03:20:46] [INFO ] Flatten gal took : 723 ms
[2023-03-22 03:20:47] [INFO ] Flatten gal took : 439 ms
[2023-03-22 03:20:48] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7122 ms. (steps per millisecond=1 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1905 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1966 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1878 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1357 ms. (steps per millisecond=7 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 03:21:03] [INFO ] Invariant cache hit.
[2023-03-22 03:21:07] [INFO ] [Real]Absence check using 4000 positive place invariants in 1272 ms returned sat
[2023-03-22 03:21:09] [INFO ] After 4875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 03:21:12] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1484 ms returned sat
[2023-03-22 03:21:34] [INFO ] After 17413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 03:21:34] [INFO ] After 17429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 03:21:34] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 1687 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Free-agglomeration rule (complex) applied 2000 times.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 10000 transition count 8000
Reduce places removed 2000 places and 0 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 2078 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2080 ms. Remains : 8000/10000 places, 8000/10000 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=0 )
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 185 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:21:39] [INFO ] Invariant cache hit.
[2023-03-22 03:21:40] [INFO ] Implicit Places using invariants in 1123 ms returned []
Implicit Place search using SMT only with invariants took 1125 ms to find 0 implicit places.
[2023-03-22 03:21:40] [INFO ] Invariant cache hit.
[2023-03-22 03:21:41] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2495 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-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 10970 steps with 0 reset in 10001 ms.
Product exploration timeout after 10610 steps with 0 reset in 10005 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 (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 406 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 146 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 5043 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 3275 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:22:16] [INFO ] Invariant cache hit.
[2023-03-22 03:22:20] [INFO ] [Real]Absence check using 4000 positive place invariants in 1493 ms returned sat
[2023-03-22 03:22:24] [INFO ] After 6243ms 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 (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT 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 601 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 156 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 158 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 158 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:22:25] [INFO ] Invariant cache hit.
[2023-03-22 03:22:26] [INFO ] Implicit Places using invariants in 1269 ms returned []
Implicit Place search using SMT only with invariants took 1270 ms to find 0 implicit places.
[2023-03-22 03:22:26] [INFO ] Invariant cache hit.
[2023-03-22 03:22:27] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2526 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 (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 354 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 144 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 167 steps, including 0 resets, run visited all 6 properties in 202 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) p2) (AND (NOT p2) p1))), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 556 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 138 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 138 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)))]
Product exploration timeout after 17840 steps with 0 reset in 10003 ms.
Product exploration timeout after 17520 steps with 0 reset in 10004 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 149 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:22:53] [INFO ] Invariant cache hit.
[2023-03-22 03:22:54] [INFO ] Implicit Places using invariants in 1232 ms returned []
Implicit Place search using SMT only with invariants took 1234 ms to find 0 implicit places.
[2023-03-22 03:22:54] [INFO ] Invariant cache hit.
[2023-03-22 03:22:56] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2679 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-00 finished in 78419 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 963 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:22:58] [INFO ] Invariant cache hit.
[2023-03-22 03:22:59] [INFO ] Implicit Places using invariants in 1185 ms returned []
Implicit Place search using SMT only with invariants took 1202 ms to find 0 implicit places.
[2023-03-22 03:22:59] [INFO ] Invariant cache hit.
[2023-03-22 03:23:00] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3066 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-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 s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 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 16290 steps with 113 reset in 10001 ms.
Product exploration timeout after 16070 steps with 105 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 135 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 94 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2023-03-22 03:23:23] [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 720 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:23:39] [INFO ] Invariant cache hit.
[2023-03-22 03:23:40] [INFO ] Implicit Places using invariants in 1121 ms returned []
Implicit Place search using SMT only with invariants took 1123 ms to find 0 implicit places.
[2023-03-22 03:23:40] [INFO ] Invariant cache hit.
[2023-03-22 03:23:41] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2934 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 86 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 55 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 134 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-22 03:23:44] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 16480 steps with 112 reset in 10003 ms.
Product exploration timeout after 16290 steps with 110 reset in 10003 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 709 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:24:19] [INFO ] Invariant cache hit.
[2023-03-22 03:24:21] [INFO ] Implicit Places using invariants in 1210 ms returned []
Implicit Place search using SMT only with invariants took 1212 ms to find 0 implicit places.
[2023-03-22 03:24:21] [INFO ] Invariant cache hit.
[2023-03-22 03:24:22] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3048 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-01 finished in 85572 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 292 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:24:23] [INFO ] Invariant cache hit.
[2023-03-22 03:24:24] [INFO ] Implicit Places using invariants in 1221 ms returned []
Implicit Place search using SMT only with invariants took 1223 ms to find 0 implicit places.
[2023-03-22 03:24:24] [INFO ] Invariant cache hit.
[2023-03-22 03:24:25] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2603 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 2443 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-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 s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s60...], 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 14850 steps with 0 reset in 7853 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-03 finished in 12942 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 629 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:24:36] [INFO ] Invariant cache hit.
[2023-03-22 03:24:37] [INFO ] Implicit Places using invariants in 1083 ms returned []
Implicit Place search using SMT only with invariants took 1085 ms to find 0 implicit places.
[2023-03-22 03:24:37] [INFO ] Invariant cache hit.
[2023-03-22 03:24:38] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2805 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, false, (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Philosophers-COL-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 s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s60...], 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 2738 steps with 0 reset in 2360 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-04 finished in 5387 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 579 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:24:41] [INFO ] Invariant cache hit.
[2023-03-22 03:24:42] [INFO ] Implicit Places using invariants in 1055 ms returned []
Implicit Place search using SMT only with invariants took 1058 ms to find 0 implicit places.
[2023-03-22 03:24:42] [INFO ] Invariant cache hit.
[2023-03-22 03:24:43] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2767 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-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 s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s202...], 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 24080 steps with 0 reset in 10001 ms.
Product exploration timeout after 23390 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 106 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 32 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 88 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 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 517 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:25:05] [INFO ] Invariant cache hit.
[2023-03-22 03:25:06] [INFO ] Implicit Places using invariants in 1107 ms returned []
Implicit Place search using SMT only with invariants took 1122 ms to find 0 implicit places.
[2023-03-22 03:25:06] [INFO ] Invariant cache hit.
[2023-03-22 03:25:07] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2701 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 107 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 29 ms :[(NOT p0)]
Finished random walk after 3 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 93 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration timeout after 24590 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 22588 steps with 0 reset with depth 22589 and stack size 3019 in 9523 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-07 finished in 47395 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((p0||G(p1)||F((G(F(p2))||(!p0&&F(p2)))))))'
Support contains 6000 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 322 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:25:28] [INFO ] Invariant cache hit.
[2023-03-22 03:25:29] [INFO ] Implicit Places using invariants in 1145 ms returned []
Implicit Place search using SMT only with invariants took 1153 ms to find 0 implicit places.
[2023-03-22 03:25:30] [INFO ] Invariant cache hit.
[2023-03-22 03:25:31] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2539 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(GT 2 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 20370 steps with 10185 reset in 10002 ms.
Product exploration timeout after 19930 steps with 9965 reset in 10005 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 p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-002000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-002000-LTLCardinality-08 finished in 24134 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.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 2 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 2131 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
// Phase 1: matrix 8000 rows 8000 cols
[2023-03-22 03:25:54] [INFO ] Computed 4000 place invariants in 42 ms
[2023-03-22 03:26:00] [INFO ] Implicit Places using invariants in 6155 ms returned []
[2023-03-22 03:26:00] [INFO ] Invariant cache hit.
[2023-03-22 03:26:06] [INFO ] Implicit Places using invariants and state equation in 5794 ms returned []
Implicit Place search using SMT with State Equation took 11976 ms to find 0 implicit places.
[2023-03-22 03:26:07] [INFO ] Redundant transitions in 918 ms returned []
[2023-03-22 03:26:07] [INFO ] Invariant cache hit.
[2023-03-22 03:26:14] [INFO ] Dead Transitions using invariants and state equation in 6967 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8000/10000 places, 8000/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22020 ms. Remains : 8000/10000 places, 8000/10000 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-10 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 s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 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 50890 steps with 9 reset in 10001 ms.
Product exploration timeout after 44750 steps with 61 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 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 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 184 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2023-03-22 03:26:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 8000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8000/8000 places, 8000/8000 transitions.
Applied a total of 0 rules in 439 ms. Remains 8000 /8000 variables (removed 0) and now considering 8000/8000 (removed 0) transitions.
[2023-03-22 03:26:52] [INFO ] Invariant cache hit.
[2023-03-22 03:26:58] [INFO ] Implicit Places using invariants in 5973 ms returned []
[2023-03-22 03:26:58] [INFO ] Invariant cache hit.
[2023-03-22 03:27:03] [INFO ] Implicit Places using invariants and state equation in 5672 ms returned []
Implicit Place search using SMT with State Equation took 11669 ms to find 0 implicit places.
[2023-03-22 03:27:04] [INFO ] Redundant transitions in 870 ms returned []
[2023-03-22 03:27:04] [INFO ] Invariant cache hit.
[2023-03-22 03:27:11] [INFO ] Dead Transitions using invariants and state equation in 6739 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19727 ms. Remains : 8000/8000 places, 8000/8000 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 72 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 3 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
[2023-03-22 03:27:13] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 48760 steps with 30 reset in 10002 ms.
Product exploration timeout after 44140 steps with 2 reset in 10001 ms.
Support contains 2000 out of 8000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8000/8000 places, 8000/8000 transitions.
Applied a total of 0 rules in 386 ms. Remains 8000 /8000 variables (removed 0) and now considering 8000/8000 (removed 0) transitions.
[2023-03-22 03:27:49] [INFO ] Invariant cache hit.
[2023-03-22 03:27:54] [INFO ] Implicit Places using invariants in 5907 ms returned []
[2023-03-22 03:27:54] [INFO ] Invariant cache hit.
[2023-03-22 03:28:00] [INFO ] Implicit Places using invariants and state equation in 5756 ms returned []
Implicit Place search using SMT with State Equation took 11698 ms to find 0 implicit places.
[2023-03-22 03:28:01] [INFO ] Redundant transitions in 688 ms returned []
[2023-03-22 03:28:01] [INFO ] Invariant cache hit.
[2023-03-22 03:28:08] [INFO ] Dead Transitions using invariants and state equation in 7099 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19881 ms. Remains : 8000/8000 places, 8000/8000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-10 finished in 136405 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 2000 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 687 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 03:28:09] [INFO ] Computed 4000 place invariants in 45 ms
[2023-03-22 03:28:10] [INFO ] Implicit Places using invariants in 1133 ms returned []
Implicit Place search using SMT only with invariants took 1136 ms to find 0 implicit places.
[2023-03-22 03:28:10] [INFO ] Invariant cache hit.
[2023-03-22 03:28:11] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2937 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-11 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 3 (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 s...], 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 16890 steps with 109 reset in 10005 ms.
Product exploration timeout after 16380 steps with 109 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 96 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 131 steps, including 0 resets, run visited all 1 properties in 89 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 123 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-22 03:28:34] [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 764 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:28:50] [INFO ] Invariant cache hit.
[2023-03-22 03:28:51] [INFO ] Implicit Places using invariants in 1122 ms returned []
Implicit Place search using SMT only with invariants took 1128 ms to find 0 implicit places.
[2023-03-22 03:28:51] [INFO ] Invariant cache hit.
[2023-03-22 03:28:52] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3041 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 87 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 39 ms :[(NOT p0)]
Finished random walk after 218 steps, including 0 resets, run visited all 1 properties in 131 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-22 03:28:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration timeout after 16330 steps with 104 reset in 10006 ms.
Product exploration timeout after 16310 steps with 110 reset in 10002 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 682 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:29:31] [INFO ] Invariant cache hit.
[2023-03-22 03:29:32] [INFO ] Implicit Places using invariants in 1061 ms returned []
Implicit Place search using SMT only with invariants took 1064 ms to find 0 implicit places.
[2023-03-22 03:29:32] [INFO ] Invariant cache hit.
[2023-03-22 03:29:33] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2663 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-11 finished in 84511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||F(p1))))'
Support contains 6000 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 305 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:29:33] [INFO ] Invariant cache hit.
[2023-03-22 03:29:34] [INFO ] Implicit Places using invariants in 1068 ms returned []
Implicit Place search using SMT only with invariants took 1072 ms to find 0 implicit places.
[2023-03-22 03:29:34] [INFO ] Invariant cache hit.
[2023-03-22 03:29:35] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2432 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 72000 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 65928 steps with 0 reset with depth 65929 and stack size 1027 in 9521 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-12 finished in 22094 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))'
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.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 1 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 1594 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
// Phase 1: matrix 8000 rows 8000 cols
[2023-03-22 03:29:57] [INFO ] Computed 4000 place invariants in 27 ms
[2023-03-22 03:29:58] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-22 03:29:58] [INFO ] Invariant cache hit.
[2023-03-22 03:29:59] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2023-03-22 03:30:00] [INFO ] Redundant transitions in 880 ms returned []
[2023-03-22 03:30:00] [INFO ] Invariant cache hit.
[2023-03-22 03:30:01] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8000/10000 places, 8000/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5423 ms. Remains : 8000/10000 places, 8000/10000 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 21570 steps with 7146 reset in 10001 ms.
Stack based approach found an accepted trace after 13529 steps with 4484 reset with depth 2 and stack size 2 in 6529 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-13 finished in 22033 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' '!(((!p0&&(p1||G(p2))) U (F(p3)&&G(p4))))'
Support contains 10000 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 76 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-22 03:30:17] [INFO ] Computed 4000 place invariants in 25 ms
[2023-03-22 03:30:18] [INFO ] Implicit Places using invariants in 1211 ms returned []
Implicit Place search using SMT only with invariants took 1213 ms to find 0 implicit places.
[2023-03-22 03:30:19] [INFO ] Invariant cache hit.
[2023-03-22 03:30:20] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2473 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p4) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p4) (NOT p0) p1) (AND (NOT p4) (NOT p0) p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p4) p0) (AND (NOT p4) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p4), acceptance={} source=0 dest: 3}, { cond=(OR (AND p4 p0) (AND p4 (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(OR (AND p4 (NOT p0) p1) (AND p4 (NOT p0) p2)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 1}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) p2), acceptance={} source=5 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p4 p2), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p4) (NOT p0) p1) (AND (NOT p4) (NOT p0) p2)), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p4) p0) (AND (NOT p4) (NOT p1) (NOT p2))), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 2}, { cond=(OR (AND p4 p0) (AND p4 (NOT p1) (NOT p2))), acceptance={} source=6 dest: 4}, { cond=(AND p4 (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(OR (AND p4 (NOT p0) p1) (AND p4 (NOT p0) p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(GT (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s402...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 269 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-14 finished in 3043 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)&&X((p1&&F(p2)&&X(F(p3))))))'
Support contains 8000 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 205 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:30:20] [INFO ] Invariant cache hit.
[2023-03-22 03:30:22] [INFO ] Implicit Places using invariants in 1089 ms returned []
Implicit Place search using SMT only with invariants took 1100 ms to find 0 implicit places.
[2023-03-22 03:30:22] [INFO ] Invariant cache hit.
[2023-03-22 03:30:23] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2377 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s60...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 41490 steps with 2 reset in 10001 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-15 finished in 12632 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' '!(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' '!(X(F(p0)))'
Found a Shortening insensitive property : Philosophers-COL-002000-LTLCardinality-11
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 709 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:30:34] [INFO ] Invariant cache hit.
[2023-03-22 03:30:35] [INFO ] Implicit Places using invariants in 1066 ms returned []
Implicit Place search using SMT only with invariants took 1068 ms to find 0 implicit places.
[2023-03-22 03:30:35] [INFO ] Invariant cache hit.
[2023-03-22 03:30:36] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2864 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-11 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 3 (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 16990 steps with 112 reset in 10006 ms.
Product exploration timeout after 16320 steps with 106 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 p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 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 40 ms :[(NOT p0)]
Finished random walk after 128 steps, including 0 resets, run visited all 1 properties in 78 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 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 29 ms :[(NOT p0)]
[2023-03-22 03:30:59] [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 800 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:31:15] [INFO ] Invariant cache hit.
[2023-03-22 03:31:16] [INFO ] Implicit Places using invariants in 1055 ms returned []
Implicit Place search using SMT only with invariants took 1068 ms to find 0 implicit places.
[2023-03-22 03:31:16] [INFO ] Invariant cache hit.
[2023-03-22 03:31:17] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2877 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 77 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 p0)]
Finished random walk after 146 steps, including 0 resets, run visited all 1 properties in 92 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-22 03:31:20] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration timeout after 16700 steps with 110 reset in 10006 ms.
Product exploration timeout after 16240 steps with 110 reset in 10004 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 741 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-22 03:31:56] [INFO ] Invariant cache hit.
[2023-03-22 03:31:57] [INFO ] Implicit Places using invariants in 1084 ms returned []
Implicit Place search using SMT only with invariants took 1085 ms to find 0 implicit places.
[2023-03-22 03:31:57] [INFO ] Invariant cache hit.
[2023-03-22 03:31:58] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3025 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-11 finished in 85108 ms.
[2023-03-22 03:31:59] [INFO ] Flatten gal took : 335 ms
[2023-03-22 03:31:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 9 ms.
[2023-03-22 03:31:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 10000 transitions and 32000 arcs took 68 ms.
Total runtime 679199 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1547/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393232 kB
MemFree: 15599616 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16110752 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1547/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393232 kB
MemFree: 15553884 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16065776 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1547/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393232 kB
MemFree: 15543736 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16056132 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1547/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15541244 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16056552 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
mcc2023
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-COL-002000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Philosophers-COL-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 r297-tall-167873950000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-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 '
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 ;