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.r235-tall-167856421900526.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 LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C2-ReachabilityCardinality-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678666865088

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=LeafsetExtension-PT-S64C2
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 00:21:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:21:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:21:07] [INFO ] Load time of PNML (sax parser for PT used): 529 ms
[2023-03-13 00:21:07] [INFO ] Transformed 21462 places.
[2023-03-13 00:21:07] [INFO ] Transformed 21129 transitions.
[2023-03-13 00:21:07] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 691 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 551 resets, run finished after 772 ms. (steps per millisecond=12 ) properties (out of 16) seen :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 00:21:11] [INFO ] Computed 333 place invariants in 2640 ms
[2023-03-13 00:21:17] [INFO ] [Real]Absence check using 67 positive place invariants in 68 ms returned sat
[2023-03-13 00:21:18] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 891 ms returned sat
[2023-03-13 00:21:18] [INFO ] After 7119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-13 00:21:24] [INFO ] [Nat]Absence check using 67 positive place invariants in 71 ms returned sat
[2023-03-13 00:21:24] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 766 ms returned sat
[2023-03-13 00:21:43] [INFO ] After 17606ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-13 00:21:43] [INFO ] After 17647ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-13 00:21:43] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 14 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 827 are kept as prefixes of interest. Removing 20635 places using SCC suffix rule.31 ms
Discarding 20635 places :
Also discarding 12018 output transitions
Drop transitions removed 12018 transitions
Drop transitions removed 4269 transitions
Reduce isomorphic transitions removed 4269 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 0 with 4555 rules applied. Total rules applied 4556 place count 827 transition count 4556
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 297 rules applied. Total rules applied 4853 place count 539 transition count 4547
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 4862 place count 530 transition count 4547
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 4862 place count 530 transition count 4536
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 4884 place count 519 transition count 4536
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4886 place count 519 transition count 4534
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4888 place count 517 transition count 4534
Partial Free-agglomeration rule applied 279 times.
Drop transitions removed 279 transitions
Iterating global reduction 4 with 279 rules applied. Total rules applied 5167 place count 517 transition count 4534
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 4 with 9 rules applied. Total rules applied 5176 place count 508 transition count 4534
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 5183 place count 508 transition count 4527
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 5190 place count 501 transition count 4527
Applied a total of 5190 rules in 771 ms. Remains 501 /21462 variables (removed 20961) and now considering 4527/21129 (removed 16602) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 501/21462 places, 4527/21129 transitions.
Incomplete random walk after 10000 steps, including 1953 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :2
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:21:44] [INFO ] Flow matrix only has 725 transitions (discarded 3802 similar events)
// Phase 1: matrix 725 rows 501 cols
[2023-03-13 00:21:44] [INFO ] Computed 2 place invariants in 26 ms
[2023-03-13 00:21:44] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:21:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 00:21:45] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:21:45] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-13 00:21:45] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 10 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 4527/4527 transitions.
Graph (complete) has 1304 edges and 501 vertex of which 401 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 401 transition count 4427
Applied a total of 98 rules in 55 ms. Remains 401 /501 variables (removed 100) and now considering 4427/4527 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 401/501 places, 4427/4527 transitions.
Incomplete random walk after 10000 steps, including 1954 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 38590 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{1=1}
Probabilistic random walk after 38590 steps, saw 14059 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-13 00:21:48] [INFO ] Flow matrix only has 528 transitions (discarded 3899 similar events)
// Phase 1: matrix 528 rows 401 cols
[2023-03-13 00:21:48] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-13 00:21:48] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:21:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 00:21:49] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:21:49] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 00:21:49] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 4427/4427 transitions.
Graph (complete) has 980 edges and 401 vertex of which 297 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.0 ms
Discarding 104 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 297 transition count 4324
Applied a total of 100 rules in 51 ms. Remains 297 /401 variables (removed 104) and now considering 4324/4427 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 297/401 places, 4324/4427 transitions.
Incomplete random walk after 10000 steps, including 1966 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35940 steps, run visited all 1 properties in 2819 ms. (steps per millisecond=12 )
Probabilistic random walk after 35940 steps, saw 13361 distinct states, run finished after 2820 ms. (steps per millisecond=12 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 45660 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LeafsetExtension (PT), instance S64C2
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: 21462 places, 21129 transitions, 67740 arcs.
Final Score: 5.1095174118E7
Took : 283 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-00 (reachable & potential(( ( 1 ) <= (tk(P12750)) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P9983)) <= ( 2 ) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-02 (reachable & potential((! ( ( (tk(P9397)) <= (tk(P20333)) ) | ( (tk(P19442)) <= (tk(P5760)) ) ))))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-03 (reachable &!potential( ( (! ( (tk(P21003)) <= (tk(P87)) )) | ( ( (tk(P305)) <= (tk(P18843)) ) | ( (tk(P1323)) <= (tk(P4852)) ) ) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-04 (reachable & potential((! ( (tk(P16282)) <= (tk(P2686)) ))))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( ( ( (tk(P1981)) <= ( 1 ) ) | ( (tk(P3295)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P15971)) ) ) & ( (tk(P17624)) <= (tk(P17016)) ) ) | ( ( ( (tk(P8858)) <= (tk(P3027)) ) & ( ( ( (tk(P6277)) <= ( 1 ) ) | ( ( ( (tk(P7328)) <= (tk(P14346)) ) | ( (tk(P10119)) <= (tk(P4491)) ) ) | ( ( 1 ) <= (tk(P18992)) ) ) ) | ( ( 1 ) <= (tk(P16395)) ) ) ) | (! ( ( 1 ) <= (tk(P16984)) )) ) ) | ( (tk(P8869)) <= ( 2 ) ) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-06 (reachable & potential((! ( ( (! ( (tk(P14527)) <= (tk(P13553)) )) & ( ( 1 ) <= (tk(P2941)) ) ) | (! ( ( (! ( (tk(P12532)) <= ( 2 ) )) & ( ( ( (tk(P10924)) <= (tk(P1626)) ) & ( ( 2 ) <= (tk(P11760)) ) ) & (! ( ( 2 ) <= (tk(P1852)) )) ) ) & ( ( 2 ) <= (tk(P9419)) ) )) ))))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-07 (reachable &!potential( (! ( ( 1 ) <= (tk(P11111)) ))))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P14050)) <= (tk(P15553)) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-09 (reachable &!potential( ( (tk(P7742)) <= ( 2 ) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-10 (reachable & potential((! ( ( (! ( ( 2 ) <= (tk(P6003)) )) | ( ( (! ( ( ( 1 ) <= (tk(P8910)) ) | ( (tk(P14190)) <= ( 2 ) ) )) | ( ( (! ( ( 2 ) <= (tk(P11567)) )) | ( ( (tk(P19796)) <= (tk(P21312)) ) | ( ( 2 ) <= (tk(P114)) ) ) ) | ( ( ( 1 ) <= (tk(P18628)) ) & ( ( ( 2 ) <= (tk(P20041)) ) | ( ( 1 ) <= (tk(P6446)) ) ) ) ) ) & ( ( 2 ) <= (tk(P6830)) ) ) ) & (! ( ( ( ( 1 ) <= (tk(P798)) ) & (! ( ( ( 2 ) <= (tk(P17161)) ) & ( ( 1 ) <= (tk(P19426)) ) )) ) | ( (! ( (tk(P13941)) <= (tk(P17128)) )) & ( (! ( ( 1 ) <= (tk(P1014)) )) | ( ( 2 ) <= (tk(P2835)) ) ) ) )) ))))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-11 (reachable & potential(( (! ( ( ( 2 ) <= (tk(P2162)) ) & ( ( (! ( (! ( ( (tk(P6890)) <= (tk(P12604)) ) | ( (tk(P19358)) <= (tk(P20818)) ) )) | ( ( 1 ) <= (tk(P16208)) ) )) & ( (tk(P21396)) <= (tk(P5005)) ) ) & (! ( (! ( ( 2 ) <= (tk(P1601)) )) & ( (! ( ( 1 ) <= (tk(P8290)) )) | ( ( ( ( 2 ) <= (tk(P17840)) ) | ( ( 2 ) <= (tk(P17981)) ) ) | ( ( (tk(P14386)) <= ( 1 ) ) | ( ( 2 ) <= (tk(P10856)) ) ) ) ) )) ) )) & (! ( (tk(P871)) <= ( 2 ) )) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-12 (reachable & potential(( (! ( ( ( 2 ) <= (tk(P11776)) ) & ( ( 1 ) <= (tk(P17343)) ) )) & ( ( ( 2 ) <= (tk(P2941)) ) & (! ( (tk(P3091)) <= (tk(P16777)) )) ) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P16033)) <= ( 2 ) )))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-14 (reachable &!potential( (! ( ( ( (tk(P18355)) <= ( 1 ) ) & ( ( ( 2 ) <= (tk(P13046)) ) & (! ( (tk(P17059)) <= ( 2 ) )) ) ) & (! ( (tk(P16483)) <= ( 1 ) )) ))))
PROPERTY: LeafsetExtension-PT-S64C2-ReachabilityCardinality-15 (reachable & potential(( ( ( ( ( ( ( ( ( ( (tk(P2245)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P6058)) ) ) & ( ( (tk(P5856)) <= ( 1 ) ) | ( (tk(P17813)) <= ( 1 ) ) ) ) | (! ( ( 1 ) <= (tk(P12630)) )) ) | ( (tk(P18745)) <= ( 2 ) ) ) | (! ( (! ( ( (tk(P15297)) <= (tk(P7679)) ) | ( (tk(P4865)) <= (tk(P8165)) ) )) & (! ( ( (tk(P14981)) <= ( 2 ) ) & ( (tk(P5676)) <= ( 1 ) ) )) )) ) | ( ( 1 ) <= (tk(P18033)) ) ) & ( ( (tk(P879)) <= ( 0 ) ) | ( ( 2 ) <= (tk(P3690)) ) ) ) | (! ( ( 1 ) <= (tk(P11727)) )) ) & ( (! ( ( ( (tk(P17150)) <= (tk(P10737)) ) | ( (tk(P18030)) <= (tk(P9747)) ) ) | ( (tk(P16925)) <= ( 1 ) ) )) & (! ( ( ( ( (! ( ( (tk(P6721)) <= ( 2 ) ) | ( (tk(P18203)) <= (tk(P6964)) ) )) | ( (tk(P9819)) <= (tk(P466)) ) ) | (! ( (tk(P13533)) <= ( 1 ) )) ) & ( (tk(P19736)) <= ( 0 ) ) ) | (! ( ( ( ( ( (tk(P11460)) <= (tk(P18286)) ) | ( (tk(P12203)) <= (tk(P5614)) ) ) | ( ( 2 ) <= (tk(P10944)) ) ) | ( (tk(P389)) <= ( 1 ) ) ) & ( (! ( ( 1 ) <= (tk(P8650)) )) & ( ( (tk(P13144)) <= ( 0 ) ) & ( (tk(P3173)) <= (tk(P9675)) ) ) ) )) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14542392 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16074220 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="LeafsetExtension-PT-S64C2"
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 LeafsetExtension-PT-S64C2, 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 r235-tall-167856421900526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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