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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 115K Mar 5 18:22 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 DES-PT-40b-LTLCardinality-00
FORMULA_NAME DES-PT-40b-LTLCardinality-01
FORMULA_NAME DES-PT-40b-LTLCardinality-02
FORMULA_NAME DES-PT-40b-LTLCardinality-03
FORMULA_NAME DES-PT-40b-LTLCardinality-04
FORMULA_NAME DES-PT-40b-LTLCardinality-05
FORMULA_NAME DES-PT-40b-LTLCardinality-06
FORMULA_NAME DES-PT-40b-LTLCardinality-07
FORMULA_NAME DES-PT-40b-LTLCardinality-08
FORMULA_NAME DES-PT-40b-LTLCardinality-09
FORMULA_NAME DES-PT-40b-LTLCardinality-10
FORMULA_NAME DES-PT-40b-LTLCardinality-11
FORMULA_NAME DES-PT-40b-LTLCardinality-12
FORMULA_NAME DES-PT-40b-LTLCardinality-13
FORMULA_NAME DES-PT-40b-LTLCardinality-14
FORMULA_NAME DES-PT-40b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678253281846

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:28:03] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-08 05:28:03] [INFO ] Transformed 439 places.
[2023-03-08 05:28:03] [INFO ] Transformed 390 transitions.
[2023-03-08 05:28:03] [INFO ] Found NUPN structural information;
[2023-03-08 05:28:03] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-40b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 414 transition count 368
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 414 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 400 transition count 354
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 400 transition count 354
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 85 place count 400 transition count 344
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 399 transition count 343
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 399 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 399 transition count 342
Applied a total of 88 rules in 107 ms. Remains 399 /439 variables (removed 40) and now considering 342/390 (removed 48) transitions.
// Phase 1: matrix 342 rows 399 cols
[2023-03-08 05:28:03] [INFO ] Computed 62 place invariants in 38 ms
[2023-03-08 05:28:04] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-08 05:28:04] [INFO ] Invariant cache hit.
[2023-03-08 05:28:04] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-08 05:28:04] [INFO ] Invariant cache hit.
[2023-03-08 05:28:04] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 399/439 places, 342/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1292 ms. Remains : 399/439 places, 342/390 transitions.
Support contains 25 out of 399 places after structural reductions.
[2023-03-08 05:28:04] [INFO ] Flatten gal took : 50 ms
[2023-03-08 05:28:05] [INFO ] Flatten gal took : 23 ms
[2023-03-08 05:28:05] [INFO ] Input system was already deterministic with 342 transitions.
Support contains 21 out of 399 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:28:05] [INFO ] Invariant cache hit.
[2023-03-08 05:28:05] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 05:28:05] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-08 05:28:05] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:28:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 05:28:05] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 20 ms returned sat
[2023-03-08 05:28:06] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:28:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 740 ms
[2023-03-08 05:28:06] [INFO ] After 1124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-08 05:28:07] [INFO ] After 1373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 331 ms.
Support contains 7 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 342/342 transitions.
Graph (complete) has 900 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 393 transition count 320
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 376 transition count 320
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 376 transition count 310
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 366 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 364 transition count 308
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 364 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 364 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 364 transition count 306
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 363 transition count 306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 362 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 362 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 362 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 362 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 361 transition count 303
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 219 place count 286 transition count 228
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 227 place count 282 transition count 237
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 282 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 281 transition count 236
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 281 transition count 236
Applied a total of 230 rules in 116 ms. Remains 281 /399 variables (removed 118) and now considering 236/342 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 281/399 places, 236/342 transitions.
Incomplete random walk after 10000 steps, including 409 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1025545 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1025545 steps, saw 142399 distinct states, run finished after 3002 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 236 rows 281 cols
[2023-03-08 05:28:10] [INFO ] Computed 61 place invariants in 20 ms
[2023-03-08 05:28:10] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 05:28:10] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 05:28:11] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:28:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 05:28:11] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-08 05:28:11] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:28:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-08 05:28:11] [INFO ] After 134ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:28:11] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-08 05:28:11] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 95 ms.
Support contains 7 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 236/236 transitions.
Applied a total of 0 rules in 13 ms. Remains 281 /281 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 281/281 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 236/236 transitions.
Applied a total of 0 rules in 13 ms. Remains 281 /281 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-08 05:28:11] [INFO ] Invariant cache hit.
[2023-03-08 05:28:12] [INFO ] Implicit Places using invariants in 166 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 280/281 places, 236/236 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 195 ms. Remains : 280/281 places, 236/236 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1078565 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1078565 steps, saw 149411 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 236 rows 280 cols
[2023-03-08 05:28:15] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:28:15] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:28:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:28:15] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:28:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:28:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-08 05:28:16] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:28:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-08 05:28:16] [INFO ] After 75ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:28:16] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-08 05:28:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-08 05:28:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-08 05:28:16] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 05:28:16] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 99 ms.
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 236/236 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 280/280 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 236/236 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-08 05:28:16] [INFO ] Invariant cache hit.
[2023-03-08 05:28:16] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:28:16] [INFO ] Invariant cache hit.
[2023-03-08 05:28:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-08 05:28:17] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-08 05:28:17] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 05:28:17] [INFO ] Invariant cache hit.
[2023-03-08 05:28:17] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 280/280 places, 236/236 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 280 transition count 236
Applied a total of 1 rules in 17 ms. Remains 280 /280 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 236 rows 280 cols
[2023-03-08 05:28:17] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:28:17] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:28:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 05:28:17] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:28:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-08 05:28:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-08 05:28:18] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:28:18] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-08 05:28:18] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 900 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Graph (complete) has 900 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 393 transition count 324
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 378 transition count 324
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 378 transition count 314
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 368 transition count 314
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 366 transition count 312
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 366 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 366 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 366 transition count 310
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 365 transition count 310
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 364 transition count 309
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 364 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 364 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 364 transition count 307
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 363 transition count 307
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 217 place count 286 transition count 230
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 282 transition count 239
Applied a total of 225 rules in 64 ms. Remains 282 /399 variables (removed 117) and now considering 239/342 (removed 103) transitions.
// Phase 1: matrix 239 rows 282 cols
[2023-03-08 05:28:18] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:28:18] [INFO ] Implicit Places using invariants in 149 ms returned [174]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/399 places, 239/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 281/399 places, 239/342 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-02 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 s160 0) (EQ s122 1) (OR (EQ s172 0) (EQ s146 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 2 ms.
FORMULA DES-PT-40b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-02 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1&&F(G(p1)))))))'
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 395 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 395 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 395 transition count 337
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 393 transition count 335
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 393 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 393 transition count 333
Applied a total of 15 rules in 29 ms. Remains 393 /399 variables (removed 6) and now considering 333/342 (removed 9) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:28:18] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:28:19] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 05:28:19] [INFO ] Invariant cache hit.
[2023-03-08 05:28:19] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-08 05:28:19] [INFO ] Invariant cache hit.
[2023-03-08 05:28:19] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/399 places, 333/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 393/399 places, 333/342 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s323 0) (EQ s284 1)), p1:(OR (EQ s322 0) (EQ s388 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 895 reset in 307 ms.
Product exploration explored 100000 steps with 867 reset in 220 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Finished random walk after 3627 steps, including 35 resets, run visited all 1 properties in 13 ms. (steps per millisecond=279 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Support contains 2 out of 393 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 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 386 transition count 316
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 373 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 372 transition count 315
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 29 place count 372 transition count 302
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 55 place count 359 transition count 302
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 201 place count 286 transition count 229
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 284 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 282 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 281 transition count 229
Applied a total of 208 rules in 44 ms. Remains 281 /393 variables (removed 112) and now considering 229/333 (removed 104) transitions.
// Phase 1: matrix 229 rows 281 cols
[2023-03-08 05:28:21] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:28:21] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-08 05:28:21] [INFO ] Invariant cache hit.
[2023-03-08 05:28:21] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-08 05:28:21] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 05:28:21] [INFO ] Invariant cache hit.
[2023-03-08 05:28:22] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/393 places, 229/333 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 281/393 places, 229/333 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 530 steps, including 24 resets, run visited all 1 properties in 6 ms. (steps per millisecond=88 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4468 reset in 211 ms.
Product exploration explored 100000 steps with 4453 reset in 227 ms.
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 278 transition count 226
Applied a total of 4 rules in 10 ms. Remains 278 /281 variables (removed 3) and now considering 226/229 (removed 3) transitions.
// Phase 1: matrix 226 rows 278 cols
[2023-03-08 05:28:22] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:28:23] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-08 05:28:23] [INFO ] Invariant cache hit.
[2023-03-08 05:28:23] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 05:28:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:28:23] [INFO ] Invariant cache hit.
[2023-03-08 05:28:23] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/281 places, 226/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 570 ms. Remains : 278/281 places, 226/229 transitions.
Treatment of property DES-PT-40b-LTLCardinality-03 finished in 4681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(G(p1)||G(p2)))))'
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 395 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 395 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 395 transition count 337
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 393 transition count 335
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 393 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 393 transition count 333
Applied a total of 15 rules in 19 ms. Remains 393 /399 variables (removed 6) and now considering 333/342 (removed 9) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:28:23] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-08 05:28:23] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 05:28:23] [INFO ] Invariant cache hit.
[2023-03-08 05:28:24] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2023-03-08 05:28:24] [INFO ] Invariant cache hit.
[2023-03-08 05:28:24] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/399 places, 333/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 393/399 places, 333/342 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s202 0), p2:(OR (EQ s375 0) (EQ s13 1)), p0:(EQ s202 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-04 finished in 1023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 396 transition count 339
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 396 transition count 339
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 394 transition count 337
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 394 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 394 transition count 335
Applied a total of 12 rules in 24 ms. Remains 394 /399 variables (removed 5) and now considering 335/342 (removed 7) transitions.
// Phase 1: matrix 335 rows 394 cols
[2023-03-08 05:28:24] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 05:28:24] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 05:28:24] [INFO ] Invariant cache hit.
[2023-03-08 05:28:25] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2023-03-08 05:28:25] [INFO ] Invariant cache hit.
[2023-03-08 05:28:25] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 394/399 places, 335/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 788 ms. Remains : 394/399 places, 335/342 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-05 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:(OR (EQ s331 0) (EQ s235 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 257 steps with 1 reset in 2 ms.
FORMULA DES-PT-40b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-05 finished in 928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 399 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Graph (complete) has 900 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 392 transition count 323
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 377 transition count 323
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 377 transition count 313
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 367 transition count 313
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 364 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 364 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 364 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 364 transition count 308
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 363 transition count 308
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 361 transition count 306
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 361 transition count 306
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 361 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 361 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 359 transition count 302
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 224 place count 282 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 228 place count 280 transition count 227
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 278 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 277 transition count 225
Applied a total of 231 rules in 84 ms. Remains 277 /399 variables (removed 122) and now considering 225/342 (removed 117) transitions.
// Phase 1: matrix 225 rows 277 cols
[2023-03-08 05:28:25] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 05:28:25] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 05:28:25] [INFO ] Invariant cache hit.
[2023-03-08 05:28:25] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-08 05:28:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:28:26] [INFO ] Invariant cache hit.
[2023-03-08 05:28:26] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/399 places, 225/342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 277/399 places, 225/342 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s138 0) (EQ s116 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 5427 reset in 200 ms.
Product exploration explored 100000 steps with 5415 reset in 225 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/277 stabilizing places and 169/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 534 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1704229 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :{}
Probabilistic random walk after 1704229 steps, saw 236007 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:28:29] [INFO ] Invariant cache hit.
[2023-03-08 05:28:29] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:28:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:28:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 05:28:30] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:28:30] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 05:28:30] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 225/225 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 276 transition count 223
Applied a total of 4 rules in 17 ms. Remains 276 /277 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 276/277 places, 223/225 transitions.
Incomplete random walk after 10000 steps, including 531 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1708344 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :{}
Probabilistic random walk after 1708344 steps, saw 236424 distinct states, run finished after 3001 ms. (steps per millisecond=569 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2023-03-08 05:28:33] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 05:28:33] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:28:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:28:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 98 ms returned sat
[2023-03-08 05:28:33] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:28:33] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 05:28:33] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 276/276 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-08 05:28:33] [INFO ] Invariant cache hit.
[2023-03-08 05:28:33] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:28:33] [INFO ] Invariant cache hit.
[2023-03-08 05:28:33] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 05:28:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:28:33] [INFO ] Invariant cache hit.
[2023-03-08 05:28:34] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 276/276 places, 223/223 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 223
Applied a total of 1 rules in 16 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2023-03-08 05:28:34] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 05:28:34] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:28:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:28:34] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-08 05:28:34] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:28:34] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 05:28:34] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 225/225 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 277 cols
[2023-03-08 05:28:34] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:28:34] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 05:28:34] [INFO ] Invariant cache hit.
[2023-03-08 05:28:35] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-08 05:28:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:28:35] [INFO ] Invariant cache hit.
[2023-03-08 05:28:35] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 546 ms. Remains : 277/277 places, 225/225 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/277 stabilizing places and 169/225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 553 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1696734 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :{}
Probabilistic random walk after 1696734 steps, saw 235116 distinct states, run finished after 3001 ms. (steps per millisecond=565 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:28:38] [INFO ] Invariant cache hit.
[2023-03-08 05:28:38] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:28:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:28:38] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 69 ms returned sat
[2023-03-08 05:28:38] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:28:38] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 05:28:38] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 225/225 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 276 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 276 transition count 223
Applied a total of 4 rules in 17 ms. Remains 276 /277 variables (removed 1) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 276/277 places, 223/225 transitions.
Incomplete random walk after 10000 steps, including 527 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1708193 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :{}
Probabilistic random walk after 1708193 steps, saw 236406 distinct states, run finished after 3001 ms. (steps per millisecond=569 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2023-03-08 05:28:41] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 05:28:41] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:28:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:28:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-08 05:28:42] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:28:42] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 05:28:42] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 276/276 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-08 05:28:42] [INFO ] Invariant cache hit.
[2023-03-08 05:28:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 05:28:42] [INFO ] Invariant cache hit.
[2023-03-08 05:28:42] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 05:28:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:28:42] [INFO ] Invariant cache hit.
[2023-03-08 05:28:42] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 276/276 places, 223/223 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 223
Applied a total of 1 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 276 cols
[2023-03-08 05:28:42] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:28:42] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:28:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:28:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-08 05:28:43] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:28:43] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:28:43] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5455 reset in 199 ms.
Product exploration explored 100000 steps with 5458 reset in 230 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 277 /277 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 277 cols
[2023-03-08 05:28:43] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:28:43] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 05:28:43] [INFO ] Invariant cache hit.
[2023-03-08 05:28:44] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-08 05:28:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:28:44] [INFO ] Invariant cache hit.
[2023-03-08 05:28:44] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 277/277 places, 225/225 transitions.
Treatment of property DES-PT-40b-LTLCardinality-09 finished in 18865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&X(F(p0)))))'
Support contains 2 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 395 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 395 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 395 transition count 337
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 393 transition count 335
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 393 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 393 transition count 333
Applied a total of 15 rules in 16 ms. Remains 393 /399 variables (removed 6) and now considering 333/342 (removed 9) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:28:44] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 05:28:44] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-08 05:28:44] [INFO ] Invariant cache hit.
[2023-03-08 05:28:44] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-08 05:28:44] [INFO ] Invariant cache hit.
[2023-03-08 05:28:45] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/399 places, 333/342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 393/399 places, 333/342 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, 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={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s165 1), p0:(EQ s105 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-10 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 399/399 places, 342/342 transitions.
Graph (complete) has 900 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 392 transition count 324
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 378 transition count 324
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 378 transition count 314
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 368 transition count 314
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 366 transition count 312
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 366 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 366 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 366 transition count 310
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 365 transition count 310
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 364 transition count 309
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 364 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 364 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 364 transition count 307
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 363 transition count 307
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 207 place count 290 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 213 place count 287 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 285 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 216 place count 284 transition count 235
Applied a total of 216 rules in 50 ms. Remains 284 /399 variables (removed 115) and now considering 235/342 (removed 107) transitions.
// Phase 1: matrix 235 rows 284 cols
[2023-03-08 05:28:45] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 05:28:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 05:28:45] [INFO ] Invariant cache hit.
[2023-03-08 05:28:45] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-08 05:28:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:28:45] [INFO ] Invariant cache hit.
[2023-03-08 05:28:45] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/399 places, 235/342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 571 ms. Remains : 284/399 places, 235/342 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s160 0) (EQ s221 1)), p0:(AND (NEQ s203 0) (NEQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 78 steps with 10 reset in 1 ms.
FORMULA DES-PT-40b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLCardinality-11 finished in 748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1&&F(G(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-08 05:28:46] [INFO ] Flatten gal took : 19 ms
[2023-03-08 05:28:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 05:28:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 399 places, 342 transitions and 1181 arcs took 4 ms.
Total runtime 43081 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA DES-PT-40b-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678253392390

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-40b-LTLCardinality-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DES-PT-40b-LTLCardinality-09
lola: result : false
lola: markings : 200419
lola: fired transitions : 225076
lola: time used : 0.000000
lola: memory pages used : 2
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-40b-LTLCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 DES-PT-40b-LTLCardinality-03 375577 m, 75115 m/sec, 2015320 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 6/32 DES-PT-40b-LTLCardinality-03 755062 m, 75897 m/sec, 4267108 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 9/32 DES-PT-40b-LTLCardinality-03 1099837 m, 68955 m/sec, 6518334 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 11/32 DES-PT-40b-LTLCardinality-03 1447490 m, 69530 m/sec, 8772031 t fired, .

Time elapsed: 20 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 14/32 DES-PT-40b-LTLCardinality-03 1791136 m, 68729 m/sec, 11027433 t fired, .

Time elapsed: 25 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 16/32 DES-PT-40b-LTLCardinality-03 2176210 m, 77014 m/sec, 13313853 t fired, .

Time elapsed: 30 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 19/32 DES-PT-40b-LTLCardinality-03 2502672 m, 65292 m/sec, 15532046 t fired, .

Time elapsed: 35 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 21/32 DES-PT-40b-LTLCardinality-03 2825397 m, 64545 m/sec, 17743472 t fired, .

Time elapsed: 40 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 23/32 DES-PT-40b-LTLCardinality-03 3136652 m, 62251 m/sec, 19938300 t fired, .

Time elapsed: 45 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 26/32 DES-PT-40b-LTLCardinality-03 3519842 m, 76638 m/sec, 22156884 t fired, .

Time elapsed: 50 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 29/32 DES-PT-40b-LTLCardinality-03 3846046 m, 65240 m/sec, 24359496 t fired, .

Time elapsed: 55 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 31/32 DES-PT-40b-LTLCardinality-03 4184158 m, 67622 m/sec, 26577175 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for DES-PT-40b-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40b-LTLCardinality-03: LTL unknown AGGR
DES-PT-40b-LTLCardinality-09: LTL false LTL model checker


Time elapsed: 65 secs. Pages in use: 32

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-40b, 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 r103-tall-167814478300467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;