fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246400235
Last Updated
May 14, 2023

About the Execution of LTSMin+red for EisenbergMcGuire-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
670.451 69446.00 124358.00 452.50 TFTFFFFTFTFFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246400235.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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 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 460K 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-05-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680838084764

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 03:28:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:28:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:28:08] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-04-07 03:28:08] [INFO ] Transformed 295 places.
[2023-04-07 03:28:08] [INFO ] Transformed 800 transitions.
[2023-04-07 03:28:08] [INFO ] Found NUPN structural information;
[2023-04-07 03:28:08] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 278 transition count 715
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 278 transition count 715
Applied a total of 34 rules in 97 ms. Remains 278 /295 variables (removed 17) and now considering 715/800 (removed 85) transitions.
[2023-04-07 03:28:09] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
// Phase 1: matrix 380 rows 278 cols
[2023-04-07 03:28:09] [INFO ] Computed 16 invariants in 17 ms
[2023-04-07 03:28:10] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-04-07 03:28:10] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
[2023-04-07 03:28:10] [INFO ] Invariant cache hit.
[2023-04-07 03:28:10] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-04-07 03:28:11] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2023-04-07 03:28:11] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
[2023-04-07 03:28:11] [INFO ] Invariant cache hit.
[2023-04-07 03:28:11] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/295 places, 715/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2766 ms. Remains : 278/295 places, 715/800 transitions.
Support contains 37 out of 278 places after structural reductions.
[2023-04-07 03:28:12] [INFO ] Flatten gal took : 125 ms
[2023-04-07 03:28:12] [INFO ] Flatten gal took : 40 ms
[2023-04-07 03:28:12] [INFO ] Input system was already deterministic with 715 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=13 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-04-07 03:28:13] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
[2023-04-07 03:28:13] [INFO ] Invariant cache hit.
[2023-04-07 03:28:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:28:14] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:28:14] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-07 03:28:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 83 ms returned sat
[2023-04-07 03:28:15] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 49 ms returned sat
[2023-04-07 03:28:18] [INFO ] After 2492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-04-07 03:28:18] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-04-07 03:28:18] [INFO ] After 250ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-04-07 03:28:18] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 7 ms to minimize.
[2023-04-07 03:28:19] [INFO ] Deduced a trap composed of 55 places in 434 ms of which 17 ms to minimize.
[2023-04-07 03:28:19] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 2 ms to minimize.
[2023-04-07 03:28:19] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 1 ms to minimize.
[2023-04-07 03:28:19] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 1 ms to minimize.
[2023-04-07 03:28:20] [INFO ] Deduced a trap composed of 3 places in 914 ms of which 1 ms to minimize.
[2023-04-07 03:28:21] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2023-04-07 03:28:21] [INFO ] Deduced a trap composed of 73 places in 197 ms of which 1 ms to minimize.
[2023-04-07 03:28:21] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 1 ms to minimize.
[2023-04-07 03:28:21] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2023-04-07 03:28:22] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2023-04-07 03:28:22] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2023-04-07 03:28:22] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2023-04-07 03:28:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3960 ms
[2023-04-07 03:28:22] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 0 ms to minimize.
[2023-04-07 03:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-04-07 03:28:23] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 03:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-07 03:28:23] [INFO ] After 5282ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-04-07 03:28:23] [INFO ] After 9368ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 17 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 715/715 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 710
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 10 place count 273 transition count 639
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 152 place count 202 transition count 639
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 199 transition count 624
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 199 transition count 624
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 196 place count 180 transition count 605
Applied a total of 196 rules in 146 ms. Remains 180 /278 variables (removed 98) and now considering 605/715 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 180/278 places, 605/715 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 554742 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 554742 steps, saw 113865 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :8
Running SMT prover for 2 properties.
[2023-04-07 03:28:27] [INFO ] Flow matrix only has 270 transitions (discarded 335 similar events)
// Phase 1: matrix 270 rows 180 cols
[2023-04-07 03:28:27] [INFO ] Computed 16 invariants in 6 ms
[2023-04-07 03:28:27] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:28:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:28:27] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-07 03:28:27] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:28:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:27] [INFO ] After 49ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:28:27] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 03:28:28] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-07 03:28:28] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-07 03:28:28] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-04-07 03:28:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-04-07 03:28:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 530 ms
[2023-04-07 03:28:28] [INFO ] After 605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 03:28:28] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 605/605 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 180 transition count 597
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 172 transition count 597
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 171 transition count 596
Applied a total of 18 rules in 67 ms. Remains 171 /180 variables (removed 9) and now considering 596/605 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 171/180 places, 596/605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 494796 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494796 steps, saw 100183 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:28:31] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-07 03:28:31] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 03:28:31] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:28:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:28:31] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-07 03:28:31] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:28:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:31] [INFO ] After 43ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:28:32] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 03:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-07 03:28:32] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-07 03:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-07 03:28:32] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 03:28:32] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 26 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 14 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-04-07 03:28:32] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:28:32] [INFO ] Invariant cache hit.
[2023-04-07 03:28:34] [INFO ] Implicit Places using invariants in 2493 ms returned []
[2023-04-07 03:28:34] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:28:34] [INFO ] Invariant cache hit.
[2023-04-07 03:28:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:35] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 3162 ms to find 0 implicit places.
[2023-04-07 03:28:35] [INFO ] Redundant transitions in 59 ms returned []
[2023-04-07 03:28:35] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:28:35] [INFO ] Invariant cache hit.
[2023-04-07 03:28:36] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3836 ms. Remains : 171/171 places, 596/596 transitions.
Graph (trivial) has 521 edges and 171 vertex of which 25 / 171 are part of one of the 5 SCC in 3 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 151 transition count 168
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 118 transition count 168
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 118 transition count 157
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 102 transition count 157
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 170 place count 64 transition count 119
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 188 place count 64 transition count 101
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 208 place count 54 transition count 168
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 213 place count 54 transition count 163
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 54 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 54 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 52 transition count 155
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 245 place count 52 transition count 155
Applied a total of 245 rules in 56 ms. Remains 52 /171 variables (removed 119) and now considering 155/596 (removed 441) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 155 rows 52 cols
[2023-04-07 03:28:36] [INFO ] Computed 11 invariants in 0 ms
[2023-04-07 03:28:36] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:28:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-07 03:28:36] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:28:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:28:36] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:28:36] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 03:28:36] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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' '!(X(((p1 U G(!p1))&&(F(p3)||p2)&&p0)))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 276 transition count 705
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 276 transition count 705
Applied a total of 4 rules in 16 ms. Remains 276 /278 variables (removed 2) and now considering 705/715 (removed 10) transitions.
[2023-04-07 03:28:37] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-07 03:28:37] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 03:28:37] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-04-07 03:28:37] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-07 03:28:37] [INFO ] Invariant cache hit.
[2023-04-07 03:28:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-07 03:28:38] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2023-04-07 03:28:38] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-07 03:28:38] [INFO ] Invariant cache hit.
[2023-04-07 03:28:39] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/278 places, 705/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1608 ms. Remains : 276/278 places, 705/715 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 1108 ms :[(OR (NOT p0) p1 (AND (NOT p2) (NOT p3))), (OR (NOT p0) p1 (AND (NOT p2) (NOT p3))), true, p1, p1, (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s60 0) (EQ s243 1)), p1:(OR (EQ s172 0) (EQ s50 1)), p2:(OR (EQ s243 0) (EQ s60 1)), p3:(OR (EQ s172 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, 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-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-01 finished in 2883 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(X(G(p0))))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 18 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-07 03:28:40] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-07 03:28:40] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 03:28:47] [INFO ] Implicit Places using invariants in 7547 ms returned []
[2023-04-07 03:28:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:47] [INFO ] Invariant cache hit.
[2023-04-07 03:28:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:48] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 8515 ms to find 0 implicit places.
[2023-04-07 03:28:48] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:48] [INFO ] Invariant cache hit.
[2023-04-07 03:28:49] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9053 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s222 0) (EQ s257 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-04 finished in 9339 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 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 8 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-07 03:28:49] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:49] [INFO ] Invariant cache hit.
[2023-04-07 03:28:49] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-04-07 03:28:49] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:49] [INFO ] Invariant cache hit.
[2023-04-07 03:28:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:50] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
[2023-04-07 03:28:50] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:51] [INFO ] Invariant cache hit.
[2023-04-07 03:28:52] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3454 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-05 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 (NEQ s15 0) (NEQ s129 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 135 steps with 0 reset in 9 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-05 finished in 3679 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(X(F(p1))))))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 5 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-07 03:28:53] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:53] [INFO ] Invariant cache hit.
[2023-04-07 03:28:53] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-04-07 03:28:53] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:53] [INFO ] Invariant cache hit.
[2023-04-07 03:28:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:54] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2023-04-07 03:28:54] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:54] [INFO ] Invariant cache hit.
[2023-04-07 03:28:55] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1922 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6 0), p1:(AND (EQ s166 0) (EQ s138 1) (EQ s39 0) (EQ s19 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-06 finished in 2806 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((X(p1)||p0))))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 24 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-07 03:28:56] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:56] [INFO ] Invariant cache hit.
[2023-04-07 03:28:56] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 03:28:56] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:56] [INFO ] Invariant cache hit.
[2023-04-07 03:28:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:28:57] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2023-04-07 03:28:57] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:57] [INFO ] Invariant cache hit.
[2023-04-07 03:28:57] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1795 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s49 1)), p1:(OR (EQ s42 0) (EQ s49 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 550 ms.
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-07 finished in 3390 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 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 10 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-07 03:28:59] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:59] [INFO ] Invariant cache hit.
[2023-04-07 03:28:59] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-04-07 03:28:59] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:28:59] [INFO ] Invariant cache hit.
[2023-04-07 03:28:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:29:00] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-04-07 03:29:00] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:29:00] [INFO ] Invariant cache hit.
[2023-04-07 03:29:01] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1743 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-09 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 s243 0) (EQ s178 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 687 ms.
Product exploration explored 100000 steps with 50000 reset in 632 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 24 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-05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-09 finished in 3414 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(G((((F(p1) U p2)||p0)&&(G(!p3) U p2)))))'
Support contains 6 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 710
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 10 place count 273 transition count 635
Deduced a syphon composed of 75 places in 12 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 160 place count 198 transition count 635
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 195 transition count 620
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 195 transition count 620
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 204 place count 176 transition count 601
Applied a total of 204 rules in 52 ms. Remains 176 /278 variables (removed 102) and now considering 601/715 (removed 114) transitions.
[2023-04-07 03:29:02] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 176 cols
[2023-04-07 03:29:02] [INFO ] Computed 16 invariants in 12 ms
[2023-04-07 03:29:03] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-04-07 03:29:03] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-07 03:29:03] [INFO ] Invariant cache hit.
[2023-04-07 03:29:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:29:03] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2023-04-07 03:29:03] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-07 03:29:03] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-07 03:29:03] [INFO ] Invariant cache hit.
[2023-04-07 03:29:04] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/278 places, 601/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1532 ms. Remains : 176/278 places, 601/715 transitions.
Stuttering acceptance computed with spot in 851 ms :[(NOT p2), (AND (NOT p2) p3), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={1} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND p2 p3 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s56 0) (EQ s85 1)), p3:(OR (EQ s60 0) (EQ s119 1)), p0:(OR (EQ s60 0) (EQ s119 1)), p1:(OR (EQ s55 0) (EQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Stack based approach found an accepted trace after 287 steps with 0 reset with depth 288 and stack size 235 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-10 finished in 2680 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((X(F(p0))||(G(p2)&&p1))))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 6 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-07 03:29:05] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-07 03:29:05] [INFO ] Computed 16 invariants in 5 ms
[2023-04-07 03:29:05] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-04-07 03:29:05] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:29:05] [INFO ] Invariant cache hit.
[2023-04-07 03:29:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:29:06] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2023-04-07 03:29:06] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-07 03:29:06] [INFO ] Invariant cache hit.
[2023-04-07 03:29:07] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1831 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s137 0) (EQ s231 1)), p2:(AND (EQ s137 0) (EQ s231 1)), p0:(OR (EQ s11 1) (EQ s114 0) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-12 finished in 3144 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(G(p0)))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 710
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 273 transition count 632
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 195 transition count 632
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 193 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 193 transition count 622
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 208 place count 174 transition count 603
Applied a total of 208 rules in 49 ms. Remains 174 /278 variables (removed 104) and now considering 603/715 (removed 112) transitions.
[2023-04-07 03:29:08] [INFO ] Flow matrix only has 268 transitions (discarded 335 similar events)
// Phase 1: matrix 268 rows 174 cols
[2023-04-07 03:29:08] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 03:29:08] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-04-07 03:29:08] [INFO ] Flow matrix only has 268 transitions (discarded 335 similar events)
[2023-04-07 03:29:08] [INFO ] Invariant cache hit.
[2023-04-07 03:29:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-07 03:29:09] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-04-07 03:29:09] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-07 03:29:09] [INFO ] Flow matrix only has 268 transitions (discarded 335 similar events)
[2023-04-07 03:29:09] [INFO ] Invariant cache hit.
[2023-04-07 03:29:10] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/278 places, 603/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1492 ms. Remains : 174/278 places, 603/715 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s57 1) (OR (EQ s45 0) (EQ s56 1)) (OR (EQ s45 0) (EQ s133 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 202 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-14 finished in 1826 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((G((F(p0) U p1)) U p1))))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 276 transition count 705
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 276 transition count 705
Applied a total of 4 rules in 7 ms. Remains 276 /278 variables (removed 2) and now considering 705/715 (removed 10) transitions.
[2023-04-07 03:29:10] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-07 03:29:10] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 03:29:10] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 03:29:10] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-07 03:29:10] [INFO ] Invariant cache hit.
[2023-04-07 03:29:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-07 03:29:11] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2023-04-07 03:29:11] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-07 03:29:11] [INFO ] Invariant cache hit.
[2023-04-07 03:29:12] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/278 places, 705/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 276/278 places, 705/715 transitions.
Stuttering acceptance computed with spot in 592 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s75 0) (EQ s41 1)), p0:(OR (EQ s58 0) (EQ s98 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2736 reset in 233 ms.
Stack based approach found an accepted trace after 773 steps with 24 reset with depth 19 and stack size 19 in 2 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-15 finished in 2623 ms.
All properties solved by simple procedures.
Total runtime 64841 ms.
ITS solved all properties within timeout

BK_STOP 1680838154210

--------------------
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 LTLCardinality -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-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;