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.r521-tall-167987246400276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400276
=====================================================================

--------------------
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 1680852838868

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 07:34:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 07:34:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:34:00] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2023-04-07 07:34:01] [INFO ] Transformed 1090 places.
[2023-04-07 07:34:01] [INFO ] Transformed 5200 transitions.
[2023-04-07 07:34:01] [INFO ] Found NUPN structural information;
[2023-04-07 07:34:01] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 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 233 ms. Remains 1004 /1090 variables (removed 86) and now considering 4340/5200 (removed 860) transitions.
[2023-04-07 07:34:01] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
// Phase 1: matrix 1470 rows 1004 cols
[2023-04-07 07:34:01] [INFO ] Computed 31 invariants in 26 ms
[2023-04-07 07:34:02] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2023-04-07 07:34:02] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 07:34:02] [INFO ] Invariant cache hit.
[2023-04-07 07:34:03] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 07:34:09] [INFO ] Implicit Places using invariants and state equation in 6780 ms returned []
Implicit Place search using SMT with State Equation took 8091 ms to find 0 implicit places.
[2023-04-07 07:34:09] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 07:34:09] [INFO ] Invariant cache hit.
[2023-04-07 07:34:11] [INFO ] Dead Transitions using invariants and state equation in 1579 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 9907 ms. Remains : 1004/1090 places, 4340/5200 transitions.
Support contains 52 out of 1004 places after structural reductions.
[2023-04-07 07:34:11] [INFO ] Flatten gal took : 275 ms
[2023-04-07 07:34:11] [INFO ] Flatten gal took : 144 ms
[2023-04-07 07:34:12] [INFO ] Input system was already deterministic with 4340 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 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 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 7 ms. (steps per millisecond=143 ) 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 7 ms. (steps per millisecond=143 ) 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 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 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 8 ms. (steps per millisecond=125 ) 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
Interrupted probabilistic random walk after 122562 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{9=1, 12=1, 13=1, 14=1}
Probabilistic random walk after 122562 steps, saw 99175 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :4
Running SMT prover for 18 properties.
[2023-04-07 07:34:15] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 07:34:15] [INFO ] Invariant cache hit.
[2023-04-07 07:34:16] [INFO ] [Real]Absence check using 21 positive place invariants in 35 ms returned sat
[2023-04-07 07:34:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 07:34:17] [INFO ] After 1282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 07:34:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 28 ms returned sat
[2023-04-07 07:34:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 07:34:19] [INFO ] After 1647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-07 07:34:19] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 07:34:21] [INFO ] After 1808ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-07 07:34:22] [INFO ] Deduced a trap composed of 3 places in 521 ms of which 13 ms to minimize.
[2023-04-07 07:34:22] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 1 ms to minimize.
[2023-04-07 07:34:22] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 1 ms to minimize.
[2023-04-07 07:34:23] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 2 ms to minimize.
[2023-04-07 07:34:23] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 1 ms to minimize.
[2023-04-07 07:34:23] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 0 ms to minimize.
[2023-04-07 07:34:24] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 1 ms to minimize.
[2023-04-07 07:34:24] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 1 ms to minimize.
[2023-04-07 07:34:24] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 1 ms to minimize.
[2023-04-07 07:34:25] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 0 ms to minimize.
[2023-04-07 07:34:25] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 07:34:25] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2023-04-07 07:34:25] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 0 ms to minimize.
[2023-04-07 07:34:25] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 1 ms to minimize.
[2023-04-07 07:34:25] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 1 ms to minimize.
[2023-04-07 07:34:26] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-04-07 07:34:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4762 ms
[2023-04-07 07:34:26] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2023-04-07 07:34:26] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2023-04-07 07:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2023-04-07 07:34:27] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2023-04-07 07:34:27] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 3 ms to minimize.
[2023-04-07 07:34:27] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-04-07 07:34:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 578 ms
[2023-04-07 07:34:27] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2023-04-07 07:34:27] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2023-04-07 07:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-04-07 07:34:28] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 1 ms to minimize.
[2023-04-07 07:34:28] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 0 ms to minimize.
[2023-04-07 07:34:28] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 0 ms to minimize.
[2023-04-07 07:34:28] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 07:34:28] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2023-04-07 07:34:29] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2023-04-07 07:34:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1170 ms
[2023-04-07 07:34:29] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 0 ms to minimize.
[2023-04-07 07:34:29] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 0 ms to minimize.
[2023-04-07 07:34:29] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2023-04-07 07:34:30] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2023-04-07 07:34:30] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 1 ms to minimize.
[2023-04-07 07:34:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1044 ms
[2023-04-07 07:34:30] [INFO ] Deduced a trap composed of 41 places in 417 ms of which 4 ms to minimize.
[2023-04-07 07:34:31] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 1 ms to minimize.
[2023-04-07 07:34:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 796 ms
[2023-04-07 07:34:31] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2023-04-07 07:34:31] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2023-04-07 07:34:31] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-04-07 07:34:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 645 ms
[2023-04-07 07:34:32] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2023-04-07 07:34:32] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-04-07 07:34:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2023-04-07 07:34:33] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2023-04-07 07:34:33] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2023-04-07 07:34:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2023-04-07 07:34:34] [INFO ] After 14629ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 1927 ms.
[2023-04-07 07:34:36] [INFO ] After 18974ms 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 1082 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 428 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 429 ms. Remains : 598/1004 places, 3934/4340 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) 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 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
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 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
Interrupted probabilistic random walk after 147884 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{5=1, 13=1}
Probabilistic random walk after 147884 steps, saw 105023 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :2
Running SMT prover for 14 properties.
[2023-04-07 07:34:41] [INFO ] Flow matrix only has 1064 transitions (discarded 2870 similar events)
// Phase 1: matrix 1064 rows 598 cols
[2023-04-07 07:34:41] [INFO ] Computed 31 invariants in 16 ms
[2023-04-07 07:34:41] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-04-07 07:34:41] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-07 07:34:42] [INFO ] After 1423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 07:34:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-07 07:34:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:34:43] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 07:34:43] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 07:34:44] [INFO ] After 787ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 07:34:44] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 1 ms to minimize.
[2023-04-07 07:34:44] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2023-04-07 07:34:45] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 1 ms to minimize.
[2023-04-07 07:34:45] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 1 ms to minimize.
[2023-04-07 07:34:45] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-04-07 07:34:45] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 0 ms to minimize.
[2023-04-07 07:34:45] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2023-04-07 07:34:46] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-04-07 07:34:46] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-04-07 07:34:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-04-07 07:34:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1948 ms
[2023-04-07 07:34:46] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2023-04-07 07:34:46] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-07 07:34:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2023-04-07 07:34:47] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-04-07 07:34:47] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-07 07:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2023-04-07 07:34:47] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2023-04-07 07:34:47] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-04-07 07:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-04-07 07:34:47] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 0 ms to minimize.
[2023-04-07 07:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 07:34:48] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-07 07:34:48] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2023-04-07 07:34:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-04-07 07:34:48] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-07 07:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-07 07:34:48] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2023-04-07 07:34:48] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-04-07 07:34:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-04-07 07:34:49] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-07 07:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-04-07 07:34:49] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 12 ms to minimize.
[2023-04-07 07:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-07 07:34:49] [INFO ] After 5850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 905 ms.
[2023-04-07 07:34:50] [INFO ] After 7893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 133 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 4 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 352 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 352 ms. Remains : 596/598 places, 3923/3934 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) 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 32 ms. (steps per millisecond=312 ) 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 23 ms. (steps per millisecond=434 ) 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 35 ms. (steps per millisecond=285 ) 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 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 34 ms. (steps per millisecond=294 ) 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 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 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 152064 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152064 steps, saw 107752 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 14 properties.
[2023-04-07 07:34:54] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
// Phase 1: matrix 1053 rows 596 cols
[2023-04-07 07:34:54] [INFO ] Computed 31 invariants in 5 ms
[2023-04-07 07:34:54] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 07:34:54] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:34:55] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 07:34:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 07:34:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:34:56] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 07:34:56] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-04-07 07:34:57] [INFO ] After 822ms SMT Verify possible using 463 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 07:34:57] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-04-07 07:34:57] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2023-04-07 07:34:57] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 1 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 1 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-07 07:34:58] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2023-04-07 07:34:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1763 ms
[2023-04-07 07:34:59] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2023-04-07 07:34:59] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 0 ms to minimize.
[2023-04-07 07:34:59] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 07:34:59] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-07 07:34:59] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2023-04-07 07:34:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 864 ms
[2023-04-07 07:35:00] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 0 ms to minimize.
[2023-04-07 07:35:00] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-04-07 07:35:00] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2023-04-07 07:35:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 531 ms
[2023-04-07 07:35:00] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 1 ms to minimize.
[2023-04-07 07:35:00] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 07:35:01] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-04-07 07:35:01] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-04-07 07:35:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 680 ms
[2023-04-07 07:35:01] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-04-07 07:35:01] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 0 ms to minimize.
[2023-04-07 07:35:01] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-04-07 07:35:02] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2023-04-07 07:35:02] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2023-04-07 07:35:02] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 1 ms to minimize.
[2023-04-07 07:35:02] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2023-04-07 07:35:02] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2023-04-07 07:35:03] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2023-04-07 07:35:03] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2023-04-07 07:35:03] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 0 ms to minimize.
[2023-04-07 07:35:03] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 0 ms to minimize.
[2023-04-07 07:35:03] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 1 ms to minimize.
[2023-04-07 07:35:03] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2023-04-07 07:35:04] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2023-04-07 07:35:04] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2806 ms
[2023-04-07 07:35:04] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-04-07 07:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-07 07:35:04] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2023-04-07 07:35:05] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-04-07 07:35:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2023-04-07 07:35:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-04-07 07:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-04-07 07:35:05] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2023-04-07 07:35:05] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2023-04-07 07:35:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-04-07 07:35:05] [INFO ] After 9482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 972 ms.
[2023-04-07 07:35:06] [INFO ] After 11532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 127 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 142 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 142 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 207 ms. Remains 596 /596 variables (removed 0) and now considering 3923/3923 (removed 0) transitions.
[2023-04-07 07:35:07] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 07:35:07] [INFO ] Invariant cache hit.
[2023-04-07 07:35:07] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-04-07 07:35:07] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 07:35:07] [INFO ] Invariant cache hit.
[2023-04-07 07:35:08] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-04-07 07:35:11] [INFO ] Implicit Places using invariants and state equation in 3513 ms returned []
Implicit Place search using SMT with State Equation took 4083 ms to find 0 implicit places.
[2023-04-07 07:35:11] [INFO ] Redundant transitions in 252 ms returned []
[2023-04-07 07:35:11] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 07:35:11] [INFO ] Invariant cache hit.
[2023-04-07 07:35:13] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5956 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 0 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 1 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 75 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 07:35:13] [INFO ] Computed 24 invariants in 1 ms
[2023-04-07 07:35:13] [INFO ] [Real]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-07 07:35:13] [INFO ] [Real]Absence check using 21 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 07:35:13] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 07:35:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-07 07:35:13] [INFO ] [Nat]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 07:35:13] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 07:35:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 07:35:13] [INFO ] After 134ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 07:35:13] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2023-04-07 07:35:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 155 ms
[2023-04-07 07:35:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-04-07 07:35:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-04-07 07:35:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-07 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-07 07:35:14] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-04-07 07:35:14] [INFO ] After 1065ms 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 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 380 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 07:35:15] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:35:15] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 07:35:15] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-04-07 07:35:15] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:35:15] [INFO ] Invariant cache hit.
[2023-04-07 07:35:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:35:19] [INFO ] Implicit Places using invariants and state equation in 3818 ms returned []
Implicit Place search using SMT with State Equation took 4387 ms to find 0 implicit places.
[2023-04-07 07:35:19] [INFO ] Redundant transitions in 204 ms returned []
[2023-04-07 07:35:19] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:35:19] [INFO ] Invariant cache hit.
[2023-04-07 07:35:20] [INFO ] Dead Transitions using invariants and state equation in 1222 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 6209 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 158 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 504 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-00 finished in 6938 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 07:35:21] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 07:35:21] [INFO ] Computed 31 invariants in 17 ms
[2023-04-07 07:35:22] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-04-07 07:35:22] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:35:22] [INFO ] Invariant cache hit.
[2023-04-07 07:35:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:35:29] [INFO ] Implicit Places using invariants and state equation in 7093 ms returned []
Implicit Place search using SMT with State Equation took 7794 ms to find 0 implicit places.
[2023-04-07 07:35:29] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:35:29] [INFO ] Invariant cache hit.
[2023-04-07 07:35:30] [INFO ] Dead Transitions using invariants and state equation in 1354 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 9202 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 81 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 9320 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 258 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 07:35:31] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:35:31] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 07:35:31] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-04-07 07:35:31] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:35:31] [INFO ] Invariant cache hit.
[2023-04-07 07:35:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:35:35] [INFO ] Implicit Places using invariants and state equation in 3517 ms returned []
Implicit Place search using SMT with State Equation took 4164 ms to find 0 implicit places.
[2023-04-07 07:35:35] [INFO ] Redundant transitions in 126 ms returned []
[2023-04-07 07:35:35] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:35:35] [INFO ] Invariant cache hit.
[2023-04-07 07:35:36] [INFO ] Dead Transitions using invariants and state equation in 1248 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 5803 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 83 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 322 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-04 finished in 6233 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 3 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 7 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 07:35:37] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
// Phase 1: matrix 1031 rows 592 cols
[2023-04-07 07:35:37] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 07:35:38] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-04-07 07:35:38] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2023-04-07 07:35:38] [INFO ] Invariant cache hit.
[2023-04-07 07:35:38] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 07:35:41] [INFO ] Implicit Places using invariants and state equation in 3667 ms returned []
Implicit Place search using SMT with State Equation took 4320 ms to find 0 implicit places.
[2023-04-07 07:35:41] [INFO ] Redundant transitions in 120 ms returned []
[2023-04-07 07:35:41] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2023-04-07 07:35:41] [INFO ] Invariant cache hit.
[2023-04-07 07:35:43] [INFO ] Dead Transitions using invariants and state equation in 1472 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 6178 ms. Remains : 592/1004 places, 3901/4340 transitions.
Stuttering acceptance computed with spot in 122 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 309 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-05 finished in 6646 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 52 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 07:35:43] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 07:35:43] [INFO ] Computed 31 invariants in 5 ms
[2023-04-07 07:35:44] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-04-07 07:35:44] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:35:44] [INFO ] Invariant cache hit.
[2023-04-07 07:35:45] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:35:51] [INFO ] Implicit Places using invariants and state equation in 6568 ms returned []
Implicit Place search using SMT with State Equation took 7309 ms to find 0 implicit places.
[2023-04-07 07:35:51] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:35:51] [INFO ] Invariant cache hit.
[2023-04-07 07:35:52] [INFO ] Dead Transitions using invariants and state equation in 1645 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 9012 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 151 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 294 ms.
Stack based approach found an accepted trace after 383 steps with 0 reset with depth 384 and stack size 384 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-06 finished in 9499 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 60 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 07:35:53] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:35:53] [INFO ] Invariant cache hit.
[2023-04-07 07:35:54] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-04-07 07:35:54] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:35:54] [INFO ] Invariant cache hit.
[2023-04-07 07:35:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:36:02] [INFO ] Implicit Places using invariants and state equation in 7873 ms returned []
Implicit Place search using SMT with State Equation took 8646 ms to find 0 implicit places.
[2023-04-07 07:36:02] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:36:02] [INFO ] Invariant cache hit.
[2023-04-07 07:36:03] [INFO ] Dead Transitions using invariants and state equation in 1815 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 10522 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 71 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 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-08 finished in 10615 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 07:36:03] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:36:03] [INFO ] Invariant cache hit.
[2023-04-07 07:36:04] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-04-07 07:36:04] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:36:04] [INFO ] Invariant cache hit.
[2023-04-07 07:36:05] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:36:11] [INFO ] Implicit Places using invariants and state equation in 6469 ms returned []
Implicit Place search using SMT with State Equation took 7141 ms to find 0 implicit places.
[2023-04-07 07:36:11] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 07:36:11] [INFO ] Invariant cache hit.
[2023-04-07 07:36:12] [INFO ] Dead Transitions using invariants and state equation in 1471 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 8655 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 157 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 8839 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 3 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 231 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 07:36:13] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:36:13] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 07:36:13] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-04-07 07:36:13] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:36:13] [INFO ] Invariant cache hit.
[2023-04-07 07:36:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:36:17] [INFO ] Implicit Places using invariants and state equation in 3499 ms returned []
Implicit Place search using SMT with State Equation took 4122 ms to find 0 implicit places.
[2023-04-07 07:36:17] [INFO ] Redundant transitions in 115 ms returned []
[2023-04-07 07:36:17] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:36:17] [INFO ] Invariant cache hit.
[2023-04-07 07:36:18] [INFO ] Dead Transitions using invariants and state equation in 1193 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 5697 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 39 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 283 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-10 finished in 6037 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 235 ms. Remains 593 /1004 variables (removed 411) and now considering 3893/4340 (removed 447) transitions.
[2023-04-07 07:36:19] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2023-04-07 07:36:19] [INFO ] Computed 31 invariants in 3 ms
[2023-04-07 07:36:19] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-04-07 07:36:19] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2023-04-07 07:36:19] [INFO ] Invariant cache hit.
[2023-04-07 07:36:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:36:23] [INFO ] Implicit Places using invariants and state equation in 3399 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
[2023-04-07 07:36:23] [INFO ] Redundant transitions in 115 ms returned []
[2023-04-07 07:36:23] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2023-04-07 07:36:23] [INFO ] Invariant cache hit.
[2023-04-07 07:36:24] [INFO ] Dead Transitions using invariants and state equation in 1215 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 5589 ms. Remains : 593/1004 places, 3893/4340 transitions.
Stuttering acceptance computed with spot in 127 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 290 ms.
Stack based approach found an accepted trace after 614 steps with 0 reset with depth 615 and stack size 553 in 3 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-11 finished in 6041 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 3 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 224 ms. Remains 591 /1004 variables (removed 413) and now considering 3900/4340 (removed 440) transitions.
[2023-04-07 07:36:25] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2023-04-07 07:36:25] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 07:36:25] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-04-07 07:36:25] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2023-04-07 07:36:25] [INFO ] Invariant cache hit.
[2023-04-07 07:36:26] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 07:36:29] [INFO ] Implicit Places using invariants and state equation in 3546 ms returned []
Implicit Place search using SMT with State Equation took 4174 ms to find 0 implicit places.
[2023-04-07 07:36:29] [INFO ] Redundant transitions in 116 ms returned []
[2023-04-07 07:36:29] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2023-04-07 07:36:29] [INFO ] Invariant cache hit.
[2023-04-07 07:36:30] [INFO ] Dead Transitions using invariants and state equation in 1294 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 5827 ms. Remains : 591/1004 places, 3900/4340 transitions.
Stuttering acceptance computed with spot in 28 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 279 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-12 finished in 6162 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 44 ms. Remains 1001 /1004 variables (removed 3) and now considering 4310/4340 (removed 30) transitions.
[2023-04-07 07:36:31] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2023-04-07 07:36:31] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 07:36:31] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-04-07 07:36:31] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2023-04-07 07:36:31] [INFO ] Invariant cache hit.
[2023-04-07 07:36:32] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 07:36:39] [INFO ] Implicit Places using invariants and state equation in 7596 ms returned []
Implicit Place search using SMT with State Equation took 8304 ms to find 0 implicit places.
[2023-04-07 07:36:39] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2023-04-07 07:36:39] [INFO ] Invariant cache hit.
[2023-04-07 07:36:40] [INFO ] Dead Transitions using invariants and state equation in 1415 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 9765 ms. Remains : 1001/1004 places, 4310/4340 transitions.
Stuttering acceptance computed with spot in 66 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 1037 ms.
Product exploration explored 100000 steps with 50000 reset in 981 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 112 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 12020 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 22 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 254 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 07:36:43] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:36:43] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 07:36:43] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-04-07 07:36:43] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:36:43] [INFO ] Invariant cache hit.
[2023-04-07 07:36:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:36:47] [INFO ] Implicit Places using invariants and state equation in 3277 ms returned []
Implicit Place search using SMT with State Equation took 3877 ms to find 0 implicit places.
[2023-04-07 07:36:47] [INFO ] Redundant transitions in 115 ms returned []
[2023-04-07 07:36:47] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:36:47] [INFO ] Invariant cache hit.
[2023-04-07 07:36:48] [INFO ] Dead Transitions using invariants and state equation in 1204 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 5469 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 118 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 264 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-15 finished in 5872 ms.
All properties solved by simple procedures.
Total runtime 168388 ms.
ITS solved all properties within timeout

BK_STOP 1680853010057

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r521-tall-167987246400276"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;