About the Execution of LoLa+red for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 923.544 | 201491.00 | 251037.00 | 820.60 | FFFFFFFFFFFFFFTF | 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.r519-tall-167987245100276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is EisenbergMcGuire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245100276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 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 EisenbergMcGuire-PT-10-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1680826575763
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 00:16:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 00:16:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:16:17] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2023-04-07 00:16:17] [INFO ] Transformed 1090 places.
[2023-04-07 00:16:17] [INFO ] Transformed 5200 transitions.
[2023-04-07 00:16:17] [INFO ] Found NUPN structural information;
[2023-04-07 00:16:17] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 1004 transition count 4340
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 1004 transition count 4340
Applied a total of 172 rules in 174 ms. Remains 1004 /1090 variables (removed 86) and now considering 4340/5200 (removed 860) transitions.
[2023-04-07 00:16:18] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
// Phase 1: matrix 1470 rows 1004 cols
[2023-04-07 00:16:18] [INFO ] Computed 31 invariants in 26 ms
[2023-04-07 00:16:18] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-04-07 00:16:18] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 00:16:18] [INFO ] Invariant cache hit.
[2023-04-07 00:16:19] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 00:16:24] [INFO ] Implicit Places using invariants and state equation in 5834 ms returned []
Implicit Place search using SMT with State Equation took 6592 ms to find 0 implicit places.
[2023-04-07 00:16:24] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 00:16:24] [INFO ] Invariant cache hit.
[2023-04-07 00:16:26] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1004/1090 places, 4340/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8210 ms. Remains : 1004/1090 places, 4340/5200 transitions.
Support contains 52 out of 1004 places after structural reductions.
[2023-04-07 00:16:26] [INFO ] Flatten gal took : 263 ms
[2023-04-07 00:16:26] [INFO ] Flatten gal took : 164 ms
[2023-04-07 00:16:27] [INFO ] Input system was already deterministic with 4340 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 120054 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{9=1, 12=1, 13=1, 14=1}
Probabilistic random walk after 120054 steps, saw 97228 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :4
Running SMT prover for 18 properties.
[2023-04-07 00:16:30] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 00:16:30] [INFO ] Invariant cache hit.
[2023-04-07 00:16:31] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 00:16:31] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 00:16:32] [INFO ] After 1326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 00:16:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 31 ms returned sat
[2023-04-07 00:16:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 00:16:34] [INFO ] After 1592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-07 00:16:34] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 00:16:36] [INFO ] After 1760ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-07 00:16:37] [INFO ] Deduced a trap composed of 3 places in 459 ms of which 4 ms to minimize.
[2023-04-07 00:16:37] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 2 ms to minimize.
[2023-04-07 00:16:37] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 2 ms to minimize.
[2023-04-07 00:16:38] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 2 ms to minimize.
[2023-04-07 00:16:38] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 1 ms to minimize.
[2023-04-07 00:16:38] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 1 ms to minimize.
[2023-04-07 00:16:39] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 1 ms to minimize.
[2023-04-07 00:16:39] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 1 ms to minimize.
[2023-04-07 00:16:39] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 1 ms to minimize.
[2023-04-07 00:16:39] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2023-04-07 00:16:40] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-04-07 00:16:40] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2023-04-07 00:16:40] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2023-04-07 00:16:40] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2023-04-07 00:16:40] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 1 ms to minimize.
[2023-04-07 00:16:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-04-07 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4750 ms
[2023-04-07 00:16:41] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2023-04-07 00:16:41] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-04-07 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-04-07 00:16:42] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2023-04-07 00:16:42] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2023-04-07 00:16:42] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2023-04-07 00:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 542 ms
[2023-04-07 00:16:42] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-04-07 00:16:42] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2023-04-07 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-04-07 00:16:43] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 1 ms to minimize.
[2023-04-07 00:16:43] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 0 ms to minimize.
[2023-04-07 00:16:43] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 0 ms to minimize.
[2023-04-07 00:16:43] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2023-04-07 00:16:43] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2023-04-07 00:16:44] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2023-04-07 00:16:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1146 ms
[2023-04-07 00:16:44] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2023-04-07 00:16:44] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 1 ms to minimize.
[2023-04-07 00:16:44] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-04-07 00:16:45] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 0 ms to minimize.
[2023-04-07 00:16:45] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2023-04-07 00:16:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1038 ms
[2023-04-07 00:16:45] [INFO ] Deduced a trap composed of 41 places in 260 ms of which 1 ms to minimize.
[2023-04-07 00:16:46] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2023-04-07 00:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 613 ms
[2023-04-07 00:16:46] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-04-07 00:16:46] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2023-04-07 00:16:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-04-07 00:16:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2023-04-07 00:16:46] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2023-04-07 00:16:47] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-04-07 00:16:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2023-04-07 00:16:48] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2023-04-07 00:16:48] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2023-04-07 00:16:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2023-04-07 00:16:48] [INFO ] After 14203ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 1874 ms.
[2023-04-07 00:16:50] [INFO ] After 18460ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1206 ms.
Support contains 37 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1004 transition count 4331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 995 transition count 4331
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 18 place count 995 transition count 4024
Deduced a syphon composed of 307 places in 4 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 632 place count 688 transition count 4024
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 812 place count 598 transition count 3934
Applied a total of 812 rules in 438 ms. Remains 598 /1004 variables (removed 406) and now considering 3934/4340 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 598/1004 places, 3934/4340 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 144496 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{5=1, 13=1}
Probabilistic random walk after 144496 steps, saw 102543 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :2
Running SMT prover for 14 properties.
[2023-04-07 00:16:55] [INFO ] Flow matrix only has 1064 transitions (discarded 2870 similar events)
// Phase 1: matrix 1064 rows 598 cols
[2023-04-07 00:16:55] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 00:16:56] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-04-07 00:16:56] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 00:16:56] [INFO ] After 1011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 00:16:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-07 00:16:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 00:16:57] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 00:16:58] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 00:16:58] [INFO ] After 781ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 00:16:59] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 0 ms to minimize.
[2023-04-07 00:16:59] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-04-07 00:16:59] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2023-04-07 00:16:59] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-07 00:16:59] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 0 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 1 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1759 ms
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-07 00:17:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-04-07 00:17:01] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2023-04-07 00:17:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-07 00:17:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-07 00:17:01] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-04-07 00:17:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-04-07 00:17:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2023-04-07 00:17:01] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 0 ms to minimize.
[2023-04-07 00:17:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-04-07 00:17:02] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 00:17:02] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 0 ms to minimize.
[2023-04-07 00:17:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-04-07 00:17:02] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-07 00:17:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-07 00:17:02] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2023-04-07 00:17:02] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-04-07 00:17:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-04-07 00:17:03] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 00:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-07 00:17:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-04-07 00:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 00:17:03] [INFO ] After 5438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 857 ms.
[2023-04-07 00:17:04] [INFO ] After 7415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 84 ms.
Support contains 35 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 3934/3934 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 598 transition count 3933
Deduced a syphon composed of 1 places in 35 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 597 transition count 3933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 3923
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 3923
Applied a total of 4 rules in 279 ms. Remains 596 /598 variables (removed 2) and now considering 3923/3934 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 596/598 places, 3923/3934 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 137489 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137489 steps, saw 98725 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 14 properties.
[2023-04-07 00:17:08] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
// Phase 1: matrix 1053 rows 596 cols
[2023-04-07 00:17:08] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 00:17:08] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 00:17:08] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-07 00:17:08] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 00:17:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 00:17:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 00:17:09] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 00:17:09] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-04-07 00:17:10] [INFO ] After 765ms SMT Verify possible using 463 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 00:17:10] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2023-04-07 00:17:11] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-04-07 00:17:11] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 0 ms to minimize.
[2023-04-07 00:17:11] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 0 ms to minimize.
[2023-04-07 00:17:11] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2023-04-07 00:17:11] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2023-04-07 00:17:11] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-07 00:17:12] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:17:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 00:17:12] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-04-07 00:17:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1638 ms
[2023-04-07 00:17:12] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-04-07 00:17:12] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 0 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 881 ms
[2023-04-07 00:17:13] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 0 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2023-04-07 00:17:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2023-04-07 00:17:14] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 0 ms to minimize.
[2023-04-07 00:17:14] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-07 00:17:14] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-04-07 00:17:14] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-04-07 00:17:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 590 ms
[2023-04-07 00:17:14] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-04-07 00:17:14] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 0 ms to minimize.
[2023-04-07 00:17:15] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-04-07 00:17:15] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2023-04-07 00:17:15] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-04-07 00:17:15] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 0 ms to minimize.
[2023-04-07 00:17:15] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 0 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2023-04-07 00:17:16] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-04-07 00:17:17] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-04-07 00:17:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2547 ms
[2023-04-07 00:17:17] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2023-04-07 00:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 00:17:17] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-04-07 00:17:17] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-04-07 00:17:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2023-04-07 00:17:18] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-04-07 00:17:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-04-07 00:17:18] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2023-04-07 00:17:18] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2023-04-07 00:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-04-07 00:17:18] [INFO ] After 8775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 908 ms.
[2023-04-07 00:17:19] [INFO ] After 10731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 108 ms.
Support contains 35 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3923/3923 transitions.
Applied a total of 0 rules in 141 ms. Remains 596 /596 variables (removed 0) and now considering 3923/3923 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 596/596 places, 3923/3923 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3923/3923 transitions.
Applied a total of 0 rules in 142 ms. Remains 596 /596 variables (removed 0) and now considering 3923/3923 (removed 0) transitions.
[2023-04-07 00:17:20] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 00:17:20] [INFO ] Invariant cache hit.
[2023-04-07 00:17:20] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-04-07 00:17:20] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 00:17:20] [INFO ] Invariant cache hit.
[2023-04-07 00:17:20] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-04-07 00:17:23] [INFO ] Implicit Places using invariants and state equation in 3396 ms returned []
Implicit Place search using SMT with State Equation took 3850 ms to find 0 implicit places.
[2023-04-07 00:17:24] [INFO ] Redundant transitions in 240 ms returned []
[2023-04-07 00:17:24] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 00:17:24] [INFO ] Invariant cache hit.
[2023-04-07 00:17:25] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5322 ms. Remains : 596/596 places, 3923/3923 transitions.
Graph (trivial) has 3367 edges and 596 vertex of which 100 / 596 are part of one of the 10 SCC in 4 ms
Free SCC test removed 90 places
Drop transitions removed 344 transitions
Ensure Unique test removed 2817 transitions
Reduce isomorphic transitions removed 3161 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 506 transition count 654
Reduce places removed 108 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 219 place count 398 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 221 place count 396 transition count 652
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 221 place count 396 transition count 634
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 264 place count 371 transition count 634
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 598 place count 204 transition count 467
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 667 place count 204 transition count 398
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 673 place count 201 transition count 398
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 676 place count 201 transition count 395
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 695 place count 201 transition count 376
Free-agglomeration rule applied 102 times.
Iterating global reduction 5 with 102 rules applied. Total rules applied 797 place count 201 transition count 274
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 899 place count 99 transition count 274
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 909 place count 99 transition count 274
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 910 place count 99 transition count 274
Applied a total of 910 rules in 80 ms. Remains 99 /596 variables (removed 497) and now considering 274/3923 (removed 3649) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 274 rows 99 cols
[2023-04-07 00:17:25] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 00:17:25] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 00:17:25] [INFO ] [Real]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 00:17:25] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 00:17:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 00:17:25] [INFO ] [Nat]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 00:17:25] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 00:17:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 00:17:25] [INFO ] After 132ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 00:17:25] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
[2023-04-07 00:17:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 138 ms
[2023-04-07 00:17:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-04-07 00:17:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-04-07 00:17:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-04-07 00:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-04-07 00:17:26] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-04-07 00:17:26] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 4 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 380 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 00:17:27] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 00:17:27] [INFO ] Computed 31 invariants in 12 ms
[2023-04-07 00:17:27] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-04-07 00:17:27] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:17:27] [INFO ] Invariant cache hit.
[2023-04-07 00:17:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:17:31] [INFO ] Implicit Places using invariants and state equation in 3651 ms returned []
Implicit Place search using SMT with State Equation took 4212 ms to find 0 implicit places.
[2023-04-07 00:17:31] [INFO ] Redundant transitions in 215 ms returned []
[2023-04-07 00:17:31] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:17:31] [INFO ] Invariant cache hit.
[2023-04-07 00:17:32] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5947 ms. Remains : 591/1004 places, 3891/4340 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s23 1) (EQ s434 1)), p0:(OR (AND (EQ s33 1) (EQ s260 1)) (AND (EQ s3 1) (EQ s20 1) (EQ s366 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 464 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-00 finished in 6689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 53 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 00:17:33] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 00:17:33] [INFO ] Computed 31 invariants in 13 ms
[2023-04-07 00:17:34] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-04-07 00:17:34] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:17:34] [INFO ] Invariant cache hit.
[2023-04-07 00:17:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:17:40] [INFO ] Implicit Places using invariants and state equation in 6781 ms returned []
Implicit Place search using SMT with State Equation took 7463 ms to find 0 implicit places.
[2023-04-07 00:17:40] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:17:40] [INFO ] Invariant cache hit.
[2023-04-07 00:17:42] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8875 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s764 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-03 finished in 9001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 4 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 249 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 00:17:42] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 00:17:42] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 00:17:43] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-04-07 00:17:43] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:17:43] [INFO ] Invariant cache hit.
[2023-04-07 00:17:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:17:46] [INFO ] Implicit Places using invariants and state equation in 3749 ms returned []
Implicit Place search using SMT with State Equation took 4345 ms to find 0 implicit places.
[2023-04-07 00:17:47] [INFO ] Redundant transitions in 122 ms returned []
[2023-04-07 00:17:47] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:17:47] [INFO ] Invariant cache hit.
[2023-04-07 00:17:48] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5898 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 325 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-04 finished in 6325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 643 place count 681 transition count 3990
Iterating global reduction 2 with 3 rules applied. Total rules applied 646 place count 681 transition count 3990
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 824 place count 592 transition count 3901
Applied a total of 824 rules in 259 ms. Remains 592 /1004 variables (removed 412) and now considering 3901/4340 (removed 439) transitions.
[2023-04-07 00:17:48] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
// Phase 1: matrix 1031 rows 592 cols
[2023-04-07 00:17:48] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 00:17:49] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-04-07 00:17:49] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2023-04-07 00:17:49] [INFO ] Invariant cache hit.
[2023-04-07 00:17:49] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 00:17:53] [INFO ] Implicit Places using invariants and state equation in 3531 ms returned []
Implicit Place search using SMT with State Equation took 4125 ms to find 0 implicit places.
[2023-04-07 00:17:53] [INFO ] Redundant transitions in 123 ms returned []
[2023-04-07 00:17:53] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2023-04-07 00:17:53] [INFO ] Invariant cache hit.
[2023-04-07 00:17:54] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1004 places, 3901/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5632 ms. Remains : 592/1004 places, 3901/4340 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-05 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s160 1)), p1:(EQ s161 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-05 finished in 6135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 6 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 48 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 00:17:54] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 00:17:54] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 00:17:55] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-04-07 00:17:55] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:17:55] [INFO ] Invariant cache hit.
[2023-04-07 00:17:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:02] [INFO ] Implicit Places using invariants and state equation in 6965 ms returned []
Implicit Place search using SMT with State Equation took 7609 ms to find 0 implicit places.
[2023-04-07 00:18:02] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:02] [INFO ] Invariant cache hit.
[2023-04-07 00:18:03] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9061 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s21 1) (EQ s737 1)), p1:(OR (NEQ s8 1) (NEQ s36 1) (NEQ s754 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 359 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 212179 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212179 steps, saw 167608 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:18:08] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:08] [INFO ] Invariant cache hit.
[2023-04-07 00:18:08] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2023-04-07 00:18:08] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 00:18:08] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:18:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2023-04-07 00:18:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 00:18:09] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:18:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:10] [INFO ] After 398ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:18:10] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 1 ms to minimize.
[2023-04-07 00:18:10] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 1 ms to minimize.
[2023-04-07 00:18:11] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 0 ms to minimize.
[2023-04-07 00:18:11] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 0 ms to minimize.
[2023-04-07 00:18:11] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 0 ms to minimize.
[2023-04-07 00:18:11] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 1 ms to minimize.
[2023-04-07 00:18:12] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 0 ms to minimize.
[2023-04-07 00:18:12] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2023-04-07 00:18:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2407 ms
[2023-04-07 00:18:12] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 0 ms to minimize.
[2023-04-07 00:18:12] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 0 ms to minimize.
[2023-04-07 00:18:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2023-04-07 00:18:13] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-07 00:18:13] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-04-07 00:18:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2023-04-07 00:18:13] [INFO ] After 3939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-04-07 00:18:13] [INFO ] After 4981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 209 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 590/1000 places, 3890/4300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 275319 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275319 steps, saw 186934 distinct states, run finished after 3004 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:18:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-07 00:18:17] [INFO ] Computed 31 invariants in 3 ms
[2023-04-07 00:18:17] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 00:18:17] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 00:18:17] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:18:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-07 00:18:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 00:18:18] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:18:18] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:18] [INFO ] After 245ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:18:18] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-04-07 00:18:18] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-04-07 00:18:18] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1161 ms
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-07 00:18:19] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2023-04-07 00:18:20] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-04-07 00:18:20] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-04-07 00:18:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 619 ms
[2023-04-07 00:18:20] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 0 ms to minimize.
[2023-04-07 00:18:20] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 0 ms to minimize.
[2023-04-07 00:18:20] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-04-07 00:18:20] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2023-04-07 00:18:21] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2023-04-07 00:18:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 880 ms
[2023-04-07 00:18:21] [INFO ] After 3063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-04-07 00:18:21] [INFO ] After 3778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 137 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-07 00:18:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 00:18:21] [INFO ] Invariant cache hit.
[2023-04-07 00:18:22] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-04-07 00:18:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 00:18:22] [INFO ] Invariant cache hit.
[2023-04-07 00:18:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:25] [INFO ] Implicit Places using invariants and state equation in 3600 ms returned []
Implicit Place search using SMT with State Equation took 4154 ms to find 0 implicit places.
[2023-04-07 00:18:25] [INFO ] Redundant transitions in 122 ms returned []
[2023-04-07 00:18:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 00:18:25] [INFO ] Invariant cache hit.
[2023-04-07 00:18:27] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5552 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3614 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 500 transition count 633
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 235 place count 383 transition count 633
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 235 place count 383 transition count 612
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 287 place count 352 transition count 612
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 643 place count 174 transition count 434
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 86 rules applied. Total rules applied 729 place count 174 transition count 348
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 745 place count 166 transition count 348
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 753 place count 166 transition count 340
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 763 place count 166 transition count 330
Free-agglomeration rule applied 92 times.
Iterating global reduction 4 with 92 rules applied. Total rules applied 855 place count 166 transition count 238
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 4 with 92 rules applied. Total rules applied 947 place count 74 transition count 238
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 957 place count 74 transition count 238
Applied a total of 957 rules in 54 ms. Remains 74 /590 variables (removed 516) and now considering 238/3890 (removed 3652) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 238 rows 74 cols
[2023-04-07 00:18:27] [INFO ] Computed 21 invariants in 2 ms
[2023-04-07 00:18:27] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 00:18:27] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:18:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-07 00:18:27] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 00:18:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 00:18:27] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 00:18:27] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-07 00:18:27] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 00:18:27] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 00:18:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2023-04-07 00:18:27] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 00:18:27] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2023-04-07 00:18:27] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 00:18:28] [INFO ] Computed 31 invariants in 12 ms
[2023-04-07 00:18:29] [INFO ] [Real]Absence check using 21 positive place invariants in 29 ms returned sat
[2023-04-07 00:18:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 64 ms returned sat
[2023-04-07 00:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:18:31] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2023-04-07 00:18:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:18:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2023-04-07 00:18:33] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 35 ms returned sat
[2023-04-07 00:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:18:34] [INFO ] [Nat]Absence check using state equation in 1716 ms returned sat
[2023-04-07 00:18:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:34] [INFO ] [Nat]Added 436 Read/Feed constraints in 80 ms returned sat
[2023-04-07 00:18:35] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 1 ms to minimize.
[2023-04-07 00:18:36] [INFO ] Deduced a trap composed of 3 places in 450 ms of which 1 ms to minimize.
[2023-04-07 00:18:36] [INFO ] Deduced a trap composed of 3 places in 470 ms of which 1 ms to minimize.
[2023-04-07 00:18:37] [INFO ] Deduced a trap composed of 42 places in 497 ms of which 0 ms to minimize.
[2023-04-07 00:18:37] [INFO ] Deduced a trap composed of 68 places in 502 ms of which 1 ms to minimize.
[2023-04-07 00:18:38] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 1 ms to minimize.
[2023-04-07 00:18:39] [INFO ] Deduced a trap composed of 3 places in 512 ms of which 1 ms to minimize.
[2023-04-07 00:18:39] [INFO ] Deduced a trap composed of 3 places in 452 ms of which 1 ms to minimize.
[2023-04-07 00:18:40] [INFO ] Deduced a trap composed of 40 places in 474 ms of which 0 ms to minimize.
[2023-04-07 00:18:40] [INFO ] Deduced a trap composed of 3 places in 479 ms of which 1 ms to minimize.
[2023-04-07 00:18:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 5759 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-06 finished in 46056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 49 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 00:18:40] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:40] [INFO ] Invariant cache hit.
[2023-04-07 00:18:41] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-04-07 00:18:41] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:41] [INFO ] Invariant cache hit.
[2023-04-07 00:18:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:49] [INFO ] Implicit Places using invariants and state equation in 7854 ms returned []
Implicit Place search using SMT with State Equation took 8532 ms to find 0 implicit places.
[2023-04-07 00:18:49] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:49] [INFO ] Invariant cache hit.
[2023-04-07 00:18:50] [INFO ] Dead Transitions using invariants and state equation in 1422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10004 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s17 1) (EQ s842 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-08 finished in 10134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(G(p1)))))'
Support contains 7 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 43 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 00:18:51] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:51] [INFO ] Invariant cache hit.
[2023-04-07 00:18:51] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-04-07 00:18:51] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:51] [INFO ] Invariant cache hit.
[2023-04-07 00:18:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:18:58] [INFO ] Implicit Places using invariants and state equation in 6814 ms returned []
Implicit Place search using SMT with State Equation took 7474 ms to find 0 implicit places.
[2023-04-07 00:18:58] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 00:18:58] [INFO ] Invariant cache hit.
[2023-04-07 00:18:59] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8927 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s34 1) (EQ s557 1)), p0:(OR (AND (EQ s0 1) (EQ s10 1) (EQ s759 1)) (AND (EQ s2 1) (EQ s906 1)))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-09 finished in 9145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1004 transition count 4331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 995 transition count 4331
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 18 place count 995 transition count 4021
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 227 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 00:19:00] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 00:19:00] [INFO ] Computed 31 invariants in 7 ms
[2023-04-07 00:19:00] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-04-07 00:19:00] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:19:00] [INFO ] Invariant cache hit.
[2023-04-07 00:19:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:19:04] [INFO ] Implicit Places using invariants and state equation in 3408 ms returned []
Implicit Place search using SMT with State Equation took 4010 ms to find 0 implicit places.
[2023-04-07 00:19:04] [INFO ] Redundant transitions in 122 ms returned []
[2023-04-07 00:19:04] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:19:04] [INFO ] Invariant cache hit.
[2023-04-07 00:19:05] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5462 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s34 1) (EQ s414 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-10 finished in 5793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 994 transition count 4022
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 686 transition count 4022
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 640 place count 682 transition count 3982
Iterating global reduction 2 with 4 rules applied. Total rules applied 644 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 822 place count 593 transition count 3893
Applied a total of 822 rules in 237 ms. Remains 593 /1004 variables (removed 411) and now considering 3893/4340 (removed 447) transitions.
[2023-04-07 00:19:06] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2023-04-07 00:19:06] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 00:19:06] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-04-07 00:19:06] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2023-04-07 00:19:06] [INFO ] Invariant cache hit.
[2023-04-07 00:19:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:19:10] [INFO ] Implicit Places using invariants and state equation in 3532 ms returned []
Implicit Place search using SMT with State Equation took 4119 ms to find 0 implicit places.
[2023-04-07 00:19:10] [INFO ] Redundant transitions in 126 ms returned []
[2023-04-07 00:19:10] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2023-04-07 00:19:10] [INFO ] Invariant cache hit.
[2023-04-07 00:19:11] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 593/1004 places, 3893/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5647 ms. Remains : 593/1004 places, 3893/4340 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-11 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:(OR (NEQ s6 1) (NEQ s30 1) (NEQ s397 1)), p1:(OR (NEQ s103 1) (AND (EQ s32 1) (EQ s466 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 629 steps with 0 reset with depth 630 and stack size 570 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-11 finished in 6078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1 U p2))))'
Support contains 5 out of 1004 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 643 place count 681 transition count 3990
Iterating global reduction 2 with 3 rules applied. Total rules applied 646 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3900
Applied a total of 826 rules in 237 ms. Remains 591 /1004 variables (removed 413) and now considering 3900/4340 (removed 440) transitions.
[2023-04-07 00:19:12] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2023-04-07 00:19:12] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 00:19:12] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-04-07 00:19:12] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2023-04-07 00:19:12] [INFO ] Invariant cache hit.
[2023-04-07 00:19:13] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 00:19:16] [INFO ] Implicit Places using invariants and state equation in 3700 ms returned []
Implicit Place search using SMT with State Equation took 4275 ms to find 0 implicit places.
[2023-04-07 00:19:16] [INFO ] Redundant transitions in 123 ms returned []
[2023-04-07 00:19:16] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2023-04-07 00:19:16] [INFO ] Invariant cache hit.
[2023-04-07 00:19:17] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3900/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5751 ms. Remains : 591/1004 places, 3900/4340 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s160 1)), p2:(AND (EQ s8 1) (EQ s35 1) (EQ s371 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 290 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-12 finished in 6108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1001 transition count 4310
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1001 transition count 4310
Applied a total of 6 rules in 54 ms. Remains 1001 /1004 variables (removed 3) and now considering 4310/4340 (removed 30) transitions.
[2023-04-07 00:19:18] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2023-04-07 00:19:18] [INFO ] Computed 31 invariants in 12 ms
[2023-04-07 00:19:18] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-04-07 00:19:18] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2023-04-07 00:19:18] [INFO ] Invariant cache hit.
[2023-04-07 00:19:19] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 00:19:26] [INFO ] Implicit Places using invariants and state equation in 7656 ms returned []
Implicit Place search using SMT with State Equation took 8351 ms to find 0 implicit places.
[2023-04-07 00:19:26] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2023-04-07 00:19:26] [INFO ] Invariant cache hit.
[2023-04-07 00:19:27] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1004 places, 4310/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9722 ms. Remains : 1001/1004 places, 4310/4340 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-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:(OR (EQ s3 0) (EQ s21 0) (EQ s675 0) (AND (EQ s3 1) (EQ s250 1)))], 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 1080 ms.
Product exploration explored 100000 steps with 50000 reset in 1056 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-14 finished in 12005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 236 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 00:19:30] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 00:19:30] [INFO ] Computed 31 invariants in 7 ms
[2023-04-07 00:19:30] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-04-07 00:19:30] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:19:30] [INFO ] Invariant cache hit.
[2023-04-07 00:19:31] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 00:19:34] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 4264 ms to find 0 implicit places.
[2023-04-07 00:19:34] [INFO ] Redundant transitions in 122 ms returned []
[2023-04-07 00:19:34] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 00:19:34] [INFO ] Invariant cache hit.
[2023-04-07 00:19:35] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5786 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 348 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-15 finished in 6215 ms.
All properties solved by simple procedures.
Total runtime 199042 ms.
ITS solved all properties within timeout
BK_STOP 1680826777254
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is EisenbergMcGuire-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987245100276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;