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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2705.567 1800000.00 1913917.00 3945.00 [undef] Time out reached

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.r121-tall-167814499400298.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-50a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K 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 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 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 97K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678395267844

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-50a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 20:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:54:29] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-09 20:54:29] [INFO ] Transformed 314 places.
[2023-03-09 20:54:29] [INFO ] Transformed 271 transitions.
[2023-03-09 20:54:29] [INFO ] Found NUPN structural information;
[2023-03-09 20:54:29] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 137 ms.
Structural test allowed to assert that 44 places are NOT stable. Took 6 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 270) seen :88
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 182) seen :0
Running SMT prover for 182 properties.
// Phase 1: matrix 257 rows 314 cols
[2023-03-09 20:54:30] [INFO ] Computed 59 place invariants in 31 ms
[2023-03-09 20:54:31] [INFO ] After 1719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:182
[2023-03-09 20:54:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-09 20:54:32] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-09 20:54:41] [INFO ] After 4447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :182
[2023-03-09 20:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:54:46] [INFO ] After 5065ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :182
[2023-03-09 20:54:46] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 4 ms to minimize.
[2023-03-09 20:54:46] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-09 20:54:47] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-09 20:54:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 554 ms
[2023-03-09 20:54:53] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2023-03-09 20:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 20:54:53] [INFO ] After 12310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :182
Attempting to minimize the solution found.
Minimization took 3250 ms.
[2023-03-09 20:54:56] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :182
Parikh walk visited 180 properties in 30514 ms.
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 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 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
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 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 311 transition count 253
Applied a total of 10 rules in 100 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 311/314 places, 253/257 transitions.
Incomplete random walk after 1000000 steps, including 13697 resets, run finished after 7781 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2261 resets, run finished after 2011 ms. (steps per millisecond=497 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2305 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12138274 steps, run timeout after 33001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 12138274 steps, saw 1524712 distinct states, run finished after 33004 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 20:56:12] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-09 20:56:12] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:56:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-09 20:56:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-09 20:56:12] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:56:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:56:12] [INFO ] After 69ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 20:56:12] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 20:56:12] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1849 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 19 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 20:56:14] [INFO ] Invariant cache hit.
[2023-03-09 20:56:14] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-09 20:56:14] [INFO ] Invariant cache hit.
[2023-03-09 20:56:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:56:15] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-09 20:56:15] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-09 20:56:15] [INFO ] Invariant cache hit.
[2023-03-09 20:56:15] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 311/311 places, 253/253 transitions.
Incomplete random walk after 100000 steps, including 1363 resets, run finished after 876 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 20:56:16] [INFO ] Invariant cache hit.
[2023-03-09 20:56:16] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:56:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:56:16] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 20:56:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:56:16] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-09 20:56:16] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 20:56:16] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 13711 resets, run finished after 8307 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2269 resets, run finished after 1883 ms. (steps per millisecond=531 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2276 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13625016 steps, run timeout after 36001 ms. (steps per millisecond=378 ) properties seen :{}
Probabilistic random walk after 13625016 steps, saw 1701013 distinct states, run finished after 36002 ms. (steps per millisecond=378 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 20:57:04] [INFO ] Invariant cache hit.
[2023-03-09 20:57:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:57:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:57:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 20:57:05] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:57:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:05] [INFO ] After 49ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 20:57:05] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 20:57:05] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1820 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 20:57:06] [INFO ] Invariant cache hit.
[2023-03-09 20:57:07] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 20:57:07] [INFO ] Invariant cache hit.
[2023-03-09 20:57:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:07] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-09 20:57:07] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 20:57:07] [INFO ] Invariant cache hit.
[2023-03-09 20:57:07] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 738 ms. Remains : 311/311 places, 253/253 transitions.
Incomplete random walk after 100000 steps, including 1376 resets, run finished after 931 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 20:57:08] [INFO ] Invariant cache hit.
[2023-03-09 20:57:08] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:57:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 20:57:08] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 20:57:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:08] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-09 20:57:08] [INFO ] After 72ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 20:57:08] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 133 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1551719 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{}
Probabilistic random walk after 1551719 steps, saw 217311 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:57:11] [INFO ] Invariant cache hit.
[2023-03-09 20:57:12] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:57:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-09 20:57:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-09 20:57:12] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:12] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:12] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-09 20:57:12] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2023-03-09 20:57:12] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-03-09 20:57:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2023-03-09 20:57:12] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 20:57:12] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 311/311 places, 253/253 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1497863 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1497863 steps, saw 208922 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:57:15] [INFO ] Invariant cache hit.
[2023-03-09 20:57:15] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:57:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:57:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-09 20:57:16] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:16] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:16] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-09 20:57:16] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-09 20:57:16] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:57:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2023-03-09 20:57:16] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 20:57:16] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 23 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 20:57:16] [INFO ] Invariant cache hit.
[2023-03-09 20:57:16] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-09 20:57:16] [INFO ] Invariant cache hit.
[2023-03-09 20:57:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:17] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-09 20:57:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 20:57:17] [INFO ] Invariant cache hit.
[2023-03-09 20:57:17] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 20:57:17] [INFO ] Invariant cache hit.
[2023-03-09 20:57:17] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:57:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:57:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-09 20:57:17] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:17] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-09 20:57:17] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-09 20:57:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-09 20:57:17] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:57:17] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 138 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1456735 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1456735 steps, saw 203370 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:57:20] [INFO ] Invariant cache hit.
[2023-03-09 20:57:21] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:57:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:57:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:57:21] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:21] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:21] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 20:57:21] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 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 311 transition count 253
Applied a total of 1 rules in 21 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 311/311 places, 253/253 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1492985 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :{}
Probabilistic random walk after 1492985 steps, saw 208205 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 20:57:24] [INFO ] Computed 60 place invariants in 14 ms
[2023-03-09 20:57:24] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:57:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:57:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2023-03-09 20:57:24] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:24] [INFO ] After 52ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:24] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-09 20:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 20:57:24] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 20:57:24] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 20:57:24] [INFO ] Invariant cache hit.
[2023-03-09 20:57:25] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-09 20:57:25] [INFO ] Invariant cache hit.
[2023-03-09 20:57:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:57:25] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-09 20:57:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 20:57:25] [INFO ] Invariant cache hit.
[2023-03-09 20:57:25] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 311/311 places, 253/253 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 311 transition count 253
Applied a total of 1 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 20:57:25] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 20:57:25] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:57:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:57:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2023-03-09 20:57:25] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:57:25] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 20:57:25] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 20:57:25] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 20:57:25] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 20:57:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:57:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-09 20:57:26] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 20:57:26] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-09 20:57:26] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Unable to solve all queries for examination StableMarking. Remains :2 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 177025 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 50a
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 314 places, 271 transitions, 1306 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13466404 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16125060 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 StableMarking -timeout 180 -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-50a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-50a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-167814499400298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;