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.r171-tall-167838858700518.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 smartxred
Input is FlexibleBarrier-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858700518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 12:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 536K 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 FlexibleBarrier-PT-12b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679478192731

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 09:43:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:43:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:43:14] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-22 09:43:14] [INFO ] Transformed 1988 places.
[2023-03-22 09:43:14] [INFO ] Transformed 2289 transitions.
[2023-03-22 09:43:14] [INFO ] Found NUPN structural information;
[2023-03-22 09:43:14] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 116 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 13) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2289 rows 1988 cols
[2023-03-22 09:43:15] [INFO ] Computed 14 place invariants in 46 ms
[2023-03-22 09:43:16] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 09:43:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-22 09:43:18] [INFO ] After 1566ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-22 09:43:19] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 7 ms to minimize.
[2023-03-22 09:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2023-03-22 09:43:20] [INFO ] Deduced a trap composed of 118 places in 641 ms of which 1 ms to minimize.
[2023-03-22 09:43:20] [INFO ] Deduced a trap composed of 647 places in 539 ms of which 2 ms to minimize.
[2023-03-22 09:43:21] [INFO ] Deduced a trap composed of 644 places in 449 ms of which 2 ms to minimize.
[2023-03-22 09:43:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1937 ms
[2023-03-22 09:43:22] [INFO ] Deduced a trap composed of 711 places in 665 ms of which 2 ms to minimize.
[2023-03-22 09:43:23] [INFO ] Deduced a trap composed of 658 places in 597 ms of which 1 ms to minimize.
[2023-03-22 09:43:23] [INFO ] Deduced a trap composed of 659 places in 577 ms of which 2 ms to minimize.
[2023-03-22 09:43:24] [INFO ] Deduced a trap composed of 641 places in 552 ms of which 2 ms to minimize.
[2023-03-22 09:43:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2771 ms
[2023-03-22 09:43:25] [INFO ] Deduced a trap composed of 714 places in 513 ms of which 2 ms to minimize.
[2023-03-22 09:43:25] [INFO ] Deduced a trap composed of 655 places in 495 ms of which 1 ms to minimize.
[2023-03-22 09:43:26] [INFO ] Deduced a trap composed of 677 places in 468 ms of which 1 ms to minimize.
[2023-03-22 09:43:26] [INFO ] Deduced a trap composed of 682 places in 490 ms of which 1 ms to minimize.
[2023-03-22 09:43:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2327 ms
[2023-03-22 09:43:27] [INFO ] Deduced a trap composed of 693 places in 586 ms of which 1 ms to minimize.
[2023-03-22 09:43:28] [INFO ] Deduced a trap composed of 643 places in 537 ms of which 1 ms to minimize.
[2023-03-22 09:43:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1332 ms
[2023-03-22 09:43:28] [INFO ] Deduced a trap composed of 705 places in 554 ms of which 2 ms to minimize.
[2023-03-22 09:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 696 ms
[2023-03-22 09:43:29] [INFO ] After 11811ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 820 ms.
[2023-03-22 09:43:30] [INFO ] After 13576ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 268 ms.
Support contains 48 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1864 edges and 1988 vertex of which 62 / 1988 are part of one of the 10 SCC in 21 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 476 place count 1936 transition count 1751
Reduce places removed 475 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 486 rules applied. Total rules applied 962 place count 1461 transition count 1740
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 973 place count 1450 transition count 1740
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 973 place count 1450 transition count 1616
Deduced a syphon composed of 124 places in 2 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 1221 place count 1326 transition count 1616
Discarding 725 places :
Symmetric choice reduction at 3 with 725 rule applications. Total rules 1946 place count 601 transition count 891
Iterating global reduction 3 with 725 rules applied. Total rules applied 2671 place count 601 transition count 891
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2671 place count 601 transition count 885
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2683 place count 595 transition count 885
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 2784 place count 494 transition count 784
Iterating global reduction 3 with 101 rules applied. Total rules applied 2885 place count 494 transition count 784
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 3 with 94 rules applied. Total rules applied 2979 place count 494 transition count 690
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 3119 place count 424 transition count 620
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 3137 place count 424 transition count 602
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 3145 place count 416 transition count 594
Iterating global reduction 5 with 8 rules applied. Total rules applied 3153 place count 416 transition count 594
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3157 place count 414 transition count 606
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3160 place count 414 transition count 603
Free-agglomeration rule applied 282 times.
Iterating global reduction 5 with 282 rules applied. Total rules applied 3442 place count 414 transition count 321
Reduce places removed 282 places and 0 transitions.
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 5 with 366 rules applied. Total rules applied 3808 place count 132 transition count 237
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 3821 place count 132 transition count 224
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3822 place count 132 transition count 224
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3824 place count 132 transition count 224
Applied a total of 3824 rules in 446 ms. Remains 132 /1988 variables (removed 1856) and now considering 224/2289 (removed 2065) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 132/1988 places, 224/2289 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :5
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:43:30] [INFO ] Flow matrix only has 204 transitions (discarded 20 similar events)
// Phase 1: matrix 204 rows 132 cols
[2023-03-22 09:43:30] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-22 09:43:30] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 09:43:30] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:30] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-22 09:43:30] [INFO ] After 23ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:31] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2023-03-22 09:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-22 09:43:31] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 09:43:31] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 224/224 transitions.
Graph (trivial) has 53 edges and 132 vertex of which 5 / 132 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 129 transition count 209
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 119 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 119 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 118 transition count 208
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 38 place count 103 transition count 193
Iterating global reduction 2 with 15 rules applied. Total rules applied 53 place count 103 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 103 transition count 191
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 83 place count 89 transition count 177
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 109 place count 89 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 112 place count 86 transition count 148
Iterating global reduction 4 with 3 rules applied. Total rules applied 115 place count 86 transition count 148
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 86 transition count 143
Free-agglomeration rule applied 7 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 127 place count 86 transition count 135
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 147 place count 79 transition count 122
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 79 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 78 transition count 119
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1979.t12.t1510.t1511.t1489.t1490 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 58 edges and 76 vertex of which 20 / 76 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 153 place count 66 transition count 117
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 173 place count 66 transition count 97
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 173 place count 66 transition count 84
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 199 place count 53 transition count 84
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 211 place count 53 transition count 72
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 233 place count 42 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 235 place count 41 transition count 71
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 245 place count 41 transition count 61
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 256 place count 41 transition count 50
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 289 place count 23 transition count 35
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 292 place count 23 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 293 place count 23 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 294 place count 22 transition count 31
Applied a total of 294 rules in 45 ms. Remains 22 /132 variables (removed 110) and now considering 31/224 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 22/132 places, 31/224 transitions.
Finished random walk after 186 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=186 )
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16943 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 12b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1988 places, 2289 transitions, 5727 arcs.
Final Score: 378914.093
Took : 87 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-00 (reachable & potential((! ( (tk(P22)) <= (tk(P1040)) ))))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-01 (reachable & potential(( ( (! ( ( ( 1 ) <= (tk(P233)) ) & ( (! ( (tk(P1136)) <= (tk(P1365)) )) & ( ( 1 ) <= (tk(P963)) ) ) )) | ( ( ( (tk(P1621)) <= (tk(P23)) ) & ( ( 1 ) <= (tk(P975)) ) ) & ( (! ( (! ( (tk(P637)) <= (tk(P1571)) )) & ( ( ( ( (tk(P1941)) <= (tk(P336)) ) | ( (tk(P1174)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P60)) ) ) | ( (tk(P1307)) <= (tk(P861)) ) ) )) | ( (! ( ( ( (tk(P407)) <= ( 1 ) ) | (! ( (tk(P117)) <= (tk(P1112)) )) ) | ( ( ( (tk(P324)) <= (tk(P1885)) ) | ( (tk(P830)) <= ( 0 ) ) ) & ( (tk(P539)) <= ( 1 ) ) ) )) & (! ( ( (tk(P1144)) <= (tk(P1535)) ) & ( (tk(P1132)) <= (tk(P1500)) ) )) ) ) ) ) & (! ( ( ( (tk(P1919)) <= (tk(P1682)) ) | ( (! ( ( ( 1 ) <= (tk(P392)) ) | ( (tk(P1080)) <= ( 1 ) ) )) & ( ( 1 ) <= (tk(P672)) ) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P937)) ) & ( (tk(P727)) <= (tk(P1729)) ) ) & (! ( ( (tk(P42)) <= (tk(P1768)) ) | ( (tk(P1281)) <= ( 0 ) ) )) ) & ( ( ( ( 1 ) <= (tk(P1521)) ) & ( (tk(P1545)) <= ( 0 ) ) ) & (! ( (tk(P1042)) <= (tk(P1315)) )) ) ) & ( (! ( ( ( 1 ) <= (tk(P1027)) ) | ( ( 1 ) <= (tk(P1117)) ) )) & (! ( ( ( ( 1 ) <= (tk(P962)) ) & ( (tk(P471)) <= (tk(P643)) ) ) | ( ( ( 1 ) <= (tk(P310)) ) & ( (tk(P1853)) <= (tk(P1405)) ) ) )) ) ) )) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P446)) <= ( 0 ) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-03 (reachable &!potential( ( (! ( ( ( ( 1 ) <= (tk(P439)) ) | (! ( ( ( (tk(P1594)) <= ( 0 ) ) | ( (! ( ( 1 ) <= (tk(P126)) )) | (! ( (tk(P388)) <= (tk(P1004)) )) ) ) & (! ( (tk(P617)) <= ( 0 ) )) )) ) & (! ( ( 1 ) <= (tk(P1719)) )) )) | ( ( (! ( (! ( (tk(P1977)) <= (tk(P332)) )) | ( (tk(P1812)) <= ( 0 ) ) )) | ( ( (tk(P1184)) <= ( 0 ) ) | (! ( (tk(P902)) <= (tk(P1912)) )) ) ) | (! ( (tk(P1852)) <= ( 1 ) )) ) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-04 (reachable & potential(( (! ( (tk(P1266)) <= ( 0 ) )) & (! ( ( ( (tk(P679)) <= (tk(P1076)) ) | ( (tk(P380)) <= ( 1 ) ) ) & ( ( (! ( ( ( ( ( 1 ) <= (tk(P1332)) ) | ( ( 1 ) <= (tk(P1210)) ) ) & ( ( (tk(P1604)) <= ( 1 ) ) & ( (tk(P1234)) <= ( 1 ) ) ) ) & (! ( ( (tk(P561)) <= (tk(P1600)) ) | ( ( 1 ) <= (tk(P1890)) ) )) )) & ( ( (tk(P943)) <= (tk(P289)) ) | (! ( ( (tk(P1444)) <= (tk(P1236)) ) & ( ( 1 ) <= (tk(P848)) ) )) ) ) & (! ( ( ( ( ( (tk(P81)) <= (tk(P1261)) ) | ( (tk(P1380)) <= (tk(P1562)) ) ) & ( (tk(P429)) <= (tk(P595)) ) ) | ( ( 1 ) <= (tk(P630)) ) ) | (! ( (! ( (tk(P512)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P1447)) ) & ( (tk(P1628)) <= ( 1 ) ) ) )) )) ) )) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-05 (reachable & potential((! ( ( (tk(P6)) <= ( 1 ) ) & ( ( ( ( (! ( ( ( ( 1 ) <= (tk(P154)) ) | ( (tk(P481)) <= ( 1 ) ) ) & (! ( (tk(P343)) <= (tk(P1028)) )) )) & ( ( ( 1 ) <= (tk(P1817)) ) | ( ( ( (tk(P1065)) <= (tk(P598)) ) & ( (tk(P11)) <= (tk(P562)) ) ) | ( ( (tk(P1251)) <= ( 0 ) ) | ( (tk(P1927)) <= (tk(P1177)) ) ) ) ) ) & ( (! ( (tk(P792)) <= ( 0 ) )) & (! ( (! ( (tk(P1358)) <= (tk(P276)) )) | ( ( 1 ) <= (tk(P308)) ) )) ) ) & ( ( ( 1 ) <= (tk(P471)) ) | ( (! ( ( ( (tk(P1972)) <= ( 0 ) ) & ( (tk(P622)) <= ( 1 ) ) ) & ( (tk(P383)) <= ( 1 ) ) )) | ( ( ( 1 ) <= (tk(P1598)) ) & ( ( ( (tk(P1651)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P112)) ) ) | (! ( ( 1 ) <= (tk(P1305)) )) ) ) ) ) ) | ( ( (tk(P1534)) <= (tk(P115)) ) & ( ( (tk(P870)) <= (tk(P1726)) ) & ( ( (tk(P498)) <= ( 0 ) ) | ( (tk(P1558)) <= ( 0 ) ) ) ) ) ) ))))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P925)) <= (tk(P1392)) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-07 (reachable & potential(( ( (! ( (tk(P237)) <= (tk(P1877)) )) | ( ( (tk(P583)) <= ( 0 ) ) | ( (tk(P1693)) <= ( 1 ) ) ) ) & (! ( ( ( ( ( (! ( ( (tk(P1416)) <= ( 0 ) ) & ( (tk(P457)) <= (tk(P56)) ) )) | ( ( (tk(P1955)) <= (tk(P356)) ) | (! ( (tk(P746)) <= (tk(P1152)) )) ) ) | (! ( ( (tk(P1946)) <= ( 0 ) ) | ( ( (tk(P87)) <= (tk(P1041)) ) | ( (tk(P191)) <= ( 0 ) ) ) )) ) & (! ( ( ( ( (tk(P890)) <= (tk(P1905)) ) | ( ( 1 ) <= (tk(P964)) ) ) | ( ( (tk(P604)) <= ( 0 ) ) & ( (tk(P1107)) <= (tk(P727)) ) ) ) & ( ( ( 1 ) <= (tk(P1938)) ) & ( (tk(P1203)) <= (tk(P1615)) ) ) )) ) | ( (tk(P105)) <= (tk(P1311)) ) ) | ( (tk(P1393)) <= ( 0 ) ) )) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P1582)) <= (tk(P127)) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-09 (reachable & potential(( ( ( 1 ) <= (tk(P1303)) ) & (! ( ( ( ( ( ( (tk(P372)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1129)) ) ) & ( (tk(P1322)) <= (tk(P1328)) ) ) & ( (tk(P800)) <= (tk(P1944)) ) ) | ( (! ( (tk(P1859)) <= (tk(P1382)) )) & (! ( (tk(P217)) <= ( 1 ) )) ) ) | ( (! ( (tk(P455)) <= (tk(P1380)) )) & (! ( (! ( ( ( (tk(P1346)) <= ( 1 ) ) | ( (tk(P1856)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P1298)) ) & ( (tk(P1687)) <= (tk(P1532)) ) ) )) & ( (tk(P1784)) <= ( 1 ) ) )) ) )) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-10 (reachable & potential(( ( (tk(P1600)) <= (tk(P1088)) ) & ( (! ( (tk(P1206)) <= ( 1 ) )) & (! ( (! ( (! ( (tk(P1900)) <= ( 1 ) )) | (! ( ( ( ( 1 ) <= (tk(P459)) ) | ( ( 1 ) <= (tk(P1309)) ) ) & ( (tk(P1763)) <= (tk(P1301)) ) )) )) & ( ( ( ( ( (tk(P836)) <= ( 0 ) ) & ( ( (tk(P445)) <= (tk(P136)) ) & ( (tk(P1777)) <= ( 1 ) ) ) ) | (! ( ( ( 1 ) <= (tk(P352)) ) | ( (tk(P36)) <= (tk(P655)) ) )) ) | ( (tk(P1849)) <= (tk(P590)) ) ) & ( ( ( (! ( ( 1 ) <= (tk(P1704)) )) & (! ( (tk(P171)) <= (tk(P681)) )) ) | ( ( ( (tk(P509)) <= (tk(P1040)) ) | ( ( 1 ) <= (tk(P730)) ) ) & ( (tk(P1035)) <= ( 1 ) ) ) ) & ( (! ( ( ( 1 ) <= (tk(P87)) ) & ( (tk(P1127)) <= (tk(P1317)) ) )) & (! ( ( (tk(P361)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1130)) ) )) ) ) ) )) ) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P1533)) <= ( 0 ) ))))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-12 (reachable & potential(( ( ( ( ( 1 ) <= (tk(P857)) ) | ( (! ( ( ( (! ( ( 1 ) <= (tk(P1341)) )) | ( ( ( 1 ) <= (tk(P1743)) ) & ( (tk(P429)) <= ( 1 ) ) ) ) & (! ( (tk(P1813)) <= (tk(P132)) )) ) & ( ( ( ( 1 ) <= (tk(P843)) ) & ( (tk(P1964)) <= (tk(P279)) ) ) | ( ( ( (tk(P255)) <= ( 1 ) ) & ( (tk(P243)) <= ( 1 ) ) ) | ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P722)) ) ) ) ) )) & (! ( (tk(P11)) <= ( 1 ) )) ) ) & ( (! ( ( ( ( ( (tk(P183)) <= ( 1 ) ) | ( ( (tk(P316)) <= (tk(P1217)) ) | ( (tk(P358)) <= (tk(P1580)) ) ) ) | ( ( (tk(P978)) <= (tk(P552)) ) | ( ( (tk(P667)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P631)) ) ) ) ) | ( (tk(P140)) <= ( 1 ) ) ) | ( ( ( ( (tk(P1634)) <= (tk(P601)) ) | (! ( ( 1 ) <= (tk(P888)) )) ) | ( (tk(P282)) <= ( 0 ) ) ) | ( ( (! ( (tk(P86)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P1091)) ) | ( ( 1 ) <= (tk(P385)) ) ) ) & ( ( ( (tk(P1702)) <= (tk(P1008)) ) & ( ( 1 ) <= (tk(P792)) ) ) & ( ( (tk(P596)) <= (tk(P1468)) ) & ( (tk(P1979)) <= ( 0 ) ) ) ) ) ) )) & ( (! ( (! ( (tk(P700)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P796)) )) )) | ( ( ( 1 ) <= (tk(P1699)) ) | ( (tk(P734)) <= ( 1 ) ) ) ) ) ) & ( ( ( 1 ) <= (tk(P1248)) ) | ( (! ( (tk(P150)) <= (tk(P1523)) )) | (! ( ( ( ( ( (tk(P999)) <= (tk(P1872)) ) & ( (tk(P1023)) <= (tk(P1459)) ) ) & (! ( (tk(P397)) <= ( 1 ) )) ) | ( ( ( ( 1 ) <= (tk(P1063)) ) | ( (tk(P1549)) <= ( 1 ) ) ) & ( ( (tk(P625)) <= ( 1 ) ) | ( (tk(P1378)) <= (tk(P1636)) ) ) ) ) & ( ( ( ( (tk(P478)) <= (tk(P1775)) ) & ( ( 1 ) <= (tk(P1296)) ) ) & ( ( ( 1 ) <= (tk(P209)) ) & ( (tk(P1880)) <= (tk(P786)) ) ) ) & (! ( ( (tk(P735)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1139)) ) )) ) )) ) ) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-13 (reachable & potential(( ( ( ( 1 ) <= (tk(P1476)) ) | (! ( (! ( (tk(P1655)) <= ( 0 ) )) | ( (tk(P724)) <= (tk(P1840)) ) )) ) & ( ( ( ( (tk(P3)) <= ( 0 ) ) | ( (tk(P1948)) <= (tk(P316)) ) ) | ( (! ( ( ( ( ( 1 ) <= (tk(P489)) ) | ( ( 1 ) <= (tk(P420)) ) ) | ( ( 1 ) <= (tk(P564)) ) ) & ( ( ( ( ( 1 ) <= (tk(P515)) ) & ( ( 1 ) <= (tk(P432)) ) ) & ( (tk(P960)) <= ( 1 ) ) ) & ( ( (tk(P1952)) <= ( 1 ) ) | ( ( (tk(P960)) <= (tk(P300)) ) & ( (tk(P769)) <= (tk(P601)) ) ) ) ) )) & ( (! ( (tk(P126)) <= ( 1 ) )) | ( (! ( (! ( (tk(P291)) <= (tk(P1723)) )) | ( (tk(P92)) <= (tk(P1372)) ) )) | ( (! ( ( ( 1 ) <= (tk(P1756)) ) | ( ( 1 ) <= (tk(P1334)) ) )) | ( (! ( (tk(P97)) <= (tk(P1598)) )) | (! ( ( 1 ) <= (tk(P1484)) )) ) ) ) ) ) ) & ( ( ( (! ( (! ( (tk(P1064)) <= (tk(P273)) )) & ( ( ( (tk(P1355)) <= ( 1 ) ) | ( (tk(P593)) <= (tk(P1426)) ) ) & ( ( ( 1 ) <= (tk(P779)) ) | ( ( 1 ) <= (tk(P1605)) ) ) ) )) & ( ( 1 ) <= (tk(P957)) ) ) & ( (tk(P881)) <= ( 0 ) ) ) | (! ( ( ( ( ( ( ( 1 ) <= (tk(P849)) ) | ( ( 1 ) <= (tk(P32)) ) ) & ( ( ( 1 ) <= (tk(P1126)) ) | ( (tk(P748)) <= (tk(P1238)) ) ) ) | ( (! ( (tk(P205)) <= (tk(P1150)) )) & ( ( ( 1 ) <= (tk(P921)) ) & ( (tk(P1662)) <= (tk(P885)) ) ) ) ) & ( (! ( (tk(P45)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P1160)) ) & (! ( (tk(P508)) <= (tk(P877)) )) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P129)) ) & ( (tk(P1149)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P1933)) ) | ( (tk(P1703)) <= ( 1 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P317)) )) & ( ( ( 1 ) <= (tk(P365)) ) | ( (tk(P648)) <= (tk(P946)) ) ) ) ) | ( (! ( ( (tk(P1529)) <= ( 1 ) ) & ( (tk(P384)) <= (tk(P1980)) ) )) | ( ( ( (tk(P1586)) <= (tk(P1813)) ) | ( (tk(P78)) <= (tk(P143)) ) ) | ( ( (tk(P1808)) <= ( 1 ) ) & ( (tk(P1771)) <= (tk(P1483)) ) ) ) ) ) )) ) ) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( ( (tk(P1350)) <= (tk(P141)) ) | ( (! ( (tk(P578)) <= ( 0 ) )) & ( ( (tk(P1242)) <= ( 1 ) ) | ( ( ( ( (tk(P330)) <= (tk(P554)) ) & ( (tk(P556)) <= ( 1 ) ) ) & ( (tk(P529)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P1310)) ) ) ) ) ) | ( (! ( (! ( ( (tk(P1170)) <= ( 1 ) ) | ( (tk(P1116)) <= ( 1 ) ) )) & ( (tk(P1103)) <= ( 1 ) ) )) | ( (tk(P1696)) <= ( 1 ) ) ) ) | ( (! ( (tk(P797)) <= ( 0 ) )) & ( ( ( ( ( 1 ) <= (tk(P5)) ) | ( ( (tk(P1380)) <= (tk(P719)) ) | (! ( ( ( 1 ) <= (tk(P403)) ) & ( (tk(P55)) <= (tk(P771)) ) )) ) ) & (! ( (! ( ( 1 ) <= (tk(P1495)) )) & ( (! ( (tk(P1087)) <= (tk(P877)) )) & (! ( (tk(P456)) <= (tk(P1683)) )) ) )) ) & ( (tk(P367)) <= ( 0 ) ) ) ) ) | ( ( (! ( ( (tk(P1759)) <= (tk(P758)) ) & ( (tk(P904)) <= (tk(P407)) ) )) & ( (! ( ( ( ( (tk(P1185)) <= (tk(P914)) ) & (! ( (tk(P1382)) <= ( 0 ) )) ) & ( (! ( ( 1 ) <= (tk(P619)) )) | ( ( ( 1 ) <= (tk(P1146)) ) & ( (tk(P341)) <= ( 0 ) ) ) ) ) | ( ( ( (tk(P308)) <= (tk(P391)) ) | (! ( (tk(P512)) <= ( 1 ) )) ) & ( ( (tk(P1474)) <= ( 1 ) ) | ( (tk(P387)) <= (tk(P972)) ) ) ) )) & (! ( (! ( ( ( ( 1 ) <= (tk(P203)) ) & ( ( 1 ) <= (tk(P1598)) ) ) & ( ( (tk(P1209)) <= ( 0 ) ) & ( (tk(P1721)) <= (tk(P97)) ) ) )) | ( ( (tk(P1397)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P576)) ) ) )) ) ) & (! ( (tk(P247)) <= ( 0 ) )) ) )))
PROPERTY: FlexibleBarrier-PT-12b-ReachabilityCardinality-15 (reachable & potential((! ( (tk(P1142)) <= ( 0 ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5148640 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104176 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is FlexibleBarrier-PT-12b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838858700518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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