fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r107-tall-167814484300494
Last Updated
May 14, 2023

About the Execution of Smart+red for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10420.056 3600000.00 3661903.00 12668.20 TTFT??T?F?TFFFFF normal

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-167814484300494.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-60a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484300494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 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.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 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 110K 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-60a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678380179032

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-60a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 16:43:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 16:43:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:43:00] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-09 16:43:00] [INFO ] Transformed 354 places.
[2023-03-09 16:43:00] [INFO ] Transformed 311 transitions.
[2023-03-09 16:43:00] [INFO ] Found NUPN structural information;
[2023-03-09 16:43:00] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 228 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 14) seen :4
FORMULA DES-PT-60a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 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 48 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 297 rows 354 cols
[2023-03-09 16:43:01] [INFO ] Computed 59 place invariants in 31 ms
[2023-03-09 16:43:02] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-09 16:43:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-09 16:43:02] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 16:43:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 16:43:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 156 ms returned sat
[2023-03-09 16:43:08] [INFO ] After 4243ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-09 16:43:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 16:43:10] [INFO ] After 2114ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-09 16:43:14] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
[2023-03-09 16:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-09 16:43:14] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-09 16:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 16:43:14] [INFO ] After 6648ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 7690 ms.
[2023-03-09 16:43:22] [INFO ] After 20078ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA DES-PT-60a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
FORMULA DES-PT-60a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 701 ms.
Support contains 21 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Applied a total of 10 rules in 87 ms. Remains 353 /354 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 353/354 places, 294/297 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 774716 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 774716 steps, saw 110928 distinct states, run finished after 3002 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 353 cols
[2023-03-09 16:43:26] [INFO ] Computed 61 place invariants in 13 ms
[2023-03-09 16:43:26] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-09 16:43:26] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 16:43:26] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 16:43:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 16:43:26] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 16:43:27] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 16:43:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 16:43:27] [INFO ] After 263ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 16:43:27] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 5 ms to minimize.
[2023-03-09 16:43:27] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-03-09 16:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-09 16:43:28] [INFO ] After 678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-09 16:43:28] [INFO ] After 1704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA DES-PT-60a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 327 ms.
Support contains 15 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 20 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 353/353 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 20 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-09 16:43:28] [INFO ] Invariant cache hit.
[2023-03-09 16:43:29] [INFO ] Implicit Places using invariants in 209 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/353 places, 294/294 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 253 ms. Remains : 352/353 places, 294/294 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 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 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 776983 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 776983 steps, saw 111268 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 16:43:32] [INFO ] Computed 60 place invariants in 23 ms
[2023-03-09 16:43:32] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 16:43:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 16:43:32] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 16:43:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 16:43:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-09 16:43:33] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 16:43:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 16:43:33] [INFO ] After 198ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 16:43:33] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2023-03-09 16:43:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-09 16:43:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-03-09 16:43:33] [INFO ] After 602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-09 16:43:34] [INFO ] After 1536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 219 ms.
Support contains 15 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-09 16:43:34] [INFO ] Invariant cache hit.
[2023-03-09 16:43:34] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-09 16:43:34] [INFO ] Invariant cache hit.
[2023-03-09 16:43:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 16:43:34] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-09 16:43:34] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-09 16:43:35] [INFO ] Invariant cache hit.
[2023-03-09 16:43:35] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 858 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 16:43:35] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 16:43:35] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 16:43:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 16:43:35] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 16:43:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 16:43:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-09 16:43:35] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 16:43:36] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-09 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 16:43:36] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-09 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-09 16:43:36] [INFO ] After 870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-09 16:43:36] [INFO ] After 1391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-09 16:43:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-09 16:43:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 352 places, 294 transitions and 1452 arcs took 5 ms.
[2023-03-09 16:43:36] [INFO ] Flatten gal took : 79 ms
Total runtime 36498 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 60a
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: 352 places, 294 transitions, 1452 arcs.
Final Score: 6196.122
Took : 21 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DES-PT-60a-ReachabilityCardinality-04 (reachable & potential(( ( ( ( (tk(P280)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P280)) ) ) & ( ( (tk(P328)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P328)) ) ) ) & ( ( ( (tk(P92)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P92)) ) ) & ( ( (tk(P253)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P253)) ) ) ) )))
PROPERTY: DES-PT-60a-ReachabilityCardinality-05 (reachable &!potential( ( ( ( (tk(P170)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P170)) ) ) | ( ( (tk(P127)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P127)) ) ) )))
PROPERTY: DES-PT-60a-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) & ( ( ( ( (tk(P300)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P300)) ) ) | ( ( (tk(P250)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P250)) ) ) ) & ( ( ( (tk(P349)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P349)) ) ) | ( ( ( (tk(P37)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P37)) ) ) | ( ( ( (tk(P167)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P167)) ) ) & ( ( (tk(P73)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P73)) ) ) ) ) ) ) )))
PROPERTY: DES-PT-60a-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P151)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P151)) ) ) & ( ( (tk(P16)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P16)) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5733180 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107660 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-60a"
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-60a, 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-167814484300494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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