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.r202-smll-167840348700473.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 marciexred
Input is HirschbergSinclair-PT-35, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K 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 HirschbergSinclair-PT-35-CTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-35-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678803694506

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 14:21:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:21:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:21:37] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-14 14:21:37] [INFO ] Transformed 998 places.
[2023-03-14 14:21:37] [INFO ] Transformed 922 transitions.
[2023-03-14 14:21:37] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 168 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 967 transition count 922
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 53 place count 945 transition count 900
Iterating global reduction 1 with 22 rules applied. Total rules applied 75 place count 945 transition count 900
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 928 transition count 883
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 928 transition count 883
Applied a total of 109 rules in 435 ms. Remains 928 /998 variables (removed 70) and now considering 883/922 (removed 39) transitions.
// Phase 1: matrix 883 rows 928 cols
[2023-03-14 14:21:38] [INFO ] Computed 45 place invariants in 54 ms
[2023-03-14 14:21:39] [INFO ] Implicit Places using invariants in 1518 ms returned []
[2023-03-14 14:21:39] [INFO ] Invariant cache hit.
[2023-03-14 14:21:42] [INFO ] Implicit Places using invariants and state equation in 3272 ms returned []
Implicit Place search using SMT with State Equation took 4835 ms to find 0 implicit places.
[2023-03-14 14:21:42] [INFO ] Invariant cache hit.
[2023-03-14 14:21:43] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 928/998 places, 883/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6425 ms. Remains : 928/998 places, 883/922 transitions.
Support contains 168 out of 928 places after structural reductions.
[2023-03-14 14:21:44] [INFO ] Flatten gal took : 268 ms
[2023-03-14 14:21:44] [INFO ] Flatten gal took : 131 ms
[2023-03-14 14:21:45] [INFO ] Input system was already deterministic with 883 transitions.
Support contains 166 out of 928 places (down from 168) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 93) seen :75
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-14 14:21:46] [INFO ] Invariant cache hit.
[2023-03-14 14:21:46] [INFO ] After 724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-14 14:21:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-14 14:21:47] [INFO ] [Nat]Absence check using 4 positive and 41 generalized place invariants in 278 ms returned sat
[2023-03-14 14:21:51] [INFO ] After 2672ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :6
[2023-03-14 14:21:53] [INFO ] Deduced a trap composed of 87 places in 522 ms of which 23 ms to minimize.
[2023-03-14 14:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 759 ms
[2023-03-14 14:21:54] [INFO ] After 5731ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :6
Attempting to minimize the solution found.
Minimization took 2091 ms.
[2023-03-14 14:21:56] [INFO ] After 9713ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :6
Fused 18 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 21 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 913 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 353 rules applied. Total rules applied 354 place count 913 transition count 530
Reduce places removed 342 places and 0 transitions.
Graph (complete) has 1017 edges and 571 vertex of which 516 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.2 ms
Discarding 55 places :
Also discarding 0 output transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 351 rules applied. Total rules applied 705 place count 516 transition count 522
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 768 place count 508 transition count 467
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 775 place count 501 transition count 460
Iterating global reduction 3 with 7 rules applied. Total rules applied 782 place count 501 transition count 460
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 786 place count 501 transition count 456
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 889 edges and 497 vertex of which 490 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 791 place count 490 transition count 456
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 798 place count 490 transition count 449
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 801 place count 487 transition count 446
Iterating global reduction 6 with 3 rules applied. Total rules applied 804 place count 487 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 806 place count 486 transition count 445
Graph (complete) has 868 edges and 486 vertex of which 484 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 807 place count 484 transition count 445
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 809 place count 484 transition count 443
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 832 place count 484 transition count 420
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 855 place count 461 transition count 420
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 9 with 29 rules applied. Total rules applied 884 place count 432 transition count 391
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 9 with 71 rules applied. Total rules applied 955 place count 423 transition count 329
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 10 with 64 rules applied. Total rules applied 1019 place count 361 transition count 327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1021 place count 359 transition count 327
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 19 Pre rules applied. Total rules applied 1021 place count 359 transition count 308
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 1059 place count 340 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1063 place count 338 transition count 306
Applied a total of 1063 rules in 499 ms. Remains 338 /928 variables (removed 590) and now considering 306/883 (removed 577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 338/928 places, 306/883 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 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 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 306 rows 338 cols
[2023-03-14 14:21:58] [INFO ] Computed 32 place invariants in 13 ms
[2023-03-14 14:21:58] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 14:21:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 14:21:58] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 50 ms returned sat
[2023-03-14 14:21:58] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 14:21:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-14 14:21:58] [INFO ] After 249ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 14:21:59] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-14 14:21:59] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 11 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 306/306 transitions.
Graph (complete) has 617 edges and 338 vertex of which 336 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 336 transition count 284
Reduce places removed 30 places and 0 transitions.
Graph (complete) has 479 edges and 306 vertex of which 301 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 70 rules applied. Total rules applied 93 place count 301 transition count 244
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 136 place count 262 transition count 240
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 136 place count 262 transition count 195
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 226 place count 217 transition count 195
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 217 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 230 place count 215 transition count 193
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 233 place count 212 transition count 190
Reduce places removed 3 places and 0 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 4 with 20 rules applied. Total rules applied 253 place count 209 transition count 173
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 18 rules applied. Total rules applied 271 place count 192 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 272 place count 191 transition count 172
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 272 place count 191 transition count 167
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 282 place count 186 transition count 167
Applied a total of 282 rules in 73 ms. Remains 186 /338 variables (removed 152) and now considering 167/306 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 186/338 places, 167/306 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1122842 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{1=1}
Probabilistic random walk after 1122842 steps, saw 201565 distinct states, run finished after 3002 ms. (steps per millisecond=374 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 167 rows 186 cols
[2023-03-14 14:22:02] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-14 14:22:02] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 14:22:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-14 14:22:02] [INFO ] [Nat]Absence check using 4 positive and 15 generalized place invariants in 15 ms returned sat
[2023-03-14 14:22:02] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 14:22:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-14 14:22:02] [INFO ] After 26ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 14:22:02] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-14 14:22:02] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 167/167 transitions.
Graph (complete) has 337 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions 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 0 with 3 rules applied. Total rules applied 4 place count 184 transition count 164
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 255 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 51 rules applied. Total rules applied 55 place count 175 transition count 122
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 96 place count 134 transition count 122
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 96 place count 134 transition count 94
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 152 place count 106 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 105 transition count 93
Applied a total of 154 rules in 22 ms. Remains 105 /186 variables (removed 81) and now considering 93/167 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 105/186 places, 93/167 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 93099 steps, run visited all 1 properties in 136 ms. (steps per millisecond=684 )
Probabilistic random walk after 93099 steps, saw 19539 distinct states, run finished after 137 ms. (steps per millisecond=679 ) properties seen :1
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2023-03-14 14:22:03] [INFO ] Flatten gal took : 53 ms
[2023-03-14 14:22:03] [INFO ] Flatten gal took : 56 ms
[2023-03-14 14:22:03] [INFO ] Input system was already deterministic with 883 transitions.
Support contains 117 out of 928 places (down from 124) after GAL structural reductions.
Computed a total of 928 stabilizing places and 883 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 928 transition count 883
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA HirschbergSinclair-PT-35-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 924 transition count 883
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 21 place count 907 transition count 866
Iterating global reduction 1 with 17 rules applied. Total rules applied 38 place count 907 transition count 866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 895 transition count 854
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 895 transition count 854
Applied a total of 62 rules in 152 ms. Remains 895 /928 variables (removed 33) and now considering 854/883 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 895/928 places, 854/883 transitions.
[2023-03-14 14:22:03] [INFO ] Flatten gal took : 41 ms
[2023-03-14 14:22:03] [INFO ] Flatten gal took : 40 ms
[2023-03-14 14:22:03] [INFO ] Input system was already deterministic with 854 transitions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 925 transition count 883
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 908 transition count 866
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 908 transition count 866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 896 transition count 854
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 896 transition count 854
Applied a total of 61 rules in 148 ms. Remains 896 /928 variables (removed 32) and now considering 854/883 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 896/928 places, 854/883 transitions.
[2023-03-14 14:22:03] [INFO ] Flatten gal took : 44 ms
[2023-03-14 14:22:03] [INFO ] Flatten gal took : 37 ms
[2023-03-14 14:22:03] [INFO ] Input system was already deterministic with 854 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 925 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 33 places and 33 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 363 place count 892 transition count 488
Reduce places removed 362 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 364 rules applied. Total rules applied 727 place count 530 transition count 486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 729 place count 528 transition count 486
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 743 place count 514 transition count 472
Iterating global reduction 3 with 14 rules applied. Total rules applied 757 place count 514 transition count 472
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 760 place count 514 transition count 469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 763 place count 511 transition count 469
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 765 place count 510 transition count 468
Applied a total of 765 rules in 112 ms. Remains 510 /928 variables (removed 418) and now considering 468/883 (removed 415) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 510/928 places, 468/883 transitions.
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 15 ms
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 16 ms
[2023-03-14 14:22:04] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 924 transition count 883
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 21 place count 907 transition count 866
Iterating global reduction 1 with 17 rules applied. Total rules applied 38 place count 907 transition count 866
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 895 transition count 854
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 895 transition count 854
Applied a total of 62 rules in 147 ms. Remains 895 /928 variables (removed 33) and now considering 854/883 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 895/928 places, 854/883 transitions.
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 27 ms
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 29 ms
[2023-03-14 14:22:04] [INFO ] Input system was already deterministic with 854 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 924 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 392 place count 890 transition count 458
Reduce places removed 391 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 785 place count 499 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 787 place count 497 transition count 456
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 805 place count 479 transition count 438
Iterating global reduction 3 with 18 rules applied. Total rules applied 823 place count 479 transition count 438
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 828 place count 479 transition count 433
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 833 place count 474 transition count 433
Applied a total of 833 rules in 74 ms. Remains 474 /928 variables (removed 454) and now considering 433/883 (removed 450) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 474/928 places, 433/883 transitions.
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 13 ms
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 16 ms
[2023-03-14 14:22:04] [INFO ] Input system was already deterministic with 433 transitions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 924 transition count 883
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 908 transition count 867
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 908 transition count 867
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 897 transition count 856
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 897 transition count 856
Applied a total of 58 rules in 145 ms. Remains 897 /928 variables (removed 31) and now considering 856/883 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 897/928 places, 856/883 transitions.
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 26 ms
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 28 ms
[2023-03-14 14:22:04] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 924 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 391 place count 890 transition count 459
Reduce places removed 390 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 392 rules applied. Total rules applied 783 place count 500 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 785 place count 498 transition count 457
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 802 place count 481 transition count 440
Iterating global reduction 3 with 17 rules applied. Total rules applied 819 place count 481 transition count 440
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 823 place count 481 transition count 436
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 827 place count 477 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 829 place count 476 transition count 435
Applied a total of 829 rules in 82 ms. Remains 476 /928 variables (removed 452) and now considering 435/883 (removed 448) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 476/928 places, 435/883 transitions.
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:22:04] [INFO ] Flatten gal took : 14 ms
[2023-03-14 14:22:05] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 924 transition count 883
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 909 transition count 868
Iterating global reduction 1 with 15 rules applied. Total rules applied 34 place count 909 transition count 868
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 900 transition count 859
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 900 transition count 859
Applied a total of 52 rules in 147 ms. Remains 900 /928 variables (removed 28) and now considering 859/883 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 900/928 places, 859/883 transitions.
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 25 ms
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 27 ms
[2023-03-14 14:22:05] [INFO ] Input system was already deterministic with 859 transitions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 924 transition count 883
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 22 place count 906 transition count 865
Iterating global reduction 1 with 18 rules applied. Total rules applied 40 place count 906 transition count 865
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 893 transition count 852
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 893 transition count 852
Applied a total of 66 rules in 140 ms. Remains 893 /928 variables (removed 35) and now considering 852/883 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 893/928 places, 852/883 transitions.
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 25 ms
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 24 ms
[2023-03-14 14:22:05] [INFO ] Input system was already deterministic with 852 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 924 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 889 transition count 452
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 793 place count 493 transition count 452
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 811 place count 475 transition count 434
Iterating global reduction 2 with 18 rules applied. Total rules applied 829 place count 475 transition count 434
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 834 place count 475 transition count 429
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 839 place count 470 transition count 429
Applied a total of 839 rules in 63 ms. Remains 470 /928 variables (removed 458) and now considering 429/883 (removed 454) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 470/928 places, 429/883 transitions.
[2023-03-14 14:22:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 11 ms
FORMULA HirschbergSinclair-PT-35-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:22:05] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 924 transition count 883
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 909 transition count 868
Iterating global reduction 1 with 15 rules applied. Total rules applied 34 place count 909 transition count 868
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 897 transition count 856
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 897 transition count 856
Applied a total of 58 rules in 133 ms. Remains 897 /928 variables (removed 31) and now considering 856/883 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 897/928 places, 856/883 transitions.
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 36 ms
[2023-03-14 14:22:05] [INFO ] Flatten gal took : 23 ms
[2023-03-14 14:22:05] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 925 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 386 place count 890 transition count 463
Reduce places removed 385 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 389 rules applied. Total rules applied 775 place count 505 transition count 459
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 779 place count 501 transition count 459
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 797 place count 483 transition count 441
Iterating global reduction 3 with 18 rules applied. Total rules applied 815 place count 483 transition count 441
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 820 place count 483 transition count 436
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 825 place count 478 transition count 436
Applied a total of 825 rules in 59 ms. Remains 478 /928 variables (removed 450) and now considering 436/883 (removed 447) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 478/928 places, 436/883 transitions.
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 10 ms
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 12 ms
[2023-03-14 14:22:06] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 924 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 396 place count 889 transition count 453
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 791 place count 494 transition count 453
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 809 place count 476 transition count 435
Iterating global reduction 2 with 18 rules applied. Total rules applied 827 place count 476 transition count 435
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 832 place count 476 transition count 430
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 837 place count 471 transition count 430
Applied a total of 837 rules in 53 ms. Remains 471 /928 variables (removed 457) and now considering 430/883 (removed 453) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 471/928 places, 430/883 transitions.
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 10 ms
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:22:06] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 924 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 393 place count 889 transition count 456
Reduce places removed 392 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 394 rules applied. Total rules applied 787 place count 497 transition count 454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 789 place count 495 transition count 454
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 807 place count 477 transition count 436
Iterating global reduction 3 with 18 rules applied. Total rules applied 825 place count 477 transition count 436
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 830 place count 477 transition count 431
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 835 place count 472 transition count 431
Applied a total of 835 rules in 47 ms. Remains 472 /928 variables (removed 456) and now considering 431/883 (removed 452) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 472/928 places, 431/883 transitions.
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 9 ms
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:22:06] [INFO ] Input system was already deterministic with 431 transitions.
Finished random walk after 154 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=51 )
FORMULA HirschbergSinclair-PT-35-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 928/928 places, 883/883 transitions.
Graph (complete) has 1830 edges and 928 vertex of which 924 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 394 place count 889 transition count 455
Reduce places removed 393 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 394 rules applied. Total rules applied 788 place count 496 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 789 place count 495 transition count 454
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 807 place count 477 transition count 436
Iterating global reduction 3 with 18 rules applied. Total rules applied 825 place count 477 transition count 436
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 830 place count 477 transition count 431
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 835 place count 472 transition count 431
Applied a total of 835 rules in 51 ms. Remains 472 /928 variables (removed 456) and now considering 431/883 (removed 452) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 472/928 places, 431/883 transitions.
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 9 ms
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:22:06] [INFO ] Input system was already deterministic with 431 transitions.
Finished random walk after 351 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=117 )
FORMULA HirschbergSinclair-PT-35-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-14 14:22:06] [INFO ] Flatten gal took : 23 ms
[2023-03-14 14:22:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-14 14:22:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 928 places, 883 transitions and 2679 arcs took 9 ms.
Total runtime 29431 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 928 NrTr: 883 NrArc: 2679)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.144sec

