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-167840348700465.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-30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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 357K 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-30-CTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678799836393

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-30
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 13:17:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:17:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:17:19] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-14 13:17:19] [INFO ] Transformed 670 places.
[2023-03-14 13:17:19] [INFO ] Transformed 605 transitions.
[2023-03-14 13:17:19] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 130 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 649 transition count 605
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 39 place count 631 transition count 587
Iterating global reduction 1 with 18 rules applied. Total rules applied 57 place count 631 transition count 587
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 68 place count 620 transition count 576
Iterating global reduction 1 with 11 rules applied. Total rules applied 79 place count 620 transition count 576
Applied a total of 79 rules in 205 ms. Remains 620 /670 variables (removed 50) and now considering 576/605 (removed 29) transitions.
// Phase 1: matrix 576 rows 620 cols
[2023-03-14 13:17:19] [INFO ] Computed 44 place invariants in 30 ms
[2023-03-14 13:17:20] [INFO ] Implicit Places using invariants in 978 ms returned []
[2023-03-14 13:17:20] [INFO ] Invariant cache hit.
[2023-03-14 13:17:22] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3434 ms to find 0 implicit places.
[2023-03-14 13:17:22] [INFO ] Invariant cache hit.
[2023-03-14 13:17:23] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/670 places, 576/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4291 ms. Remains : 620/670 places, 576/605 transitions.
Support contains 130 out of 620 places after structural reductions.
[2023-03-14 13:17:23] [INFO ] Flatten gal took : 117 ms
[2023-03-14 13:17:23] [INFO ] Flatten gal took : 54 ms
[2023-03-14 13:17:24] [INFO ] Input system was already deterministic with 576 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 929 ms. (steps per millisecond=10 ) properties (out of 78) seen :59
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-14 13:17:25] [INFO ] Invariant cache hit.
[2023-03-14 13:17:25] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-14 13:17:25] [INFO ] [Real]Absence check using 9 positive and 35 generalized place invariants in 101 ms returned sat
[2023-03-14 13:17:25] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-14 13:17:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-14 13:17:26] [INFO ] [Nat]Absence check using 9 positive and 35 generalized place invariants in 89 ms returned sat
[2023-03-14 13:17:26] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :18 sat :1
[2023-03-14 13:17:26] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :18 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-14 13:17:26] [INFO ] After 1200ms SMT Verify possible using all constraints in natural domain returned unsat :18 sat :1
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 576/576 transitions.
Graph (complete) has 1208 edges and 620 vertex of which 581 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 0 output transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 272 rules applied. Total rules applied 273 place count 581 transition count 304
Reduce places removed 242 places and 0 transitions.
Graph (complete) has 564 edges and 339 vertex of which 31 are kept as prefixes of interest. Removing 308 places using SCC suffix rule.1 ms
Discarding 308 places :
Also discarding 226 output transitions
Drop transitions removed 226 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 244 rules applied. Total rules applied 517 place count 31 transition count 77
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 572 place count 30 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 572 place count 30 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 578 place count 27 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 579 place count 26 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 580 place count 26 transition count 19
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 1 rules applied. Total rules applied 581 place count 26 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 31 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 583 place count 24 transition count 18
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 24 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 586 place count 23 transition count 16
Graph (complete) has 25 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 587 place count 22 transition count 16
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 588 place count 22 transition count 15
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 594 place count 16 transition count 9
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 8 rules applied. Total rules applied 602 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 604 place count 8 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 604 place count 8 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 611 place count 4 transition count 4
Applied a total of 611 rules in 42 ms. Remains 4 /620 variables (removed 616) and now considering 4/576 (removed 572) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 4/620 places, 4/576 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
[2023-03-14 13:17:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 42 ms
[2023-03-14 13:17:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA HirschbergSinclair-PT-30-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 42 ms
[2023-03-14 13:17:27] [INFO ] Input system was already deterministic with 576 transitions.
Support contains 71 out of 620 places (down from 97) after GAL structural reductions.
Computed a total of 620 stabilizing places and 576 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 620 transition count 576
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-30-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 611 transition count 576
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 593 transition count 558
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 593 transition count 558
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 581 transition count 546
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 581 transition count 546
Applied a total of 69 rules in 143 ms. Remains 581 /620 variables (removed 39) and now considering 546/576 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 581/620 places, 546/576 transitions.
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 34 ms
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 37 ms
[2023-03-14 13:17:27] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 612 transition count 576
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 26 place count 594 transition count 558
Iterating global reduction 1 with 18 rules applied. Total rules applied 44 place count 594 transition count 558
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 583 transition count 547
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 583 transition count 547
Applied a total of 66 rules in 118 ms. Remains 583 /620 variables (removed 37) and now considering 547/576 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 583/620 places, 547/576 transitions.
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 31 ms
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 31 ms
[2023-03-14 13:17:27] [INFO ] Input system was already deterministic with 547 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Graph (complete) has 1208 edges and 620 vertex of which 611 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 581 transition count 310
Reduce places removed 236 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 239 rules applied. Total rules applied 476 place count 345 transition count 307
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 479 place count 342 transition count 307
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 497 place count 324 transition count 289
Iterating global reduction 3 with 18 rules applied. Total rules applied 515 place count 324 transition count 289
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 7 rules applied. Total rules applied 522 place count 324 transition count 282
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 529 place count 317 transition count 282
Applied a total of 529 rules in 74 ms. Remains 317 /620 variables (removed 303) and now considering 282/576 (removed 294) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 317/620 places, 282/576 transitions.
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 13 ms
[2023-03-14 13:17:27] [INFO ] Flatten gal took : 14 ms
[2023-03-14 13:17:27] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Graph (complete) has 1208 edges and 620 vertex of which 611 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 29 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 582 transition count 306
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 341 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 485 place count 340 transition count 305
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 503 place count 322 transition count 287
Iterating global reduction 3 with 18 rules applied. Total rules applied 521 place count 322 transition count 287
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 527 place count 322 transition count 281
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 533 place count 316 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 535 place count 315 transition count 280
Applied a total of 535 rules in 86 ms. Remains 315 /620 variables (removed 305) and now considering 280/576 (removed 296) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 315/620 places, 280/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 13 ms
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 18 ms
[2023-03-14 13:17:28] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 611 transition count 576
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 28 place count 592 transition count 557
Iterating global reduction 1 with 19 rules applied. Total rules applied 47 place count 592 transition count 557
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 580 transition count 545
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 580 transition count 545
Applied a total of 71 rules in 70 ms. Remains 580 /620 variables (removed 40) and now considering 545/576 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 580/620 places, 545/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 25 ms
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 27 ms
[2023-03-14 13:17:28] [INFO ] Input system was already deterministic with 545 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 611 transition count 576
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 27 place count 593 transition count 558
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 593 transition count 558
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 582 transition count 547
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 582 transition count 547
Applied a total of 67 rules in 58 ms. Remains 582 /620 variables (removed 38) and now considering 547/576 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 582/620 places, 547/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 26 ms
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 25 ms
[2023-03-14 13:17:28] [INFO ] Input system was already deterministic with 547 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 612 transition count 576
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 25 place count 595 transition count 559
Iterating global reduction 1 with 17 rules applied. Total rules applied 42 place count 595 transition count 559
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 584 transition count 548
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 584 transition count 548
Applied a total of 64 rules in 78 ms. Remains 584 /620 variables (removed 36) and now considering 548/576 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 584/620 places, 548/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 24 ms
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 25 ms
[2023-03-14 13:17:28] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 613 transition count 576
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 23 place count 597 transition count 560
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 597 transition count 560
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 589 transition count 552
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 589 transition count 552
Applied a total of 55 rules in 64 ms. Remains 589 /620 variables (removed 31) and now considering 552/576 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 589/620 places, 552/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 23 ms
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 24 ms
[2023-03-14 13:17:28] [INFO ] Input system was already deterministic with 552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Graph (complete) has 1208 edges and 620 vertex of which 611 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 581 transition count 302
Reduce places removed 244 places and 0 transitions.
Iterating post reduction 1 with 244 rules applied. Total rules applied 489 place count 337 transition count 302
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 508 place count 318 transition count 283
Iterating global reduction 2 with 19 rules applied. Total rules applied 527 place count 318 transition count 283
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 534 place count 318 transition count 276
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 541 place count 311 transition count 276
Applied a total of 541 rules in 52 ms. Remains 311 /620 variables (removed 309) and now considering 276/576 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 311/620 places, 276/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 11 ms
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 11 ms
[2023-03-14 13:17:28] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 620/620 places, 576/576 transitions.
Graph (complete) has 1208 edges and 620 vertex of which 611 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 581 transition count 302
Reduce places removed 244 places and 0 transitions.
Iterating post reduction 1 with 244 rules applied. Total rules applied 489 place count 337 transition count 302
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 507 place count 319 transition count 284
Iterating global reduction 2 with 18 rules applied. Total rules applied 525 place count 319 transition count 284
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 531 place count 319 transition count 278
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 537 place count 313 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 539 place count 312 transition count 277
Applied a total of 539 rules in 48 ms. Remains 312 /620 variables (removed 308) and now considering 277/576 (removed 299) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 312/620 places, 277/576 transitions.
[2023-03-14 13:17:28] [INFO ] Flatten gal took : 10 ms
[2023-03-14 13:17:29] [INFO ] Flatten gal took : 11 ms
[2023-03-14 13:17:29] [INFO ] Input system was already deterministic with 277 transitions.
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
FORMULA HirschbergSinclair-PT-30-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-14 13:17:29] [INFO ] Flatten gal took : 23 ms
[2023-03-14 13:17:29] [INFO ] Flatten gal took : 23 ms
[2023-03-14 13:17:29] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-14 13:17:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 620 places, 576 transitions and 1758 arcs took 5 ms.
Total runtime 10242 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: 620 NrTr: 576 NrArc: 1758)

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

