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-167814478400499.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-60b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478400499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.6K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:43 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.0K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:44 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 139K 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-60b-LTLCardinality-00
FORMULA_NAME DES-PT-60b-LTLCardinality-01
FORMULA_NAME DES-PT-60b-LTLCardinality-02
FORMULA_NAME DES-PT-60b-LTLCardinality-03
FORMULA_NAME DES-PT-60b-LTLCardinality-04
FORMULA_NAME DES-PT-60b-LTLCardinality-05
FORMULA_NAME DES-PT-60b-LTLCardinality-06
FORMULA_NAME DES-PT-60b-LTLCardinality-07
FORMULA_NAME DES-PT-60b-LTLCardinality-08
FORMULA_NAME DES-PT-60b-LTLCardinality-09
FORMULA_NAME DES-PT-60b-LTLCardinality-10
FORMULA_NAME DES-PT-60b-LTLCardinality-11
FORMULA_NAME DES-PT-60b-LTLCardinality-12
FORMULA_NAME DES-PT-60b-LTLCardinality-13
FORMULA_NAME DES-PT-60b-LTLCardinality-14
FORMULA_NAME DES-PT-60b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678255512023

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-60b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 06:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 06:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:05:13] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-08 06:05:13] [INFO ] Transformed 519 places.
[2023-03-08 06:05:13] [INFO ] Transformed 470 transitions.
[2023-03-08 06:05:13] [INFO ] Found NUPN structural information;
[2023-03-08 06:05:13] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 131 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 2 formulas.
FORMULA DES-PT-60b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 479 transition count 433
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 479 transition count 433
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 87 place count 479 transition count 423
Applied a total of 87 rules in 111 ms. Remains 479 /519 variables (removed 40) and now considering 423/470 (removed 47) transitions.
// Phase 1: matrix 423 rows 479 cols
[2023-03-08 06:05:14] [INFO ] Computed 62 place invariants in 54 ms
[2023-03-08 06:05:14] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-08 06:05:14] [INFO ] Invariant cache hit.
[2023-03-08 06:05:14] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2023-03-08 06:05:14] [INFO ] Invariant cache hit.
[2023-03-08 06:05:15] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 479/519 places, 423/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1511 ms. Remains : 479/519 places, 423/470 transitions.
Support contains 26 out of 479 places after structural reductions.
[2023-03-08 06:05:15] [INFO ] Flatten gal took : 65 ms
[2023-03-08 06:05:15] [INFO ] Flatten gal took : 31 ms
[2023-03-08 06:05:15] [INFO ] Input system was already deterministic with 423 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 06:05:16] [INFO ] Invariant cache hit.
[2023-03-08 06:05:16] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 06:05:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 06:05:16] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 34 ms returned sat
[2023-03-08 06:05:17] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 06:05:17] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 8 ms to minimize.
[2023-03-08 06:05:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-08 06:05:17] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 3 ms to minimize.
[2023-03-08 06:05:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
[2023-03-08 06:05:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 290 ms
[2023-03-08 06:05:17] [INFO ] After 1107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-08 06:05:17] [INFO ] After 1511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 484 ms.
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 473 transition count 405
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 30 place count 460 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 459 transition count 404
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 31 place count 459 transition count 392
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 55 place count 447 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 444 transition count 389
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 444 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 444 transition count 386
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 443 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 66 place count 443 transition count 384
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 442 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 441 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 441 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 71 place count 441 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 71 place count 441 transition count 381
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 73 place count 440 transition count 381
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 225 place count 364 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 231 place count 361 transition count 313
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 361 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 360 transition count 312
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 360 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 359 transition count 311
Applied a total of 235 rules in 217 ms. Remains 359 /479 variables (removed 120) and now considering 311/423 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 359/479 places, 311/423 transitions.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 755058 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 755058 steps, saw 106270 distinct states, run finished after 3003 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 359 cols
[2023-03-08 06:05:21] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-08 06:05:21] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 06:05:21] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 06:05:21] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 06:05:22] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 06:05:22] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 123 ms returned sat
[2023-03-08 06:05:22] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 06:05:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:22] [INFO ] After 130ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 06:05:22] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-08 06:05:22] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 185 ms.
Support contains 5 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 311/311 transitions.
Applied a total of 0 rules in 16 ms. Remains 359 /359 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 359/359 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 311/311 transitions.
Applied a total of 0 rules in 17 ms. Remains 359 /359 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2023-03-08 06:05:23] [INFO ] Invariant cache hit.
[2023-03-08 06:05:23] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 06:05:23] [INFO ] Invariant cache hit.
[2023-03-08 06:05:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:23] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-08 06:05:23] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 06:05:23] [INFO ] Invariant cache hit.
[2023-03-08 06:05:23] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 898 ms. Remains : 359/359 places, 311/311 transitions.
Graph (complete) has 1250 edges and 359 vertex of which 358 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 358 transition count 311
Applied a total of 2 rules in 21 ms. Remains 358 /359 variables (removed 1) and now considering 311/311 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 311 rows 358 cols
[2023-03-08 06:05:24] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-08 06:05:24] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 06:05:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 06:05:24] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 06:05:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 06:05:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 162 ms returned sat
[2023-03-08 06:05:24] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 06:05:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-08 06:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-08 06:05:25] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-08 06:05:25] [INFO ] After 1020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-60b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 297 stabilizing places and 289 stable transitions
Graph (complete) has 1140 edges and 479 vertex of which 473 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' '!(G(F(p0)))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 472 transition count 407
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 460 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 459 transition count 406
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 27 place count 459 transition count 394
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 51 place count 447 transition count 394
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 444 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 444 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 444 transition count 388
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 443 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 62 place count 443 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 442 transition count 386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 441 transition count 385
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 441 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 441 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 67 place count 441 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 69 place count 440 transition count 383
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 221 place count 364 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 227 place count 361 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 359 transition count 313
Applied a total of 229 rules in 107 ms. Remains 359 /479 variables (removed 120) and now considering 313/423 (removed 110) transitions.
// Phase 1: matrix 313 rows 359 cols
[2023-03-08 06:05:25] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 06:05:25] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 06:05:25] [INFO ] Invariant cache hit.
[2023-03-08 06:05:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:26] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-08 06:05:26] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 06:05:26] [INFO ] Invariant cache hit.
[2023-03-08 06:05:26] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/479 places, 313/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1006 ms. Remains : 359/479 places, 313/423 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s316 0) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5561 reset in 638 ms.
Product exploration explored 100000 steps with 5517 reset in 299 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 22 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2023-03-08 06:05:28] [INFO ] Invariant cache hit.
[2023-03-08 06:05:28] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 06:05:28] [INFO ] Invariant cache hit.
[2023-03-08 06:05:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:28] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2023-03-08 06:05:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 06:05:28] [INFO ] Invariant cache hit.
[2023-03-08 06:05:28] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 359/359 places, 313/313 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1341 steps, including 78 resets, run visited all 1 properties in 6 ms. (steps per millisecond=223 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5467 reset in 230 ms.
Product exploration explored 100000 steps with 5600 reset in 285 ms.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 12 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2023-03-08 06:05:30] [INFO ] Invariant cache hit.
[2023-03-08 06:05:30] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 06:05:30] [INFO ] Invariant cache hit.
[2023-03-08 06:05:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:30] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-08 06:05:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 06:05:30] [INFO ] Invariant cache hit.
[2023-03-08 06:05:30] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 904 ms. Remains : 359/359 places, 313/313 transitions.
Treatment of property DES-PT-60b-LTLCardinality-03 finished in 5647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 476 transition count 420
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 476 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 476 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 475 transition count 417
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 475 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 475 transition count 416
Applied a total of 11 rules in 34 ms. Remains 475 /479 variables (removed 4) and now considering 416/423 (removed 7) transitions.
// Phase 1: matrix 416 rows 475 cols
[2023-03-08 06:05:31] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-08 06:05:31] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-08 06:05:31] [INFO ] Invariant cache hit.
[2023-03-08 06:05:31] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2023-03-08 06:05:31] [INFO ] Invariant cache hit.
[2023-03-08 06:05:32] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/479 places, 416/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1074 ms. Remains : 475/479 places, 416/423 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DES-PT-60b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s272 0) (EQ s416 1)), p0:(OR (AND (NEQ s272 0) (NEQ s416 1)) (EQ s272 0) (EQ s169 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 428 ms.
Product exploration explored 100000 steps with 33333 reset in 426 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1131 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60b-LTLCardinality-06 finished in 2444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 48 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 06:05:33] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-08 06:05:33] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-08 06:05:33] [INFO ] Invariant cache hit.
[2023-03-08 06:05:34] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2023-03-08 06:05:34] [INFO ] Invariant cache hit.
[2023-03-08 06:05:35] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1817 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-07 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(EQ s179 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-07 finished in 2045 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)||G((F(p1)&&F(G(p0))))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 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 472 transition count 406
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 459 transition count 406
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 459 transition count 395
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 448 transition count 395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 446 transition count 393
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 446 transition count 393
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 446 transition count 392
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 446 transition count 391
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 445 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 444 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 444 transition count 390
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 444 transition count 389
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 444 transition count 388
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 61 place count 443 transition count 388
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 215 place count 366 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 364 transition count 316
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 364 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 362 transition count 310
Applied a total of 225 rules in 83 ms. Remains 362 /479 variables (removed 117) and now considering 310/423 (removed 113) transitions.
// Phase 1: matrix 310 rows 362 cols
[2023-03-08 06:05:35] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 06:05:35] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 06:05:35] [INFO ] Invariant cache hit.
[2023-03-08 06:05:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:36] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-08 06:05:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 06:05:36] [INFO ] Invariant cache hit.
[2023-03-08 06:05:36] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/479 places, 310/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 960 ms. Remains : 362/479 places, 310/423 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s253 0) (EQ s247 1)), p1:(AND (EQ s247 0) (EQ s253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA DES-PT-60b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-08 finished in 1145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G((p1||X((G(!p2) U (p1&&G(!p2))))))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 31 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 06:05:36] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 06:05:36] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-08 06:05:36] [INFO ] Invariant cache hit.
[2023-03-08 06:05:37] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-03-08 06:05:37] [INFO ] Invariant cache hit.
[2023-03-08 06:05:37] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1062 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p1) p2), true, p2]
Running random walk in product with property : DES-PT-60b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s196 0) (EQ s406 1)), p1:(EQ s232 1), p2:(OR (EQ s439 0) (EQ s254 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 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-10 finished in 1365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 37 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
[2023-03-08 06:05:38] [INFO ] Invariant cache hit.
[2023-03-08 06:05:38] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-08 06:05:38] [INFO ] Invariant cache hit.
[2023-03-08 06:05:38] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-08 06:05:38] [INFO ] Invariant cache hit.
[2023-03-08 06:05:39] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1101 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s453 0) (EQ s329 1)), p1:(OR (EQ s444 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 624 steps with 5 reset in 6 ms.
FORMULA DES-PT-60b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-11 finished in 1271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p2)||G(p0)||p1)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Graph (complete) has 1140 edges and 479 vertex of which 473 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 472 transition count 407
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 460 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 459 transition count 406
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 27 place count 459 transition count 396
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 47 place count 449 transition count 396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 446 transition count 393
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 446 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 446 transition count 390
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 445 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 60 place count 444 transition count 388
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 61 place count 443 transition count 387
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 443 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 443 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 63 place count 443 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 65 place count 442 transition count 385
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 7 with 152 rules applied. Total rules applied 217 place count 366 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 223 place count 363 transition count 317
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 225 place count 361 transition count 315
Applied a total of 225 rules in 74 ms. Remains 361 /479 variables (removed 118) and now considering 315/423 (removed 108) transitions.
// Phase 1: matrix 315 rows 361 cols
[2023-03-08 06:05:39] [INFO ] Computed 59 place invariants in 10 ms
[2023-03-08 06:05:39] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-08 06:05:39] [INFO ] Invariant cache hit.
[2023-03-08 06:05:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 06:05:40] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-08 06:05:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 06:05:40] [INFO ] Invariant cache hit.
[2023-03-08 06:05:40] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/479 places, 315/423 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 947 ms. Remains : 361/479 places, 315/423 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s257 0) (EQ s270 1)), p2:(OR (EQ s257 0) (EQ s270 1)), p0:(EQ s142 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 68576 steps with 4093 reset in 211 ms.
FORMULA DES-PT-60b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-13 finished in 1269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 423/423 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 419
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 475 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 473 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 473 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 473 transition count 413
Applied a total of 16 rules in 31 ms. Remains 473 /479 variables (removed 6) and now considering 413/423 (removed 10) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 06:05:40] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 06:05:40] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-08 06:05:40] [INFO ] Invariant cache hit.
[2023-03-08 06:05:41] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2023-03-08 06:05:41] [INFO ] Invariant cache hit.
[2023-03-08 06:05:41] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 413/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1072 ms. Remains : 473/479 places, 413/423 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s334 0) (EQ s8 1) (AND (NEQ s47 0) (NEQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 320 ms.
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 296 stabilizing places and 288 stable transitions
Detected a total of 296/473 stabilizing places and 288/413 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60b-LTLCardinality-15 finished in 1893 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)))'
[2023-03-08 06:05:42] [INFO ] Flatten gal took : 24 ms
[2023-03-08 06:05:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 06:05:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 479 places, 423 transitions and 1503 arcs took 4 ms.
Total runtime 29176 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-60b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1678255563794

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-60b-LTLCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60b-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 11/32 DES-PT-60b-LTLCardinality-03 1409270 m, 281854 m/sec, 1925215 t fired, .

Time elapsed: 5 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60b-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 20/32 DES-PT-60b-LTLCardinality-03 2745735 m, 267293 m/sec, 3893904 t fired, .

Time elapsed: 10 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60b-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 29/32 DES-PT-60b-LTLCardinality-03 4017760 m, 254405 m/sec, 5806097 t fired, .

Time elapsed: 15 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for DES-PT-60b-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-60b-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 20 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-60b"
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-60b, 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-167814478400499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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