net check time: 0m 0.000sec

init dd package: 0m 3.593sec


RS generation: 2m58.350sec


-> reachability set: #nodes 371107 (3.7e+05) #states 4,786,846,749,347,232,669,899,824,787,145,760,394,087 (39)



starting MCC model checker
--------------------------

checking: AF [AG [1<=p876]]
normalized: ~ [EG [E [true U ~ [1<=p876]]]]

abstracting: (1<=p876)
states: 8,618,224,453,402,455,833,054,647,528,480,229,504 (36)

EG iterations: 0
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-35-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m58.581sec

checking: ~ [E [AF [1<=p870] U AG [[p724<=p6 | AG [1<=p839]]]]]
normalized: ~ [E [~ [EG [~ [1<=p870]]] U ~ [E [true U ~ [[p724<=p6 | ~ [E [true U ~ [1<=p839]]]]]]]]]

abstracting: (1<=p839)
states: 16,224,134,548,509,918,171,129,494,375,511,659,520 (37)
abstracting: (p724<=p6)
states: 4,758,229,783,372,893,388,436,681,495,494,083,217,255 (39)
abstracting: (1<=p870)
states: 8,196,737,264,284,930,374,225,217,094,638,691,392 (36)

before gc: list nodes free: 969494

after gc: idd nodes used:901829, unused:63098171; list nodes free:264638684
.MC time: 5m 0.117sec