net check time: 0m 0.000sec

init dd package: 0m 3.657sec


RS generation: 2m40.837sec


-> reachability set: #nodes 516948 (5.2e+05) #states 19,216,851,639,807,085,807,665,278,853,667,094 (34)



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

checking: EG [AF [p112<=0]]
normalized: EG [~ [EG [~ [p112<=0]]]]

abstracting: (p112<=0)
states: 16,457,251,800,643,535,790,867,029,124,824,580 (34)

before gc: list nodes free: 2032922

after gc: idd nodes used:2368867, unused:61631133; list nodes free:258022460
.
before gc: list nodes free: 2286285

after gc: idd nodes used:2524150, unused:61475850; list nodes free:257665118

before gc: list nodes free: 832844

after gc: idd nodes used:2061461, unused:61938539; list nodes free:259692773
..MC time: 6m22.027sec

checking: EF [[EG [~ [1<=p363]] & EX [1<=p250]]]
normalized: E [true U [EX [1<=p250] & EG [~ [1<=p363]]]]

abstracting: (1<=p363)
states: 85,128,168,972,190,335,777,626,859,380,120 (31)

before gc: list nodes free: 992109

after gc: idd nodes used:1443810, unused:62556190; list nodes free:262465228

before gc: list nodes free: 2518418

