Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697200702.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANInsertWithFailure-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200702
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 00:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 00:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 00:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 00:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 202K 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 CANInsertWithFailure-PT-005-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678800580806

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=CANInsertWithFailure-PT-005
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:29:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:29:42] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-14 13:29:42] [INFO ] Transformed 114 places.
[2023-03-14 13:29:42] [INFO ] Transformed 180 transitions.
[2023-03-14 13:29:42] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 104 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 15) seen :3
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 180 rows 114 cols
[2023-03-14 13:29:43] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-14 13:29:43] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 13:29:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-14 13:29:43] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 13:29:44] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-14 13:29:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-14 13:29:44] [INFO ] After 68ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2023-03-14 13:29:44] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-14 13:29:44] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 56 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 179
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 7 rules applied. Total rules applied 9 place count 112 transition count 173
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 15 place count 106 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 106 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 105 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 104 transition count 171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 104 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 103 transition count 170
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 43 place count 103 transition count 170
Applied a total of 43 rules in 30 ms. Remains 103 /114 variables (removed 11) and now considering 170/180 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 103/114 places, 170/180 transitions.
Incomplete random walk after 10000 steps, including 119 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 170 rows 103 cols
[2023-03-14 13:29:44] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-14 13:29:44] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:29:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 13:29:44] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 13:29:44] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:29:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-14 13:29:44] [INFO ] After 40ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:29:44] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-14 13:29:44] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 35 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 170/170 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 103 transition count 165
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 98 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 98 transition count 164
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 12 place count 97 transition count 164
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 93 transition count 160
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 93 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 93 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 92 transition count 158
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 92 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 91 transition count 157
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 42 place count 91 transition count 157
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 51 place count 91 transition count 157
Applied a total of 51 rules in 24 ms. Remains 91 /103 variables (removed 12) and now considering 157/170 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 91/103 places, 157/170 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Probably explored full state space saw : 67677 states, properties seen :0
Probabilistic random walk after 372022 steps, saw 67677 distinct states, run finished after 1234 ms. (steps per millisecond=301 ) properties seen :0
Explored full state space saw : 67677 states, properties seen :0
Exhaustive walk after 372022 steps, saw 67677 distinct states, run finished after 1078 ms. (steps per millisecond=345 ) properties seen :0
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 4951 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 005
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: 114 places, 180 transitions, 500 arcs.
Final Score: 1691.473
Took : 5 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-00 (reachable & potential((! ( ( (tk(P92)) <= ( 0 ) ) | ( ( ( (! ( ( ( ( ( 1 ) <= (tk(P74)) ) & ( (tk(P1)) <= (tk(P76)) ) ) | (! ( ( 1 ) <= (tk(P15)) )) ) | ( (tk(P25)) <= ( 1 ) ) )) & ( (tk(P7)) <= ( 1 ) ) ) | ( ( ( (tk(P7)) <= ( 1 ) ) | (! ( ( (tk(P51)) <= (tk(P78)) ) & ( ( 1 ) <= (tk(P68)) ) )) ) & ( ( ( ( ( ( 1 ) <= (tk(P23)) ) & ( ( 1 ) <= (tk(P53)) ) ) | ( ( ( 1 ) <= (tk(P94)) ) | ( ( 1 ) <= (tk(P98)) ) ) ) | ( (! ( (tk(P61)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P114)) ) | ( (tk(P28)) <= ( 0 ) ) ) ) ) & ( ( (tk(P18)) <= (tk(P94)) ) | ( ( 1 ) <= (tk(P15)) ) ) ) ) ) | ( ( ( ( (tk(P26)) <= (tk(P46)) ) | ( ( ( ( ( 1 ) <= (tk(P99)) ) & ( (tk(P14)) <= ( 0 ) ) ) | ( (tk(P35)) <= ( 0 ) ) ) | ( ( ( (tk(P29)) <= (tk(P22)) ) & ( (tk(P94)) <= (tk(P17)) ) ) | ( ( (tk(P96)) <= ( 1 ) ) & ( (tk(P3)) <= ( 1 ) ) ) ) ) ) | (! ( ( (tk(P67)) <= ( 1 ) ) & ( (tk(P33)) <= ( 0 ) ) )) ) | ( (tk(P113)) <= ( 0 ) ) ) ) ))))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-01 (reachable & potential(( (! ( (tk(P62)) <= (tk(P47)) )) & ( (tk(P9)) <= ( 0 ) ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P30)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P13)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-04 (reachable & potential((! ( ( (! ( (! ( ( ( ( (tk(P28)) <= ( 0 ) ) & ( (tk(P97)) <= (tk(P72)) ) ) & ( ( (tk(P98)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P7)) ) ) ) | (! ( ( ( 1 ) <= (tk(P34)) ) | ( (tk(P3)) <= ( 1 ) ) )) )) | ( (tk(P72)) <= ( 1 ) ) )) | (! ( ( ( ( (! ( (tk(P16)) <= (tk(P103)) )) | ( ( 1 ) <= (tk(P89)) ) ) & (! ( ( (tk(P79)) <= ( 0 ) ) | ( (tk(P73)) <= (tk(P45)) ) )) ) & ( (tk(P110)) <= ( 1 ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P107)) ) | ( (tk(P3)) <= ( 1 ) ) ) & ( ( (tk(P111)) <= (tk(P45)) ) | ( ( 1 ) <= (tk(P66)) ) ) ) | ( (! ( (tk(P40)) <= ( 1 ) )) & ( ( 1 ) <= (tk(P54)) ) ) ) & ( (tk(P78)) <= (tk(P43)) ) ) )) ) | ( ( 1 ) <= (tk(P8)) ) ))))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P11)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-06 (reachable & potential(( (! ( ( (tk(P39)) <= (tk(P46)) ) | (! ( ( ( ( (tk(P103)) <= ( 0 ) ) | ( ( (tk(P9)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P68)) ) ) ) & ( (tk(P105)) <= ( 0 ) ) ) | ( ( ( ( ( 1 ) <= (tk(P100)) ) & ( ( 1 ) <= (tk(P48)) ) ) | ( (tk(P78)) <= (tk(P91)) ) ) & ( ( ( 1 ) <= (tk(P53)) ) | ( ( ( 1 ) <= (tk(P42)) ) | ( (tk(P56)) <= (tk(P15)) ) ) ) ) )) )) & (! ( ( ( ( (! ( ( 1 ) <= (tk(P45)) )) & ( ( (! ( ( 1 ) <= (tk(P67)) )) & ( ( ( 1 ) <= (tk(P41)) ) | ( ( 1 ) <= (tk(P26)) ) ) ) | ( ( (tk(P100)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P112)) )) ) ) ) & ( (! ( ( (tk(P20)) <= (tk(P23)) ) | ( (tk(P110)) <= ( 0 ) ) )) & ( (tk(P71)) <= (tk(P112)) ) ) ) | ( ( (! ( (! ( (tk(P87)) <= (tk(P93)) )) | (! ( ( 1 ) <= (tk(P22)) )) )) & (! ( ( 1 ) <= (tk(P69)) )) ) | ( (tk(P64)) <= (tk(P38)) ) ) ) | ( (! ( (tk(P100)) <= ( 1 ) )) & (! ( (! ( ( 1 ) <= (tk(P81)) )) & ( (tk(P2)) <= ( 1 ) ) )) ) )) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P26)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-08 (reachable & potential(( ( ( ( (! ( ( (! ( (tk(P27)) <= (tk(P12)) )) | ( (tk(P112)) <= (tk(P111)) ) ) & (! ( (tk(P29)) <= (tk(P73)) )) )) & ( ( ( ( 1 ) <= (tk(P45)) ) & ( (! ( ( 1 ) <= (tk(P8)) )) | ( (tk(P95)) <= ( 0 ) ) ) ) | ( ( ( ( ( (tk(P99)) <= ( 0 ) ) | ( (tk(P101)) <= (tk(P27)) ) ) & ( ( (tk(P14)) <= ( 1 ) ) & ( (tk(P72)) <= (tk(P30)) ) ) ) | ( (! ( (tk(P94)) <= (tk(P46)) )) | (! ( ( 1 ) <= (tk(P71)) )) ) ) & (! ( ( ( (tk(P68)) <= (tk(P43)) ) | ( (tk(P15)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P109)) )) )) ) ) ) | ( ( 1 ) <= (tk(P62)) ) ) & (! ( ( (! ( ( ( 1 ) <= (tk(P104)) ) & ( ( (tk(P10)) <= ( 0 ) ) & ( (tk(P92)) <= ( 1 ) ) ) )) & ( (tk(P7)) <= ( 0 ) ) ) & ( (! ( (tk(P81)) <= (tk(P90)) )) & ( ( (! ( ( 1 ) <= (tk(P13)) )) & (! ( ( (tk(P81)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P91)) ) )) ) & (! ( (! ( (tk(P27)) <= (tk(P43)) )) | ( (tk(P105)) <= (tk(P39)) ) )) ) ) )) ) & (! ( ( (tk(P63)) <= ( 0 ) ) & (! ( ( (! ( ( (tk(P55)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) )) & ( (! ( (tk(P66)) <= ( 0 ) )) | ( ( ( ( 1 ) <= (tk(P92)) ) & ( ( 1 ) <= (tk(P57)) ) ) & ( (tk(P88)) <= ( 1 ) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P10)) ) & ( ( (tk(P95)) <= (tk(P31)) ) | (! ( ( 1 ) <= (tk(P62)) )) ) ) & ( (! ( ( (tk(P107)) <= (tk(P107)) ) & ( (tk(P19)) <= (tk(P65)) ) )) | ( (tk(P34)) <= ( 0 ) ) ) ) )) )) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-09 (reachable &!potential( (! ( ( (tk(P8)) <= (tk(P79)) ) & ( (! ( ( ( ( (! ( (tk(P34)) <= (tk(P36)) )) | (! ( ( 1 ) <= (tk(P65)) )) ) & ( ( (tk(P26)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P59)) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P101)) )) & ( ( (tk(P97)) <= ( 1 ) ) & ( (tk(P74)) <= (tk(P68)) ) ) ) & ( ( ( (tk(P80)) <= ( 0 ) ) | ( (tk(P38)) <= (tk(P78)) ) ) | ( (tk(P18)) <= (tk(P23)) ) ) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P77)) ) | ( (tk(P11)) <= (tk(P68)) ) ) & ( ( ( 1 ) <= (tk(P49)) ) & ( ( 1 ) <= (tk(P89)) ) ) ) & (! ( (tk(P113)) <= (tk(P14)) )) ) & ( (! ( (tk(P84)) <= ( 0 ) )) & ( (! ( (tk(P4)) <= ( 0 ) )) | (! ( (tk(P8)) <= (tk(P28)) )) ) ) ) )) & ( ( 1 ) <= (tk(P29)) ) ) ))))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-10 (reachable &!potential( ( ( ( (! ( ( (tk(P5)) <= (tk(P40)) ) & ( ( ( (tk(P8)) <= ( 0 ) ) & (! ( ( ( 1 ) <= (tk(P86)) ) & ( ( 1 ) <= (tk(P31)) ) )) ) & ( (tk(P13)) <= ( 0 ) ) ) )) | ( ( ( ( (! ( ( (tk(P11)) <= ( 1 ) ) | ( (tk(P35)) <= ( 0 ) ) )) & ( (tk(P38)) <= ( 0 ) ) ) | ( (tk(P8)) <= (tk(P66)) ) ) & (! ( (tk(P99)) <= ( 1 ) )) ) | (! ( ( ( 1 ) <= (tk(P45)) ) | ( ( (tk(P42)) <= (tk(P80)) ) & (! ( ( 1 ) <= (tk(P67)) )) ) )) ) ) | ( ( (! ( (tk(P21)) <= (tk(P82)) )) | ( (! ( (tk(P13)) <= (tk(P38)) )) & ( ( 1 ) <= (tk(P60)) ) ) ) | (! ( ( ( (! ( ( ( 1 ) <= (tk(P52)) ) & ( ( 1 ) <= (tk(P97)) ) )) & ( (! ( ( 1 ) <= (tk(P6)) )) & ( ( ( 1 ) <= (tk(P42)) ) | ( (tk(P69)) <= (tk(P63)) ) ) ) ) & (! ( ( ( 1 ) <= (tk(P5)) ) | ( ( 1 ) <= (tk(P60)) ) )) ) & ( (! ( (tk(P97)) <= (tk(P88)) )) & ( (tk(P13)) <= ( 1 ) ) ) )) ) ) | ( (tk(P102)) <= (tk(P107)) ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-11 (reachable & potential(( ( ( ( (tk(P37)) <= (tk(P4)) ) | ( ( (! ( (tk(P37)) <= (tk(P92)) )) & ( ( ( (tk(P96)) <= (tk(P43)) ) | ( ( (tk(P40)) <= ( 1 ) ) | ( (tk(P3)) <= (tk(P52)) ) ) ) & ( ( ( (tk(P45)) <= (tk(P35)) ) | ( ( (tk(P84)) <= (tk(P62)) ) & ( (tk(P10)) <= ( 1 ) ) ) ) & ( ( (tk(P71)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P85)) ) & ( (tk(P55)) <= (tk(P99)) ) ) ) ) ) ) & ( (tk(P96)) <= ( 0 ) ) ) ) | ( (! ( ( ( ( 1 ) <= (tk(P113)) ) & (! ( (tk(P37)) <= (tk(P17)) )) ) & ( (tk(P25)) <= (tk(P15)) ) )) & ( (! ( (tk(P71)) <= (tk(P11)) )) & ( ( 1 ) <= (tk(P6)) ) ) ) ) & ( ( (tk(P14)) <= (tk(P31)) ) & ( ( ( (! ( ( (tk(P113)) <= (tk(P40)) ) & (! ( ( (tk(P44)) <= (tk(P49)) ) & ( (tk(P82)) <= (tk(P77)) ) )) )) | (! ( ( 1 ) <= (tk(P58)) )) ) | ( ( ( ( (tk(P102)) <= (tk(P106)) ) | (! ( ( 1 ) <= (tk(P85)) )) ) | ( ( (tk(P45)) <= ( 0 ) ) | ( (tk(P32)) <= (tk(P66)) ) ) ) & (! ( (tk(P64)) <= (tk(P61)) )) ) ) & ( ( ( (tk(P70)) <= (tk(P56)) ) & ( ( ( (! ( (tk(P108)) <= ( 0 ) )) & ( ( (tk(P37)) <= ( 1 ) ) & ( (tk(P98)) <= (tk(P82)) ) ) ) & ( ( ( (tk(P67)) <= (tk(P35)) ) & ( (tk(P53)) <= (tk(P1)) ) ) | (! ( ( 1 ) <= (tk(P39)) )) ) ) & ( ( (tk(P106)) <= (tk(P19)) ) & ( (tk(P11)) <= (tk(P86)) ) ) ) ) & ( ( ( 1 ) <= (tk(P93)) ) & ( ( ( ( (tk(P93)) <= (tk(P99)) ) | ( (tk(P103)) <= ( 0 ) ) ) & ( (tk(P74)) <= (tk(P1)) ) ) & ( ( 1 ) <= (tk(P58)) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-12 (reachable & potential(( ( (tk(P96)) <= (tk(P42)) ) & (! ( (tk(P7)) <= ( 0 ) )) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-13 (reachable &!potential( ( ( 1 ) <= (tk(P86)) )))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-14 (reachable & potential((! ( ( ( ( 1 ) <= (tk(P23)) ) & ( (! ( (! ( ( ( (tk(P36)) <= (tk(P45)) ) | ( ( 1 ) <= (tk(P24)) ) ) | ( (tk(P110)) <= (tk(P55)) ) )) & ( ( 1 ) <= (tk(P76)) ) )) | ( ( ( (tk(P44)) <= ( 0 ) ) | (! ( ( (tk(P41)) <= ( 1 ) ) & (! ( (tk(P30)) <= ( 0 ) )) )) ) | ( ( (tk(P100)) <= ( 1 ) ) | ( ( (! ( ( 1 ) <= (tk(P56)) )) | ( ( (tk(P43)) <= ( 0 ) ) & ( (tk(P70)) <= ( 1 ) ) ) ) | ( ( (tk(P84)) <= (tk(P68)) ) | (! ( ( 1 ) <= (tk(P105)) )) ) ) ) ) ) ) | ( ( ( (! ( ( (tk(P98)) <= (tk(P92)) ) & (! ( ( (tk(P81)) <= (tk(P30)) ) | ( (tk(P44)) <= ( 0 ) ) )) )) | (! ( (tk(P25)) <= ( 0 ) )) ) & ( (tk(P108)) <= (tk(P87)) ) ) | ( ( (! ( (tk(P73)) <= (tk(P26)) )) & ( ( ( ( ( 1 ) <= (tk(P12)) ) | (! ( (tk(P60)) <= ( 1 ) )) ) | ( (tk(P111)) <= ( 0 ) ) ) & ( ( (tk(P58)) <= (tk(P34)) ) & ( (tk(P72)) <= (tk(P26)) ) ) ) ) & ( (tk(P41)) <= ( 0 ) ) ) ) ))))
PROPERTY: CANInsertWithFailure-PT-005-ReachabilityCardinality-15 (reachable & potential((! ( (tk(P44)) <= ( 1 ) ))))
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678800679825

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r043-tajo-167813697200702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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