checking: EG [E [[AF [EG [1<=p346]] | p117<=p533] U p159<=p592]]
normalized: EG [E [[p117<=p533 | ~ [EG [~ [EG [1<=p346]]]]] U p159<=p592]]

abstracting: (p159<=p592)
states: 2,824,582,761,060,505,106,305,292,821,693,260,448,205 (39)
abstracting: (1<=p346)
states: 9,167,866,951,888,522,016,497,015,481,761,958,112 (36)
..........
before gc: list nodes free: 1540824

after gc: idd nodes used:618911, unused:63381089; list nodes free:267922676
...................................................MC time: 4m33.042sec

checking: [EF [1<=p774] | EX [AG [[EG [~ [p254<=0]] & [p901<=p787 | ~ [1<=p80]]]]]]
normalized: [EX [~ [E [true U ~ [[[p901<=p787 | ~ [1<=p80]] & EG [~ [p254<=0]]]]]]] | E [true U 1<=p774]]

abstracting: (1<=p774)
states: 7,971,574,529,947,371,281,671,755,081,096,880,256 (36)

before gc: list nodes free: 1281170

after gc: idd nodes used:543339, unused:63456661; list nodes free:268243686
abstracting: (p254<=0)
states: 4,784,987,220,068,736,189,738,769,832,877,814,071,807 (39)
..................MC time: 4m 8.001sec