after gc: idd nodes used:1948936, unused:62051064; list nodes free:259783566
.
before gc: list nodes free: 1876935

after gc: idd nodes used:1710375, unused:62289625; list nodes free:261056824
.
before gc: list nodes free: 1486132

after gc: idd nodes used:1622347, unused:62377653; list nodes free:261602623
MC time: 5m40.062sec

checking: AF [[EG [1<=p579] & [AX [1<=0] | [1<=p544 | 1<=p89]]]]
normalized: ~ [EG [~ [[[[1<=p544 | 1<=p89] | ~ [EX [~ [1<=0]]]] & EG [1<=p579]]]]]

abstracting: (1<=p579)
states: 75,136,091,197,871,420,431,076,515,813,560 (31)
.........................................................
before gc: list nodes free: 116212

after gc: idd nodes used:1816371, unused:62183629; list nodes free:264903722
...............................
before gc: list nodes free: 302707

after gc: idd nodes used:2076658, unused:61923342; list nodes free:265892001
MC time: 5m 2.156sec

checking: AG [EF [~ [E [1<=p78 U A [p588<=0 U p93<=p505]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [1<=p78 U [~ [E [~ [p93<=p505] U [~ [p93<=p505] & ~ [p588<=0]]]] & ~ [EG [~ [p93<=p505]]]]]]]]]]

abstracting: (p93<=p505)
states: 16,470,895,777,633,435,612,342,437,460,545,224 (34)

before gc: list nodes free: 8993456

after gc: idd nodes used:2613922, unused:61386078; list nodes free:263614096
..
before gc: list nodes free: 7553685

after gc: idd nodes used:2403591, unused:61596409; list nodes free:264813911
MC time: 4m28.028sec

checking: EG [[EF [[1<=p599 | A [p154<=p322 U p32<=p416]]] & EX [0<=0]]]
normalized: EG [[EX [0<=0] & E [true U [1<=p599 | [~ [EG [~ [p32<=p416]]] & ~ [E [~ [p32<=p416] U [~ [p154<=p322] & ~ [p32<=p416]]]]]]]]]

abstracting: (p32<=p416)
states: 19,129,581,905,258,109,899,207,060,567,490,898 (34)
abstracting: (p154<=p322)
states: 11,318,368,443,140,711,508,361,040,251,260,732 (34)
abstracting: (p32<=p416)
states: 19,129,581,905,258,109,899,207,060,567,490,898 (34)
abstracting: (p32<=p416)
states: 19,129,581,905,258,109,899,207,060,567,490,898 (34)
..............
before gc: list nodes free: 4982001

after gc: idd nodes used:2400827, unused:61599173; list nodes free:264622108
.MC time: 3m59.192sec

checking: E [E [AX [~ [p568<=0]] U ~ [[~ [p158<=0] & p323<=p204]]] U 1<=p475]
normalized: E [E [~ [EX [p568<=0]] U ~ [[p323<=p204 & ~ [p158<=0]]]] U 1<=p475]

