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.r107-tall-167814484300486.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 DES-PT-50b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484300486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 127K 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 DES-PT-50b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678377768970

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=DES-PT-50b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 16:02:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 16:02:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:02:50] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-09 16:02:50] [INFO ] Transformed 479 places.
[2023-03-09 16:02:50] [INFO ] Transformed 430 transitions.
[2023-03-09 16:02:50] [INFO ] Found NUPN structural information;
[2023-03-09 16:02:50] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 14) seen :8
FORMULA DES-PT-50b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :1
FORMULA DES-PT-50b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 430 rows 479 cols
[2023-03-09 16:02:51] [INFO ] Computed 65 place invariants in 50 ms
[2023-03-09 16:02:51] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 16:02:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-09 16:02:51] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-09 16:02:53] [INFO ] After 1643ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-09 16:02:53] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 9 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 13 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 840 ms
[2023-03-09 16:02:54] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2023-03-09 16:02:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 16:02:55] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2023-03-09 16:02:55] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-09 16:02:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-09 16:02:55] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-09 16:02:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2023-03-09 16:02:55] [INFO ] After 3896ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 671 ms.
[2023-03-09 16:02:56] [INFO ] After 5072ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA DES-PT-50b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 273 ms.
Support contains 30 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 469 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 469 transition count 413
Reduce places removed 13 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 17 rules applied. Total rules applied 31 place count 456 transition count 409
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 452 transition count 409
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 35 place count 452 transition count 402
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 49 place count 445 transition count 402
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 66 place count 428 transition count 385
Iterating global reduction 3 with 17 rules applied. Total rules applied 83 place count 428 transition count 385
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 97 place count 414 transition count 371
Iterating global reduction 3 with 14 rules applied. Total rules applied 111 place count 414 transition count 371
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 15 rules applied. Total rules applied 126 place count 414 transition count 356
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 130 place count 411 transition count 355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 130 place count 411 transition count 354
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 410 transition count 354
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 266 place count 343 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 272 place count 340 transition count 290
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 274 place count 340 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 276 place count 338 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 278 place count 338 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 280 place count 336 transition count 286
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 281 place count 336 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 282 place count 335 transition count 285
Applied a total of 282 rules in 218 ms. Remains 335 /479 variables (removed 144) and now considering 285/430 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 335/479 places, 285/430 transitions.
Incomplete random walk after 10000 steps, including 307 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 759946 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 759946 steps, saw 143948 distinct states, run finished after 3002 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 285 rows 335 cols
[2023-03-09 16:03:00] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-09 16:03:00] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 16:03:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 16:03:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-09 16:03:01] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 16:03:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 16:03:01] [INFO ] After 348ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 16:03:01] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-09 16:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 16:03:02] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-09 16:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 16:03:02] [INFO ] After 967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-09 16:03:02] [INFO ] After 2283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 239 ms.
Support contains 30 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 285/285 transitions.
Applied a total of 0 rules in 12 ms. Remains 335 /335 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 335/335 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 285/285 transitions.
Applied a total of 0 rules in 10 ms. Remains 335 /335 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-09 16:03:03] [INFO ] Invariant cache hit.
[2023-03-09 16:03:03] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-09 16:03:03] [INFO ] Invariant cache hit.
[2023-03-09 16:03:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 16:03:03] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-09 16:03:03] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 16:03:03] [INFO ] Invariant cache hit.
[2023-03-09 16:03:03] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 335/335 places, 285/285 transitions.
Graph (complete) has 954 edges and 335 vertex of which 334 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 334 transition count 285
Applied a total of 2 rules in 20 ms. Remains 334 /335 variables (removed 1) and now considering 285/285 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 285 rows 334 cols
[2023-03-09 16:03:03] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-09 16:03:03] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 16:03:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-09 16:03:03] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 83 ms returned sat
[2023-03-09 16:03:04] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 16:03:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-09 16:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 16:03:04] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-09 16:03:04] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-09 16:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-09 16:03:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-09 16:03:05] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-09 16:03:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-03-09 16:03:05] [INFO ] After 1108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-09 16:03:05] [INFO ] After 1487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-09 16:03:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-09 16:03:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 335 places, 285 transitions and 1247 arcs took 2 ms.
[2023-03-09 16:03:05] [INFO ] Flatten gal took : 53 ms
Total runtime 15238 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 50b
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: 335 places, 285 transitions, 1247 arcs.
Final Score: 5890.463
Took : 14 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DES-PT-50b-ReachabilityCardinality-04 (reachable &!potential( ( ( ( (tk(P52)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P52)) ) ) | ( ( (tk(P236)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P236)) ) ) )))
PROPERTY: DES-PT-50b-ReachabilityCardinality-06 (reachable &!potential( ( ( ( (tk(P248)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P248)) ) ) | ( ( ( ( (tk(P288)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P288)) ) ) & ( ( ( (tk(P226)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P226)) ) ) & ( ( ( (tk(P94)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P94)) ) ) | ( ( ( ( (tk(P269)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P269)) ) ) & ( ( (tk(P258)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P258)) ) ) ) | ( ( ( (tk(P134)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P134)) ) ) & ( ( ( (tk(P108)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P108)) ) ) & ( ( ( (tk(P331)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P331)) ) ) | ( ( (tk(P220)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P220)) ) ) ) ) ) ) ) ) ) | ( ( ( (tk(P207)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P207)) ) ) & ( ( ( (tk(P159)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P159)) ) ) | ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) ) ) ) )))
PROPERTY: DES-PT-50b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) | ( ( ( (tk(P290)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P290)) ) ) | ( ( ( ( (tk(P99)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P99)) ) ) | ( ( (tk(P188)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P188)) ) ) ) & ( ( ( ( ( (tk(P176)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P176)) ) ) | ( ( (tk(P52)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P52)) ) ) ) & ( ( ( ( (tk(P211)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P211)) ) ) & ( ( (tk(P192)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P192)) ) ) ) | ( ( ( (tk(P192)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P192)) ) ) & ( ( (tk(P116)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P116)) ) ) ) ) ) | ( ( ( ( (tk(P72)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P72)) ) ) & ( ( (tk(P243)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P243)) ) ) ) & ( ( ( (tk(P335)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P335)) ) ) & ( ( ( ( (tk(P208)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P208)) ) ) | ( ( (tk(P107)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P107)) ) ) ) & ( ( ( (tk(P209)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P209)) ) ) | ( ( (tk(P224)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P224)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 157516 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16244032 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DES-PT-50b"
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 DES-PT-50b, 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 r107-tall-167814484300486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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