checking: EX [[~ [p170<=p142] & ~ [E [AX [EG [p343<=p712]] U EX [[1<=p500 & p733<=p723]]]]]]
normalized: EX [[~ [E [~ [EX [~ [EG [p343<=p712]]]] U EX [[1<=p500 & p733<=p723]]]] & ~ [p170<=p142]]]

abstracting: (p170<=p142)
states: 3,896,042,762,644,066,326,945,388,355,601,097,019,611 (39)
abstracting: (p733<=p723)
states: 4,771,664,956,590,909,599,030,690,190,037,684,216,679 (39)
abstracting: (1<=p500)
states: 14,328,509,480,716,914,592,140,201,523,891,068,928 (37)
.abstracting: (p343<=p712)
states: 4,781,881,728,716,824,561,758,453,576,014,984,507,495 (39)

before gc: list nodes free: 2825937

after gc: idd nodes used:1475959, unused:62524041; list nodes free:264355357
.......
before gc: list nodes free: 1932462

after gc: idd nodes used:1542758, unused:62457242; list nodes free:268257703
MC time: 3m46.186sec

checking: AX [[AF [AG [[~ [p434<=p865] & ~ [p28<=0]]]] | [[AF [~ [1<=p532]] & p214<=p365] & [AX [1<=0] & AG [~ [p246<=p641]]]]]]
normalized: ~ [EX [~ [[[[~ [E [true U p246<=p641]] & ~ [EX [~ [1<=0]]]] & [p214<=p365 & ~ [EG [1<=p532]]]] | ~ [EG [E [true U ~ [[~ [p28<=0] & ~ [p434<=p865]]]]]]]]]]