abstracting: (1<=p475)
states: 78,170,588,799,669,625,955,923,625,791,080 (31)
abstracting: (p158<=0)
states: 14,302,189,932,257,765,031,180,026,521,167,046 (34)
abstracting: (p323<=p204)
states: 19,144,809,654,263,813,846,157,704,306,625,866 (34)
abstracting: (p568<=0)
states: 19,060,186,194,108,007,025,065,650,817,249,450 (34)

before gc: list nodes free: 5312002

after gc: idd nodes used:2418391, unused:61581609; list nodes free:264703671
.MC time: 3m32.588sec

checking: AG [E [p249<=p350 U A [AF [1<=p520] U [1<=p536 | [1<=p186 | 1<=p218]]]]]
normalized: ~ [E [true U ~ [E [p249<=p350 U [~ [EG [~ [[1<=p536 | [1<=p186 | 1<=p218]]]]] & ~ [E [~ [[1<=p536 | [1<=p186 | 1<=p218]]] U [EG [~ [1<=p520]] & ~ [[1<=p536 | [1<=p186 | 1<=p218]]]]]]]]]]]

abstracting: (1<=p218)
states: 18,237,558,690,262,152,455,623,867,792,290 (31)
abstracting: (1<=p186)
states: 4,545,272,465,495,751,770,823,418,124,484,194 (33)
abstracting: (1<=p536)
states: 156,665,445,699,078,782,599,628,036,417,644 (32)
abstracting: (1<=p520)
states: 156,665,445,699,078,782,599,628,036,417,644 (32)

before gc: list nodes free: 7853295

after gc: idd nodes used:2511874, unused:61488126; list nodes free:264253305
.
before gc: list nodes free: 7636973

after gc: idd nodes used:2485996, unused:61514004; list nodes free:264387711
MC time: 3m 8.017sec

checking: E [EX [[A [[AX [p558<=0] & [p324<=0 & 1<=p333]] U ~ [AF [p356<=p10]]] | [AF [1<=p186] & [~ [p2<=p541] & p618<=p605]]]] U AF [AG [EF [p303<=p480]]]]
normalized: E [EX [[[[p618<=p605 & ~ [p2<=p541]] & ~ [EG [~ [1<=p186]]]] | [~ [EG [~ [EG [~ [p356<=p10]]]]] & ~ [E [~ [EG [~ [p356<=p10]]] U [~ [[[p324<=0 & 1<=p333] & ~ [EX [~ [p558<=0]]]]] & ~ [EG [~ [p356<=p10]]]]]]]]] U ~ [EG [E [true U ~ [E [true U p303<=p480]]]]]]

abstracting: (p303<=p480)
states: 19,167,600,097,819,599,206,491,857,053,548,102 (34)
.
EG iterations: 1
abstracting: (p356<=p10)
states: 19,040,684,707,043,302,493,640,836,113,363,118 (34)
.........MC time: 2m48.006sec

checking: [EF [[[EG [1<=p170] | AF [~ [p295<=p180]]] & 1<=p344]] | [EX [EF [~ [1<=p313]]] & AX [[[[[~ [1<=p585] | ~ [p185<=0]] & ~ [1<=p115]] | ~ [1<=p398]] & [[[[p451<=1 & 1<=p305] & [p552<=p387 | p326<=1]] | ~ [p511<=0]] | [EG [p39<=p58] | ~ [p134<=0]]]]]]]
normalized: [[~ [EX [~ [[[[~ [p134<=0] | EG [p39<=p58]] | [~ [p511<=0] | [[p552<=p387 | p326<=1] & [p451<=1 & 1<=p305]]]] & [~ [1<=p398] | [~ [1<=p115] & [~ [p185<=0] | ~ [1<=p585]]]]]]]] & EX [E [true U ~ [1<=p313]]]] | E [true U [1<=p344 & [~ [EG [p295<=p180]] | EG [1<=p170]]]]]

abstracting: (1<=p170)
states: 5,972,144,058,247,966,065,719,359,549,168,738 (33)

before gc: list nodes free: 8689165

after gc: idd nodes used:2788909, unused:61211091; list nodes free:263137546
.
EG iterations: 1
abstracting: (p295<=p180)
states: 19,170,102,864,269,701,979,696,764,441,540,786 (34)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6362456 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098240 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.003sec


iterations count:42512 (73), effective:1141 (1)

initing FirstDep: 0m 0.003sec


net_ddint.h:600: Timeout: after 381 sec


net_ddint.h:600: Timeout: after 339 sec


net_ddint.h:600: Timeout: after 301 sec


net_ddint.h:600: Timeout: after 267 sec


iterations count:590 (1), effective:2 (0)

net_ddint.h:600: Timeout: after 238 sec


sat_reach.icc:155: Timeout: after 211 sec


net_ddint.h:600: Timeout: after 187 sec


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

net_ddint.h:600: Timeout: after 167 sec


net_ddint.h:600: Timeout: after 148 sec

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-30"
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-30, 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-167840348700465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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