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.r395-oct2-167903718700350.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718700350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 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 ShieldIIPt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679564473735

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=ShieldIIPt-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:41:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 09:41:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:41:16] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-03-23 09:41:16] [INFO ] Transformed 7003 places.
[2023-03-23 09:41:16] [INFO ] Transformed 6503 transitions.
[2023-03-23 09:41:16] [INFO ] Found NUPN structural information;
[2023-03-23 09:41:16] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 750 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 13) seen :3
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-23 09:41:18] [INFO ] Computed 901 place invariants in 51 ms
[2023-03-23 09:41:20] [INFO ] After 2339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 09:41:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 695 ms returned sat
[2023-03-23 09:41:45] [INFO ] After 21140ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-23 09:41:45] [INFO ] After 21158ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 09:41:45] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1650 transitions
Trivial Post-agglo rules discarded 1650 transitions
Performed 1650 trivial Post agglomeration. Transition count delta: 1650
Iterating post reduction 0 with 1650 rules applied. Total rules applied 1650 place count 7003 transition count 4853
Reduce places removed 1650 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1652 rules applied. Total rules applied 3302 place count 5353 transition count 4851
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 22 rules applied. Total rules applied 3324 place count 5352 transition count 4830
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 3345 place count 5331 transition count 4830
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 398 Pre rules applied. Total rules applied 3345 place count 5331 transition count 4432
Deduced a syphon composed of 398 places in 20 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 4 with 796 rules applied. Total rules applied 4141 place count 4933 transition count 4432
Discarding 681 places :
Symmetric choice reduction at 4 with 681 rule applications. Total rules 4822 place count 4252 transition count 3751
Iterating global reduction 4 with 681 rules applied. Total rules applied 5503 place count 4252 transition count 3751
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 5503 place count 4252 transition count 3469
Deduced a syphon composed of 282 places in 31 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 4 with 564 rules applied. Total rules applied 6067 place count 3970 transition count 3469
Performed 1674 Post agglomeration using F-continuation condition.Transition count delta: 1674
Deduced a syphon composed of 1674 places in 14 ms
Reduce places removed 1674 places and 0 transitions.
Iterating global reduction 4 with 3348 rules applied. Total rules applied 9415 place count 2296 transition count 1795
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9617 place count 2195 transition count 1853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 18 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9819 place count 2094 transition count 1919
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 83 places in 5 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 9985 place count 2011 transition count 1971
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9986 place count 2011 transition count 1970
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 9990 place count 2011 transition count 1966
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 9994 place count 2007 transition count 1966
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 10092 place count 2007 transition count 1966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10093 place count 2006 transition count 1965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10094 place count 2005 transition count 1965
Applied a total of 10094 rules in 2555 ms. Remains 2005 /7003 variables (removed 4998) and now considering 1965/6503 (removed 4538) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2556 ms. Remains : 2005/7003 places, 1965/6503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 58217 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58217 steps, saw 38235 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1965 rows 2005 cols
[2023-03-23 09:41:53] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-23 09:41:53] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 09:41:54] [INFO ] [Nat]Absence check using 900 positive place invariants in 169 ms returned sat
[2023-03-23 09:41:56] [INFO ] After 1601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 09:41:56] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 09:41:58] [INFO ] After 2380ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 09:41:58] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 17 ms to minimize.
[2023-03-23 09:41:59] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 2 ms to minimize.
[2023-03-23 09:41:59] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 5 ms to minimize.
[2023-03-23 09:41:59] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-23 09:41:59] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 26 ms to minimize.
[2023-03-23 09:41:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1378 ms
[2023-03-23 09:42:00] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 0 ms to minimize.
[2023-03-23 09:42:01] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 11 ms to minimize.
[2023-03-23 09:42:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1426 ms
[2023-03-23 09:42:02] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-23 09:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-23 09:42:04] [INFO ] After 7937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2942 ms.
[2023-03-23 09:42:06] [INFO ] After 13446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 788 ms.
Support contains 74 out of 2005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2005/2005 places, 1965/1965 transitions.
Applied a total of 0 rules in 55 ms. Remains 2005 /2005 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 2005/2005 places, 1965/1965 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2005/2005 places, 1965/1965 transitions.
Applied a total of 0 rules in 52 ms. Remains 2005 /2005 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
[2023-03-23 09:42:07] [INFO ] Invariant cache hit.
[2023-03-23 09:42:09] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2023-03-23 09:42:09] [INFO ] Invariant cache hit.
[2023-03-23 09:42:10] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-23 09:42:15] [INFO ] Implicit Places using invariants and state equation in 6116 ms returned []
Implicit Place search using SMT with State Equation took 7782 ms to find 0 implicit places.
[2023-03-23 09:42:15] [INFO ] Redundant transitions in 158 ms returned []
[2023-03-23 09:42:15] [INFO ] Invariant cache hit.
[2023-03-23 09:42:17] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9219 ms. Remains : 2005/2005 places, 1965/1965 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2005 transition count 1964
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2004 transition count 1964
Partial Free-agglomeration rule applied 257 times.
Drop transitions removed 257 transitions
Iterating global reduction 0 with 257 rules applied. Total rules applied 259 place count 2004 transition count 1964
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 260 place count 2004 transition count 1963
Applied a total of 260 rules in 236 ms. Remains 2004 /2005 variables (removed 1) and now considering 1963/1965 (removed 2) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1963 rows 2004 cols
[2023-03-23 09:42:17] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-23 09:42:17] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 09:42:18] [INFO ] [Nat]Absence check using 900 positive place invariants in 232 ms returned sat
[2023-03-23 09:42:21] [INFO ] After 1942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 09:42:21] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-23 09:42:22] [INFO ] After 1422ms SMT Verify possible using 239 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 09:42:23] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 2 ms to minimize.
[2023-03-23 09:42:23] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2023-03-23 09:42:23] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 0 ms to minimize.
[2023-03-23 09:42:24] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 0 ms to minimize.
[2023-03-23 09:42:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1565 ms
[2023-03-23 09:42:24] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-23 09:42:25] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2023-03-23 09:42:25] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 0 ms to minimize.
[2023-03-23 09:42:25] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2023-03-23 09:42:26] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2023-03-23 09:42:26] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-23 09:42:26] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2023-03-23 09:42:27] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
[2023-03-23 09:42:27] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 2 ms to minimize.
[2023-03-23 09:42:27] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2023-03-23 09:42:28] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2023-03-23 09:42:28] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-23 09:42:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4021 ms
[2023-03-23 09:42:29] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 2 ms to minimize.
[2023-03-23 09:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2023-03-23 09:42:30] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 2 ms to minimize.
[2023-03-23 09:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-23 09:42:30] [INFO ] After 9303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1422 ms.
[2023-03-23 09:42:32] [INFO ] After 14082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-23 09:42:32] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-23 09:42:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2005 places, 1965 transitions and 9592 arcs took 16 ms.
[2023-03-23 09:42:32] [INFO ] Flatten gal took : 202 ms
Total runtime 76649 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 100B
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: 2005 places, 1965 transitions, 9592 arcs.
Final Score: 75011.052
Took : 91 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P1776)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1776)) ) ) | ( ( (tk(P441)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P441)) ) ) ) | ( ( ( (tk(P1376)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1376)) ) ) | ( ( ( ( (tk(P728)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P728)) ) ) & ( ( (tk(P1901)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1901)) ) ) ) & ( ( ( ( ( (tk(P417)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P417)) ) ) | ( ( (tk(P1121)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1121)) ) ) ) | ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) | ( ( ( ( (tk(P238)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P238)) ) ) & ( ( (tk(P1970)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1970)) ) ) ) | ( ( ( ( (tk(P434)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P434)) ) ) & ( ( (tk(P1187)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1187)) ) ) ) & ( ( ( (tk(P1311)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1311)) ) ) & ( ( (tk(P1515)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1515)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P1651)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1651)) ) ) | ( ( (tk(P792)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P792)) ) ) ) | ( ( ( (tk(P613)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P613)) ) ) | ( ( (tk(P300)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P300)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-04 (reachable & potential(( ( ( ( ( (tk(P1983)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1983)) ) ) & ( ( (tk(P909)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P909)) ) ) ) & ( ( ( (tk(P979)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P979)) ) ) & ( ( (tk(P591)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P591)) ) ) ) ) & ( ( ( ( ( (tk(P1208)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1208)) ) ) | ( ( (tk(P990)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P990)) ) ) ) & ( ( ( ( (tk(P1104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1104)) ) ) & ( ( (tk(P564)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P564)) ) ) ) | ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P530)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P530)) ) ) ) ) ) & ( ( ( ( ( (tk(P1701)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1701)) ) ) & ( ( ( (tk(P1232)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1232)) ) ) | ( ( ( (tk(P137)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P137)) ) ) & ( ( ( (tk(P1177)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1177)) ) ) & ( ( (tk(P413)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P413)) ) ) ) ) ) ) | ( ( ( (tk(P829)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P829)) ) ) & ( ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) & ( ( (tk(P1527)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1527)) ) ) ) ) ) & ( ( ( (tk(P1760)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1760)) ) ) | ( ( ( (tk(P143)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P143)) ) ) | ( ( (tk(P810)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P810)) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( (tk(P1984)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1984)) ) ) | ( ( ( (tk(P1486)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1486)) ) ) | ( ( (tk(P884)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P884)) ) ) ) ) | ( ( ( (tk(P1844)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1844)) ) ) | ( ( ( (tk(P1302)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1302)) ) ) | ( ( ( (tk(P1999)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1999)) ) ) & ( ( (tk(P1921)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1921)) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-08 (reachable &!potential( ( ( ( (tk(P313)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P313)) ) ) | ( ( (tk(P1166)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1166)) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P373)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P373)) ) ) & ( ( (tk(P1115)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1115)) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-10 (reachable & potential(( ( ( (tk(P1068)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1068)) ) ) & ( ( ( (tk(P1456)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1456)) ) ) & ( ( ( ( (tk(P456)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P456)) ) ) & ( ( (tk(P1625)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1625)) ) ) ) | ( ( ( ( (tk(P945)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P945)) ) ) | ( ( (tk(P1833)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1833)) ) ) ) & ( ( ( ( (tk(P1024)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1024)) ) ) | ( ( (tk(P141)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P141)) ) ) ) & ( ( ( (tk(P508)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P508)) ) ) | ( ( (tk(P1546)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1546)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-11 (reachable & potential(( ( (tk(P480)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P480)) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-12 (reachable & potential(( ( ( (tk(P486)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P486)) ) ) & ( ( ( (tk(P1897)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1897)) ) ) & ( ( (tk(P1413)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1413)) ) ) ) )))
PROPERTY: ShieldIIPt-PT-100B-ReachabilityCardinality-13 (reachable & potential(( ( ( ( (tk(P476)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P476)) ) ) & ( ( ( (tk(P245)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P245)) ) ) & ( ( (tk(P748)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P748)) ) ) ) ) & ( ( ( ( (tk(P908)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P908)) ) ) & ( ( (tk(P1141)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1141)) ) ) ) & ( ( ( (tk(P590)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P590)) ) ) & ( ( ( (tk(P519)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P519)) ) ) | ( ( ( (tk(P1294)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1294)) ) ) | ( ( ( (tk(P827)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P827)) ) ) & ( ( (tk(P1953)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1953)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 4033656 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16099820 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
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 ShieldIIPt-PT-100B, 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 r395-oct2-167903718700350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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