abstracting: (p434<=p865)
states: 4,770,343,241,311,451,399,052,629,522,437,138,208,615 (39)
abstracting: (p28<=0)
states: 4,779,543,188,489,270,629,650,035,077,032,912,621,789 (39)

EG iterations: 0
abstracting: (1<=p532)
states: 14,488,546,087,784,611,339,042,775,256,299,089,920 (37)
...............................MC time: 3m25.000sec

checking: EX [[1<=p180 | [EG [[AF [p751<=p918] | EF [p663<=p225]]] & AF [EX [[p500<=1 & p250<=p134]]]]]]
normalized: EX [[1<=p180 | [~ [EG [~ [EX [[p500<=1 & p250<=p134]]]]] & EG [[E [true U p663<=p225] | ~ [EG [~ [p751<=p918]]]]]]]]

abstracting: (p751<=p918)
states: 4,766,106,609,405,784,681,889,706,146,021,039,064,935 (39)
...........
before gc: list nodes free: 6061846

after gc: idd nodes used:1336944, unused:62663056; list nodes free:269103278
.................................................MC time: 3m 7.003sec

checking: E [p467<=p207 U [EF [[p549<=0 | EF [EG [p845<=p813]]]] & ~ [[p259<=p70 & AG [p373<=0]]]]]
normalized: E [p467<=p207 U [~ [[p259<=p70 & ~ [E [true U ~ [p373<=0]]]]] & E [true U [p549<=0 | E [true U EG [p845<=p813]]]]]]

