About the Execution of LTSMin+red for PhilosophersDyn-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 576.703 | 567002.00 | 472021.00 | 108300.00 | F??TFFTTTFFFFFTF | 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-167873950300323.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 PhilosophersDyn-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950300323
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679493474940
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=PhilosophersDyn-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 13:57:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:57:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:57:56] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-22 13:57:56] [INFO ] Transformed 170 places.
[2023-03-22 13:57:56] [INFO ] Transformed 2310 transitions.
[2023-03-22 13:57:56] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 42 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-22 13:57:57] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-22 13:57:57] [INFO ] Computed 39 place invariants in 90 ms
[2023-03-22 13:57:58] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 13:57:58] [INFO ] Computed 39 place invariants in 55 ms
[2023-03-22 13:57:58] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-22 13:57:58] [INFO ] Invariant cache hit.
[2023-03-22 13:57:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:58:09] [INFO ] Implicit Places using invariants and state equation in 10752 ms returned []
Implicit Place search using SMT with State Equation took 10871 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12107 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2023-03-22 13:58:09] [INFO ] Flatten gal took : 208 ms
[2023-03-22 13:58:09] [INFO ] Flatten gal took : 141 ms
[2023-03-22 13:58:09] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1185 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-22 13:58:10] [INFO ] Invariant cache hit.
[2023-03-22 13:58:10] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:10] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-22 13:58:11] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 13:58:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 13:58:11] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-22 13:58:15] [INFO ] After 4692ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2023-03-22 13:58:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:58:36] [INFO ] After 20151ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2023-03-22 13:58:36] [INFO ] After 20152ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 13:58:36] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 63 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 201 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 13:58:36] [INFO ] Invariant cache hit.
[2023-03-22 13:58:37] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 929 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1196 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 145780 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145780 steps, saw 37892 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-22 13:58:40] [INFO ] Invariant cache hit.
[2023-03-22 13:58:40] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 13:58:40] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 13:58:40] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 13:58:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 13:58:40] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-22 13:58:41] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 13:58:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:59:05] [INFO ] After 24017ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 13:59:05] [INFO ] After 24021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 13:59:05] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 63 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 116 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 146 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 13:59:06] [INFO ] Invariant cache hit.
[2023-03-22 13:59:06] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-22 13:59:06] [INFO ] Invariant cache hit.
[2023-03-22 13:59:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:59:11] [INFO ] Implicit Places using invariants and state equation in 5123 ms returned []
Implicit Place search using SMT with State Equation took 5435 ms to find 0 implicit places.
[2023-03-22 13:59:11] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-22 13:59:11] [INFO ] Invariant cache hit.
[2023-03-22 13:59:12] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6435 ms. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 46 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 10 properties.
[2023-03-22 13:59:12] [INFO ] Invariant cache hit.
[2023-03-22 13:59:12] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 13:59:12] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-22 13:59:12] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 13:59:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 13:59:12] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-22 13:59:13] [INFO ] After 953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 13:59:14] [INFO ] After 1755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 507 ms.
[2023-03-22 13:59:15] [INFO ] After 2362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 200 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 13:59:15] [INFO ] Invariant cache hit.
[2023-03-22 13:59:16] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
[2023-03-22 13:59:16] [INFO ] Invariant cache hit.
[2023-03-22 13:59:16] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-22 13:59:16] [INFO ] Invariant cache hit.
[2023-03-22 13:59:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:59:22] [INFO ] Implicit Places using invariants and state equation in 6365 ms returned []
Implicit Place search using SMT with State Equation took 6694 ms to find 0 implicit places.
[2023-03-22 13:59:23] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-22 13:59:23] [INFO ] Invariant cache hit.
[2023-03-22 13:59:23] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8435 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 3143 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s26 s39 s42 s68 s75 s96 s98 s120 s157 s165) (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 3 reset in 4 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-00 finished in 11636 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 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 143 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 13:59:27] [INFO ] Invariant cache hit.
[2023-03-22 13:59:27] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
[2023-03-22 13:59:27] [INFO ] Invariant cache hit.
[2023-03-22 13:59:28] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-22 13:59:28] [INFO ] Invariant cache hit.
[2023-03-22 13:59:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:59:34] [INFO ] Implicit Places using invariants and state equation in 6467 ms returned []
Implicit Place search using SMT with State Equation took 6775 ms to find 0 implicit places.
[2023-03-22 13:59:34] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-22 13:59:34] [INFO ] Invariant cache hit.
[2023-03-22 13:59:35] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8436 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 13965 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s26 s39 s42 s68 s75 s96 s98 s120 s157 s165) (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11956 reset in 1316 ms.
Product exploration explored 100000 steps with 11928 reset in 1265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 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 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1186 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150434 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150434 steps, saw 39121 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 13:59:55] [INFO ] Invariant cache hit.
[2023-03-22 13:59:55] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:59:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 13:59:55] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-22 13:59:55] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:59:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 13:59:58] [INFO ] After 2746ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:59:58] [INFO ] After 2823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 13:59:58] [INFO ] After 3379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 13:59:58] [INFO ] Invariant cache hit.
[2023-03-22 13:59:59] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154466 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154466 steps, saw 40168 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:00:02] [INFO ] Invariant cache hit.
[2023-03-22 14:00:02] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:00:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:00:02] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-22 14:00:03] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:00:06] [INFO ] After 2749ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:06] [INFO ] After 2820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 14:00:06] [INFO ] After 3373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 105 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:00:06] [INFO ] Invariant cache hit.
[2023-03-22 14:00:06] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-22 14:00:06] [INFO ] Invariant cache hit.
[2023-03-22 14:00:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:00:13] [INFO ] Implicit Places using invariants and state equation in 6492 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
[2023-03-22 14:00:13] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 14:00:13] [INFO ] Invariant cache hit.
[2023-03-22 14:00:13] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7666 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 145 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-22 14:00:14] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-22 14:00:14] [INFO ] Computed 39 place invariants in 59 ms
[2023-03-22 14:00:14] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:00:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:00:14] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-22 14:00:14] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 14:00:23] [INFO ] After 8978ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:23] [INFO ] After 9064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-22 14:00:23] [INFO ] After 9723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 129 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:00:24] [INFO ] Computed 39 place invariants in 40 ms
[2023-03-22 14:00:25] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
[2023-03-22 14:00:25] [INFO ] Invariant cache hit.
[2023-03-22 14:00:25] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-22 14:00:25] [INFO ] Invariant cache hit.
[2023-03-22 14:00:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:00:31] [INFO ] Implicit Places using invariants and state equation in 6476 ms returned []
Implicit Place search using SMT with State Equation took 6795 ms to find 0 implicit places.
[2023-03-22 14:00:31] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-22 14:00:31] [INFO ] Invariant cache hit.
[2023-03-22 14:00:32] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8422 ms. Remains : 170/170 places, 1885/1885 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 13020 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1181 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152439 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152439 steps, saw 39633 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:00:48] [INFO ] Invariant cache hit.
[2023-03-22 14:00:48] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:00:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:00:48] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-22 14:00:49] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:00:52] [INFO ] After 2763ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:52] [INFO ] After 2831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-22 14:00:52] [INFO ] After 3385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 105 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:00:52] [INFO ] Invariant cache hit.
[2023-03-22 14:00:53] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 796 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1202 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153204 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153204 steps, saw 39828 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:00:56] [INFO ] Invariant cache hit.
[2023-03-22 14:00:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:00:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:00:56] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:00:56] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:00:59] [INFO ] After 2743ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:00:59] [INFO ] After 2834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 14:00:59] [INFO ] After 3398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:00:59] [INFO ] Invariant cache hit.
[2023-03-22 14:01:00] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-22 14:01:00] [INFO ] Invariant cache hit.
[2023-03-22 14:01:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:01:06] [INFO ] Implicit Places using invariants and state equation in 6462 ms returned []
Implicit Place search using SMT with State Equation took 6785 ms to find 0 implicit places.
[2023-03-22 14:01:06] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 14:01:06] [INFO ] Invariant cache hit.
[2023-03-22 14:01:07] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7667 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 133 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-22 14:01:07] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-22 14:01:07] [INFO ] Computed 39 place invariants in 47 ms
[2023-03-22 14:01:07] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:01:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:01:07] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-22 14:01:08] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:01:08] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 14:01:17] [INFO ] After 9018ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:01:17] [INFO ] After 9097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 14:01:17] [INFO ] After 9732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 3798 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11888 reset in 1246 ms.
Product exploration explored 100000 steps with 11938 reset in 1263 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 123 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:01:24] [INFO ] Computed 39 place invariants in 39 ms
[2023-03-22 14:01:24] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
[2023-03-22 14:01:24] [INFO ] Invariant cache hit.
[2023-03-22 14:01:25] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-22 14:01:25] [INFO ] Invariant cache hit.
[2023-03-22 14:01:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:01:31] [INFO ] Implicit Places using invariants and state equation in 6514 ms returned []
Implicit Place search using SMT with State Equation took 6844 ms to find 0 implicit places.
[2023-03-22 14:01:31] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 14:01:31] [INFO ] Invariant cache hit.
[2023-03-22 14:01:32] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8479 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-01 finished in 125653 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)&&G(p1))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:01:32] [INFO ] Invariant cache hit.
[2023-03-22 14:01:33] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
[2023-03-22 14:01:33] [INFO ] Invariant cache hit.
[2023-03-22 14:01:33] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-22 14:01:33] [INFO ] Invariant cache hit.
[2023-03-22 14:01:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:01:40] [INFO ] Implicit Places using invariants and state equation in 6494 ms returned []
Implicit Place search using SMT with State Equation took 6808 ms to find 0 implicit places.
[2023-03-22 14:01:40] [INFO ] Invariant cache hit.
[2023-03-22 14:01:40] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8250 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155) (ADD s2 s38 s59 s77 s94 s102 s112 s116 s145 s166)), p0:(AND (GT 1 (ADD s2 s38 s59 s77 s94 s102 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 explored 100000 steps with 11935 reset in 1224 ms.
Product exploration explored 100000 steps with 11953 reset in 1245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 9158 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150919 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150919 steps, saw 39228 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:01:55] [INFO ] Invariant cache hit.
[2023-03-22 14:01:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:01:55] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:01:56] [INFO ] After 444ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 14:01:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:01:59] [INFO ] After 3068ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:01:59] [INFO ] After 3586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:01:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:01:59] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:01:59] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:03] [INFO ] After 3238ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:03] [INFO ] After 3310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 14:02:03] [INFO ] After 3842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:02:03] [INFO ] Invariant cache hit.
[2023-03-22 14:02:04] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 786 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153427 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153427 steps, saw 39874 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:02:07] [INFO ] Invariant cache hit.
[2023-03-22 14:02:07] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:02:07] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:02:07] [INFO ] After 425ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 14:02:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:10] [INFO ] After 3101ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:10] [INFO ] After 3603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:02:10] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:02:11] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:14] [INFO ] After 3206ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:14] [INFO ] After 3281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-22 14:02:14] [INFO ] After 3748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:02:14] [INFO ] Invariant cache hit.
[2023-03-22 14:02:15] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-22 14:02:15] [INFO ] Invariant cache hit.
[2023-03-22 14:02:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:21] [INFO ] Implicit Places using invariants and state equation in 6488 ms returned []
Implicit Place search using SMT with State Equation took 6810 ms to find 0 implicit places.
[2023-03-22 14:02:21] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 14:02:21] [INFO ] Invariant cache hit.
[2023-03-22 14:02:22] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7650 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 138 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-22 14:02:22] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-22 14:02:22] [INFO ] Computed 39 place invariants in 35 ms
[2023-03-22 14:02:22] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:02:22] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-22 14:02:23] [INFO ] After 515ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 14:02:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 14:02:23] [INFO ] After 596ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:23] [INFO ] After 1168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:02:23] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-22 14:02:24] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:24] [INFO ] After 389ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:02:24] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-22 14:02:24] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 2999 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (NOT p1)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:02:28] [INFO ] Computed 39 place invariants in 34 ms
[2023-03-22 14:02:28] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2023-03-22 14:02:28] [INFO ] Invariant cache hit.
[2023-03-22 14:02:29] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-22 14:02:29] [INFO ] Invariant cache hit.
[2023-03-22 14:02:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:35] [INFO ] Implicit Places using invariants and state equation in 6456 ms returned []
Implicit Place search using SMT with State Equation took 6769 ms to find 0 implicit places.
[2023-03-22 14:02:35] [INFO ] Invariant cache hit.
[2023-03-22 14:02:36] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8249 ms. Remains : 170/170 places, 1885/1885 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 13397 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150384 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150384 steps, saw 39111 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:02:52] [INFO ] Invariant cache hit.
[2023-03-22 14:02:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:02:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-22 14:02:53] [INFO ] After 434ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 14:02:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:56] [INFO ] After 2988ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:56] [INFO ] After 3511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:02:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:02:56] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:02:56] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:03:00] [INFO ] After 3163ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:03:00] [INFO ] After 3234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-22 14:03:00] [INFO ] After 3752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:03:00] [INFO ] Invariant cache hit.
[2023-03-22 14:03:01] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 793 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1198 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154593 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154593 steps, saw 40203 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:03:04] [INFO ] Invariant cache hit.
[2023-03-22 14:03:04] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:03:04] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:03:04] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 14:03:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:03:07] [INFO ] After 2890ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:03:07] [INFO ] After 3396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:03:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:03:07] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:03:08] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:03:11] [INFO ] After 3206ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:03:11] [INFO ] After 3276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 14:03:11] [INFO ] After 3786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:03:11] [INFO ] Invariant cache hit.
[2023-03-22 14:03:11] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-22 14:03:11] [INFO ] Invariant cache hit.
[2023-03-22 14:03:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:03:18] [INFO ] Implicit Places using invariants and state equation in 6485 ms returned []
Implicit Place search using SMT with State Equation took 6809 ms to find 0 implicit places.
[2023-03-22 14:03:18] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-22 14:03:18] [INFO ] Invariant cache hit.
[2023-03-22 14:03:19] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7672 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 137 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-22 14:03:19] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-22 14:03:19] [INFO ] Computed 39 place invariants in 39 ms
[2023-03-22 14:03:19] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:03:19] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-22 14:03:19] [INFO ] After 520ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 14:03:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 14:03:20] [INFO ] After 586ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:03:20] [INFO ] After 1170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:03:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:03:20] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-22 14:03:21] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:03:21] [INFO ] After 378ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:03:21] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 14:03:21] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11901 reset in 1185 ms.
Product exploration explored 100000 steps with 11916 reset in 1193 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 164 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:03:26] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-22 14:03:27] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
[2023-03-22 14:03:27] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-22 14:03:27] [INFO ] Invariant cache hit.
[2023-03-22 14:03:28] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1651 ms. Remains : 170/170 places, 1885/1885 transitions.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:03:28] [INFO ] Invariant cache hit.
[2023-03-22 14:03:28] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2023-03-22 14:03:28] [INFO ] Invariant cache hit.
[2023-03-22 14:03:29] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-22 14:03:29] [INFO ] Invariant cache hit.
[2023-03-22 14:03:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:03:35] [INFO ] Implicit Places using invariants and state equation in 6497 ms returned []
Implicit Place search using SMT with State Equation took 6812 ms to find 0 implicit places.
[2023-03-22 14:03:35] [INFO ] Invariant cache hit.
[2023-03-22 14:03:36] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8222 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-02 finished in 123876 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 U p1)||X(!p1))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 125 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:03:36] [INFO ] Invariant cache hit.
[2023-03-22 14:03:37] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
[2023-03-22 14:03:37] [INFO ] Invariant cache hit.
[2023-03-22 14:03:37] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-22 14:03:37] [INFO ] Invariant cache hit.
[2023-03-22 14:03:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:03:44] [INFO ] Implicit Places using invariants and state equation in 6544 ms returned []
Implicit Place search using SMT with State Equation took 6843 ms to find 0 implicit places.
[2023-03-22 14:03:44] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 14:03:44] [INFO ] Invariant cache hit.
[2023-03-22 14:03:44] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8396 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, false, p1]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s12 s24 s30 s65 s66 s71 s99 s124 s138 s159)), p0:(LEQ 3 (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11947 reset in 1235 ms.
Product exploration explored 100000 steps with 11956 reset in 1233 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, false, p1]
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 14:03:49] [INFO ] Invariant cache hit.
[2023-03-22 14:03:49] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:03:49] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-22 14:03:49] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 14:03:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:03:49] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-22 14:03:49] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 14:03:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:01] [INFO ] After 11784ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:04:01] [INFO ] After 11852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-22 14:04:01] [INFO ] After 12452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 215 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 14:04:01] [INFO ] Computed 39 place invariants in 40 ms
[2023-03-22 14:04:02] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 975 ms. Remains : 160/170 places, 1875/1885 transitions.
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 144003 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 144003 steps, saw 36111 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 14:04:06] [INFO ] Invariant cache hit.
[2023-03-22 14:04:06] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 14:04:06] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-22 14:04:06] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 14:04:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:04:06] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-22 14:04:06] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 14:04:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:21] [INFO ] After 14478ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:04:21] [INFO ] After 14546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 14:04:21] [INFO ] After 15097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 96 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 14:04:21] [INFO ] Invariant cache hit.
[2023-03-22 14:04:21] [INFO ] Implicit Places using invariants in 336 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 342 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 203 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-22 14:04:22] [INFO ] Computed 29 place invariants in 28 ms
[2023-03-22 14:04:22] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-22 14:04:22] [INFO ] Invariant cache hit.
[2023-03-22 14:04:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:27] [INFO ] Implicit Places using invariants and state equation in 5674 ms returned []
Implicit Place search using SMT with State Equation took 5998 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6644 ms. Remains : 140/160 places, 1865/1875 transitions.
Incomplete random walk after 10000 steps, including 1773 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 1291 ms. (steps per millisecond=37 ) properties seen :0
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 1237 ms. (steps per millisecond=39 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1)]
Property proved to be true thanks to knowledge :(G (OR p0 p1))
Knowledge based reduction with 12 factoid took 716 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-03 finished in 55128 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)&&F(G(p1)))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 123 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:04:31] [INFO ] Computed 39 place invariants in 39 ms
[2023-03-22 14:04:32] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
[2023-03-22 14:04:32] [INFO ] Invariant cache hit.
[2023-03-22 14:04:32] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-22 14:04:32] [INFO ] Invariant cache hit.
[2023-03-22 14:04:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:39] [INFO ] Implicit Places using invariants and state equation in 6486 ms returned []
Implicit Place search using SMT with State Equation took 6790 ms to find 0 implicit places.
[2023-03-22 14:04:39] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 14:04:39] [INFO ] Invariant cache hit.
[2023-03-22 14:04:40] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8426 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GT 1 (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155)) (GT 1 (ADD s4 s11 s21 s22 s41 s46 s58 s72 s86 s136))), p1:(GT (ADD s16 s81 s87 s106 s109 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-04 finished in 8565 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((X(G(p0)) U (p1||X(p1)))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:40] [INFO ] Invariant cache hit.
[2023-03-22 14:04:40] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
[2023-03-22 14:04:40] [INFO ] Invariant cache hit.
[2023-03-22 14:04:41] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-22 14:04:41] [INFO ] Invariant cache hit.
[2023-03-22 14:04:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:47] [INFO ] Implicit Places using invariants and state equation in 6542 ms returned []
Implicit Place search using SMT with State Equation took 6903 ms to find 0 implicit places.
[2023-03-22 14:04:47] [INFO ] Invariant cache hit.
[2023-03-22 14:04:48] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8304 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 2284 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s16 s81 s87 s106 s109 s125 s141 s144 s160 s161)), p0:(LEQ (ADD s16 s81 s87 s106 s109 s125 s141 s144 s160 s161) (ADD s2 s38 s59 s77 s94 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-05 finished in 10610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:50] [INFO ] Invariant cache hit.
[2023-03-22 14:04:51] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
[2023-03-22 14:04:51] [INFO ] Invariant cache hit.
[2023-03-22 14:04:51] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-22 14:04:51] [INFO ] Invariant cache hit.
[2023-03-22 14:04:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:58] [INFO ] Implicit Places using invariants and state equation in 6938 ms returned []
Implicit Place search using SMT with State Equation took 7260 ms to find 0 implicit places.
[2023-03-22 14:04:58] [INFO ] Invariant cache hit.
[2023-03-22 14:04:59] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8675 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 1172 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11929 reset in 1174 ms.
Product exploration explored 100000 steps with 11971 reset in 1197 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151566 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151566 steps, saw 39393 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:05:06] [INFO ] Invariant cache hit.
[2023-03-22 14:05:06] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 14:05:06] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-22 14:05:06] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:05:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-22 14:05:06] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 14:05:06] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:05:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:09] [INFO ] After 2078ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:05:09] [INFO ] After 2161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-22 14:05:09] [INFO ] After 2663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 196 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 14:05:09] [INFO ] Computed 39 place invariants in 42 ms
[2023-03-22 14:05:10] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 160/170 places, 1875/1885 transitions.
Incomplete random walk after 10000 steps, including 1182 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 161521 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161521 steps, saw 40116 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 14:05:13] [INFO ] Invariant cache hit.
[2023-03-22 14:05:13] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 14:05:13] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-22 14:05:13] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:05:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 14:05:13] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-22 14:05:13] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:05:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:17] [INFO ] After 3992ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:05:18] [INFO ] Deduced a trap composed of 63 places in 274 ms of which 0 ms to minimize.
[2023-03-22 14:05:18] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 0 ms to minimize.
[2023-03-22 14:05:18] [INFO ] Deduced a trap composed of 74 places in 262 ms of which 0 ms to minimize.
[2023-03-22 14:05:19] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 0 ms to minimize.
[2023-03-22 14:05:19] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 0 ms to minimize.
[2023-03-22 14:05:19] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 1 ms to minimize.
[2023-03-22 14:05:20] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 0 ms to minimize.
[2023-03-22 14:05:20] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 0 ms to minimize.
[2023-03-22 14:05:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2943 ms
[2023-03-22 14:05:20] [INFO ] After 6989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 14:05:20] [INFO ] After 7518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 96 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 14:05:20] [INFO ] Invariant cache hit.
[2023-03-22 14:05:21] [INFO ] Implicit Places using invariants in 341 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 345 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 198 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-22 14:05:21] [INFO ] Computed 29 place invariants in 27 ms
[2023-03-22 14:05:21] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-22 14:05:21] [INFO ] Invariant cache hit.
[2023-03-22 14:05:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:27] [INFO ] Implicit Places using invariants and state equation in 6069 ms returned []
Implicit Place search using SMT with State Equation took 6392 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7032 ms. Remains : 140/160 places, 1865/1875 transitions.
Incomplete random walk after 10000 steps, including 1789 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 1124 ms. (steps per millisecond=43 ) properties seen :0
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 1110 ms. (steps per millisecond=43 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-06 finished in 39732 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 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:05:30] [INFO ] Computed 39 place invariants in 36 ms
[2023-03-22 14:05:31] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
[2023-03-22 14:05:31] [INFO ] Invariant cache hit.
[2023-03-22 14:05:31] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-22 14:05:31] [INFO ] Invariant cache hit.
[2023-03-22 14:05:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:39] [INFO ] Implicit Places using invariants and state equation in 7321 ms returned []
Implicit Place search using SMT with State Equation took 7687 ms to find 0 implicit places.
[2023-03-22 14:05:39] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-22 14:05:39] [INFO ] Invariant cache hit.
[2023-03-22 14:05:39] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9248 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s41)], 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]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-09 finished in 9305 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 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 109 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:05:39] [INFO ] Invariant cache hit.
[2023-03-22 14:05:40] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2023-03-22 14:05:40] [INFO ] Invariant cache hit.
[2023-03-22 14:05:40] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-22 14:05:40] [INFO ] Invariant cache hit.
[2023-03-22 14:05:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:48] [INFO ] Implicit Places using invariants and state equation in 7223 ms returned []
Implicit Place search using SMT with State Equation took 7594 ms to find 0 implicit places.
[2023-03-22 14:05:48] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-22 14:05:48] [INFO ] Invariant cache hit.
[2023-03-22 14:05:48] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9164 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 9796 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s27 s108)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 401 steps with 47 reset in 10 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-10 finished in 18994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (G(p1) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:05:58] [INFO ] Invariant cache hit.
[2023-03-22 14:05:59] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2023-03-22 14:05:59] [INFO ] Invariant cache hit.
[2023-03-22 14:05:59] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-22 14:05:59] [INFO ] Invariant cache hit.
[2023-03-22 14:06:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:06:07] [INFO ] Implicit Places using invariants and state equation in 7148 ms returned []
Implicit Place search using SMT with State Equation took 7513 ms to find 0 implicit places.
[2023-03-22 14:06:07] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-22 14:06:07] [INFO ] Invariant cache hit.
[2023-03-22 14:06:07] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9069 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 5642 ms :[(NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s65 s165), p1:(LEQ 1 s12), p0:(LEQ 1 s161)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-11 finished in 14737 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((F(p0)||X(p1)))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:06:13] [INFO ] Invariant cache hit.
[2023-03-22 14:06:14] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2023-03-22 14:06:14] [INFO ] Invariant cache hit.
[2023-03-22 14:06:14] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-22 14:06:14] [INFO ] Invariant cache hit.
[2023-03-22 14:06:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:06:22] [INFO ] Implicit Places using invariants and state equation in 7279 ms returned []
Implicit Place search using SMT with State Equation took 7661 ms to find 0 implicit places.
[2023-03-22 14:06:22] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-22 14:06:22] [INFO ] Invariant cache hit.
[2023-03-22 14:06:22] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9259 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 9070 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s13), p0:(LEQ s111 s136)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 326 steps with 37 reset in 10 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-12 finished in 18357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||X(F(p1))))||F(p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:06:31] [INFO ] Invariant cache hit.
[2023-03-22 14:06:32] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2023-03-22 14:06:32] [INFO ] Invariant cache hit.
[2023-03-22 14:06:32] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-22 14:06:32] [INFO ] Invariant cache hit.
[2023-03-22 14:06:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:06:40] [INFO ] Implicit Places using invariants and state equation in 7134 ms returned []
Implicit Place search using SMT with State Equation took 7488 ms to find 0 implicit places.
[2023-03-22 14:06:40] [INFO ] Invariant cache hit.
[2023-03-22 14:06:40] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8911 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s0 s157), p0:(GT 1 s146), p1:(LEQ 1 s30)], 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]]
Stuttering criterion allowed to conclude after 44 steps with 13 reset in 3 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-13 finished in 9088 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 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:06:40] [INFO ] Invariant cache hit.
[2023-03-22 14:06:41] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
[2023-03-22 14:06:41] [INFO ] Invariant cache hit.
[2023-03-22 14:06:42] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-22 14:06:42] [INFO ] Invariant cache hit.
[2023-03-22 14:06:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:06:49] [INFO ] Implicit Places using invariants and state equation in 7229 ms returned []
Implicit Place search using SMT with State Equation took 7586 ms to find 0 implicit places.
[2023-03-22 14:06:49] [INFO ] Invariant cache hit.
[2023-03-22 14:06:49] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8996 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 6130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s127)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2746 ms.
Product exploration explored 100000 steps with 50000 reset in 2682 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-14 finished in 20660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:07:01] [INFO ] Invariant cache hit.
[2023-03-22 14:07:02] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
[2023-03-22 14:07:02] [INFO ] Invariant cache hit.
[2023-03-22 14:07:02] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-22 14:07:02] [INFO ] Invariant cache hit.
[2023-03-22 14:07:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:07:10] [INFO ] Implicit Places using invariants and state equation in 7304 ms returned []
Implicit Place search using SMT with State Equation took 7673 ms to find 0 implicit places.
[2023-03-22 14:07:10] [INFO ] Invariant cache hit.
[2023-03-22 14:07:10] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9089 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 2 s146)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-15 finished in 9270 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)))'
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)&&G(p1))))'
[2023-03-22 14:07:11] [INFO ] Flatten gal took : 114 ms
[2023-03-22 14:07:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 14:07:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 18 ms.
Total runtime 554670 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1599/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1599/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLCardinality-01
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLCardinality-02
BK_STOP 1679494041942
--------------------
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
ltl formula name PhilosophersDyn-PT-10-LTLCardinality-01
ltl formula formula --ltl=/tmp/1599/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 1885 transitions and 14300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.060 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1599/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1599/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1599/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1599/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name PhilosophersDyn-PT-10-LTLCardinality-02
ltl formula formula --ltl=/tmp/1599/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 1885 transitions and 14300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.060 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1599/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1599/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1599/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1599/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-10"
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 PhilosophersDyn-PT-10, 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-167873950300323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 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 ;