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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3384.308 1093322.00 1116484.00 3629.90 TFTFFFFTTTTTTTTF 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-167814484200446.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-30a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 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.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 70K 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-30a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678371507966

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-30a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 14:18:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 14:18:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:18:29] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-09 14:18:29] [INFO ] Transformed 234 places.
[2023-03-09 14:18:29] [INFO ] Transformed 191 transitions.
[2023-03-09 14:18:29] [INFO ] Found NUPN structural information;
[2023-03-09 14:18:29] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 221 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 13) seen :1
FORMULA DES-PT-30a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :1
FORMULA DES-PT-30a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 177 rows 234 cols
[2023-03-09 14:18:31] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-09 14:18:31] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 14:18:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 14:18:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 85 ms returned sat
[2023-03-09 14:18:32] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-09 14:18:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:18:35] [INFO ] After 2444ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2023-03-09 14:18:36] [INFO ] After 3259ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 1236 ms.
[2023-03-09 14:18:37] [INFO ] After 6112ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA DES-PT-30a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
FORMULA DES-PT-30a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 256 ms.
Support contains 37 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 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 234 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 233 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 233 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 233 transition count 174
Applied a total of 8 rules in 61 ms. Remains 233 /234 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 233/234 places, 174/177 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1171083 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :{}
Probabilistic random walk after 1171083 steps, saw 164114 distinct states, run finished after 3003 ms. (steps per millisecond=389 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 233 cols
[2023-03-09 14:18:40] [INFO ] Computed 61 place invariants in 12 ms
[2023-03-09 14:18:41] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 14:18:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-09 14:18:41] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 33 ms returned sat
[2023-03-09 14:18:41] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 14:18:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 14:18:41] [INFO ] After 180ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 14:18:41] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2023-03-09 14:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 14:18:41] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 732 ms.
[2023-03-09 14:18:42] [INFO ] After 1624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 70 ms.
Support contains 37 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 19 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 233/233 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 174/174 transitions.
Applied a total of 0 rules in 12 ms. Remains 233 /233 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 14:18:42] [INFO ] Invariant cache hit.
[2023-03-09 14:18:42] [INFO ] Implicit Places using invariants in 142 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/233 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 165 ms. Remains : 232/233 places, 174/174 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1220202 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :{}
Probabilistic random walk after 1220202 steps, saw 170893 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 14:18:46] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 14:18:46] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 14:18:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-09 14:18:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 14:18:46] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 14:18:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 14:18:46] [INFO ] After 206ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 14:18:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2023-03-09 14:18:47] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 5 ms to minimize.
[2023-03-09 14:18:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-09 14:18:47] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-09 14:18:47] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 101 ms.
Support contains 37 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-09 14:18:47] [INFO ] Invariant cache hit.
[2023-03-09 14:18:47] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 14:18:47] [INFO ] Invariant cache hit.
[2023-03-09 14:18:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 14:18:47] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-09 14:18:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 14:18:47] [INFO ] Invariant cache hit.
[2023-03-09 14:18:48] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 232/232 places, 174/174 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 232 transition count 174
Applied a total of 1 rules in 14 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-09 14:18:48] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 14:18:48] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 14:18:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 14:18:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 14:18:48] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 14:18:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-09 14:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-09 14:18:48] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-09 14:18:49] [INFO ] After 942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-09 14:18:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-09 14:18:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 174 transitions and 872 arcs took 2 ms.
[2023-03-09 14:18:49] [INFO ] Flatten gal took : 53 ms
Total runtime 19904 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 30a
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: 232 places, 174 transitions, 872 arcs.
Final Score: 3327.445
Took : 11 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DES-PT-30a-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( (tk(P103)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P103)) ) ) | ( ( (tk(P139)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P139)) ) ) ) | ( ( ( (tk(P208)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P208)) ) ) | ( ( ( (tk(P185)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P185)) ) ) | ( ( ( (tk(P76)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P76)) ) ) & ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) | ( ( ( ( (tk(P126)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P126)) ) ) & ( ( ( (tk(P116)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P116)) ) ) | ( ( (tk(P177)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P177)) ) ) ) ) & ( ( ( ( (tk(P85)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P85)) ) ) | ( ( (tk(P81)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P81)) ) ) ) & ( ( ( ( (tk(P17)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P17)) ) ) | ( ( (tk(P232)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P232)) ) ) ) & ( ( ( ( (tk(P206)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P206)) ) ) | ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) | ( ( ( (tk(P102)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P102)) ) ) | ( ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) & ( ( (tk(P215)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P215)) ) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: DES-PT-30a-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( (tk(P83)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P83)) ) ) | ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) ) | ( ( ( (tk(P66)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P66)) ) ) | ( ( ( (tk(P172)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P172)) ) ) & ( ( (tk(P92)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P92)) ) ) ) ) )))
PROPERTY: DES-PT-30a-ReachabilityCardinality-11 (reachable & potential(( ( ( ( (tk(P192)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P192)) ) ) & ( ( (tk(P17)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P17)) ) ) ) & ( ( ( ( ( (tk(P180)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P180)) ) ) | ( ( (tk(P174)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P174)) ) ) ) | ( ( ( (tk(P137)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P137)) ) ) | ( ( ( ( (tk(P65)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P65)) ) ) & ( ( (tk(P129)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P129)) ) ) ) & ( ( ( (tk(P118)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P118)) ) ) & ( ( ( ( (tk(P89)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P89)) ) ) | ( ( (tk(P214)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P214)) ) ) ) & ( ( ( (tk(P205)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P205)) ) ) | ( ( (tk(P217)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P217)) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) & ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) ) | ( ( ( ( (tk(P52)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P52)) ) ) & ( ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) & ( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) ) ) ) & ( ( ( (tk(P23)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P23)) ) ) & ( ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) & ( ( (tk(P206)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P206)) ) ) ) ) ) ) ) )))
FORMULA DES-PT-30a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-30a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-30a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678372601288

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30a"
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-30a, 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-167814484200446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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