abstracting: (p845<=p813)
states: 4,770,916,476,678,543,783,568,207,408,205,282,639,719 (39)

before gc: list nodes free: 3946670

after gc: idd nodes used:1569842, unused:62430158; list nodes free:268162125
.MC time: 2m50.033sec

checking: EG [[EX [E [[[p169<=1 & p527<=p526] & AF [1<=p318]] U [1<=p72 & ~ [1<=p96]]]] & [[EF [EG [p422<=p423]] | p844<=0] | EG [A [1<=p388 U p127<=p81]]]]]
normalized: EG [[[EG [[~ [EG [~ [p127<=p81]]] & ~ [E [~ [p127<=p81] U [~ [1<=p388] & ~ [p127<=p81]]]]]] | [p844<=0 | E [true U EG [p422<=p423]]]] & EX [E [[~ [EG [~ [1<=p318]]] & [p169<=1 & p527<=p526]] U [1<=p72 & ~ [1<=p96]]]]]]

abstracting: (1<=p96)
states: 630,023,869,638,580,640,467,709,936,116,086,713,708 (38)
abstracting: (1<=p72)
states: 1,177,385,152,114,305,539,110,051,925,469,635,482,569 (39)
abstracting: (p527<=p526)
states: 4,757,994,436,154,735,587,049,315,564,409,478,130,535 (39)
abstracting: (p169<=1)
states: 4,786,846,749,347,232,669,899,824,787,145,760,394,087 (39)
abstracting: (1<=p318)
states: 4,849,760,033,807,127,064,939,436,094,630,846,976 (36)

before gc: list nodes free: 5824814

after gc: idd nodes used:2435848, unused:61564152; list nodes free:264534172
.MC time: 2m34.100sec

checking: E [[EG [AF [AG [p519<=p568]]] | ~ [[~ [[AG [1<=p576] | p140<=p67]] & EF [[1<=p199 | [p37<=p753 | p174<=p626]]]]]] U AG [~ [A [EG [p388<=p714] U EF [p193<=0]]]]]
normalized: E [[~ [[E [true U [1<=p199 | [p37<=p753 | p174<=p626]]] & ~ [[p140<=p67 | ~ [E [true U ~ [1<=p576]]]]]]] | EG [~ [EG [E [true U ~ [p519<=p568]]]]]] U ~ [E [true U [~ [EG [~ [E [true U p193<=0]]]] & ~ [E [~ [E [true U p193<=0]] U [~ [EG [p388<=p714]] & ~ [E [true U p193<=0]]]]]]]]]

abstracting: (p193<=0)
states: 3,556,136,781,868,421,847,071,710,595,768,524,079,621 (39)
MC time: 2m20.019sec

checking: [EX [AG [[p772<=p581 & [EX [~ [1<=p228]] | [~ [p905<=1] | ~ [1<=p891]]]]]] | ~ [A [AF [[AG [1<=p373] & [~ [p446<=p853] | [p574<=p390 & 1<=p438]]]] U [AG [p189<=p696] | AG [EF [p378<=p96]]]]]]
normalized: [~ [[~ [EG [~ [[~ [E [true U ~ [E [true U p378<=p96]]]] | ~ [E [true U ~ [p189<=p696]]]]]]] & ~ [E [~ [[~ [E [true U ~ [E [true U p378<=p96]]]] | ~ [E [true U ~ [p189<=p696]]]]] U [EG [~ [[[[p574<=p390 & 1<=p438] | ~ [p446<=p853]] & ~ [E [true U ~ [1<=p373]]]]]] & ~ [[~ [E [true U ~ [E [true U p378<=p96]]]] | ~ [E [true U ~ [p189<=p696]]]]]]]]]] | EX [~ [E [true U ~ [[p772<=p581 & [[~ [1<=p891] | ~ [p905<=1]] | EX [~ [1<=p228]]]]]]]]]

abstracting: (1<=p228)
states: 1,972,973,553,489,346,760,466,274,383,860,514,046,105 (39)

before gc: list nodes free: 6673708

after gc: idd nodes used:2506627, unused:61493373; list nodes free:264275121
MC time: 2m 7.035sec

checking: [AG [A [[[1<=p833 | [p709<=p67 | ~ [1<=p162]]] | [[p328<=0 & 1<=p183] | p85<=p223]] U [AF [p729<=p741] & EG [1<=p892]]]] & EF [~ [A [[~ [[1<=p365 & p916<=0]] & EF [p915<=p171]] U ~ [AX [1<=p481]]]]]]
normalized: [E [true U ~ [[~ [EG [~ [EX [~ [1<=p481]]]]] & ~ [E [~ [EX [~ [1<=p481]]] U [~ [[E [true U p915<=p171] & ~ [[1<=p365 & p916<=0]]]] & ~ [EX [~ [1<=p481]]]]]]]]] & ~ [E [true U ~ [[~ [EG [~ [[EG [1<=p892] & ~ [EG [~ [p729<=p741]]]]]]] & ~ [E [~ [[EG [1<=p892] & ~ [EG [~ [p729<=p741]]]]] U [~ [[[p85<=p223 | [p328<=0 & 1<=p183]] | [1<=p833 | [p709<=p67 | ~ [1<=p162]]]]] & ~ [[EG [1<=p892] & ~ [EG [~ [p729<=p741]]]]]]]]]]]]]

abstracting: (p729<=p741)
states: 4,771,656,264,402,204,337,684,106,334,106,011,307,879 (39)
.................
before gc: list nodes free: 6478455

after gc: idd nodes used:2420763, unused:61579237; list nodes free:264562274
.MC time: 1m56.025sec

checking: ~ [E [AF [1<=p870] U AG [[p724<=p6 | AG [1<=p839]]]]]
normalized: ~ [E [~ [EG [~ [1<=p870]]] U ~ [E [true U ~ [[p724<=p6 | ~ [E [true U ~ [1<=p839]]]]]]]]]

abstracting: (1<=p839)
states: 16,224,134,548,509,918,171,129,494,375,511,659,520 (37)
abstracting: (p724<=p6)
states: 4,758,229,783,372,893,388,436,681,495,494,083,217,255 (39)
abstracting: (1<=p870)
states: 8,196,737,264,284,930,374,225,217,094,638,691,392 (36)

before gc: list nodes free: 6913726

after gc: idd nodes used:2427562, unused:61572438; list nodes free:264573759
.
EG iterations: 1
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-35-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6367748 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097908 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.005sec


iterations count:71635 (81), effective:1868 (2)

initing FirstDep: 0m 0.005sec


iterations count:899 (1), effective:1 (0)

iterations count:973 (1), effective:5 (0)

iterations count:19758 (22), effective:847 (0)

net_ddint.h:442: Timeout: after 299 sec


net_ddint.h:600: Timeout: after 272 sec


iterations count:27769 (31), effective:1239 (1)

net_ddint.h:600: Timeout: after 247 sec


net_ddint.h:600: Timeout: after 225 sec


iterations count:907 (1), effective:3 (0)

net_ddint.h:600: Timeout: after 204 sec


net_ddint.h:600: Timeout: after 186 sec


net_ddint.h:600: Timeout: after 169 sec


net_ddint.h:600: Timeout: after 153 sec


sat_reach.icc:155: Timeout: after 139 sec


net_ddint.h:600: Timeout: after 126 sec


net_ddint.h:600: Timeout: after 115 sec


iterations count:973 (1), effective:5 (0)

iterations count:19758 (22), effective:847 (0)

iterations count:883 (1), effective:0 (0)

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="HirschbergSinclair-PT-35"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is HirschbergSinclair-PT-35, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348700473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;