Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697100638.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANConstruction-PT-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Feb 25 21:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 21:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 21:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 21:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 21:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 1.4M 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 CANConstruction-PT-030-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678797574169

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=CANConstruction-PT-030
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 12:39:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 12:39:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:39:36] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-14 12:39:36] [INFO ] Transformed 2162 places.
[2023-03-14 12:39:36] [INFO ] Transformed 3840 transitions.
[2023-03-14 12:39:36] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
FORMULA CANConstruction-PT-030-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3840 rows 2162 cols
[2023-03-14 12:39:37] [INFO ] Computed 61 place invariants in 51 ms
[2023-03-14 12:39:37] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 12:39:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2023-03-14 12:39:38] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 16 ms returned sat
[2023-03-14 12:39:40] [INFO ] After 1941ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-14 12:39:40] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-14 12:39:42] [INFO ] After 1589ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-14 12:39:44] [INFO ] After 3587ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 1122 ms.
[2023-03-14 12:39:45] [INFO ] After 7340ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA CANConstruction-PT-030-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 125 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 2162 transition count 3668
Reduce places removed 172 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 186 rules applied. Total rules applied 358 place count 1990 transition count 3654
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 372 place count 1976 transition count 3654
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 372 place count 1976 transition count 3649
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 382 place count 1971 transition count 3649
Discarding 788 places :
Symmetric choice reduction at 3 with 788 rule applications. Total rules 1170 place count 1183 transition count 2073
Iterating global reduction 3 with 788 rules applied. Total rules applied 1958 place count 1183 transition count 2073
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1998 place count 1163 transition count 2053
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2006 place count 1163 transition count 2045
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2014 place count 1155 transition count 2045
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2021 place count 1155 transition count 2038
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2028 place count 1148 transition count 2038
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 2082 place count 1148 transition count 2038
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2085 place count 1148 transition count 2038
Applied a total of 2085 rules in 974 ms. Remains 1148 /2162 variables (removed 1014) and now considering 2038/3840 (removed 1802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 975 ms. Remains : 1148/2162 places, 2038/3840 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 172217 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172217 steps, saw 58206 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2038 rows 1148 cols
[2023-03-14 12:39:49] [INFO ] Computed 61 place invariants in 15 ms
[2023-03-14 12:39:49] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 12:39:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-14 12:39:50] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 24 ms returned sat
[2023-03-14 12:39:51] [INFO ] After 974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 12:39:51] [INFO ] State equation strengthened by 1807 read => feed constraints.
[2023-03-14 12:39:52] [INFO ] After 895ms SMT Verify possible using 1807 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-14 12:39:53] [INFO ] After 2076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 813 ms.
[2023-03-14 12:39:54] [INFO ] After 4404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 85 ms.
Support contains 125 out of 1148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1148/1148 places, 2038/2038 transitions.
Applied a total of 0 rules in 81 ms. Remains 1148 /1148 variables (removed 0) and now considering 2038/2038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1148/1148 places, 2038/2038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1148/1148 places, 2038/2038 transitions.
Applied a total of 0 rules in 73 ms. Remains 1148 /1148 variables (removed 0) and now considering 2038/2038 (removed 0) transitions.
[2023-03-14 12:39:54] [INFO ] Invariant cache hit.
[2023-03-14 12:39:55] [INFO ] Implicit Places using invariants in 775 ms returned [5, 13, 19, 26, 32, 40, 47, 53, 58, 62, 68, 74, 81, 87, 100, 107, 113, 120, 126, 135, 142, 156, 162, 168, 174, 181, 187, 193]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 779 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1120/1148 places, 2038/2038 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1120 transition count 2022
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1104 transition count 2022
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 1101 transition count 2019
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 1101 transition count 2019
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 1079 transition count 1997
Applied a total of 82 rules in 201 ms. Remains 1079 /1120 variables (removed 41) and now considering 1997/2038 (removed 41) transitions.
// Phase 1: matrix 1997 rows 1079 cols
[2023-03-14 12:39:55] [INFO ] Computed 33 place invariants in 18 ms
[2023-03-14 12:39:56] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-14 12:39:56] [INFO ] Invariant cache hit.
[2023-03-14 12:39:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-14 12:40:02] [INFO ] Implicit Places using invariants and state equation in 5990 ms returned []
Implicit Place search using SMT with State Equation took 6609 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1079/1148 places, 1997/2038 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7664 ms. Remains : 1079/1148 places, 1997/2038 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :2
FORMULA CANConstruction-PT-030-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 12:40:02] [INFO ] Invariant cache hit.
[2023-03-14 12:40:02] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:40:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-14 12:40:02] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 12:40:03] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:03] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-14 12:40:04] [INFO ] After 652ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:05] [INFO ] After 1474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-14 12:40:05] [INFO ] After 2958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 33 ms.
Support contains 88 out of 1079 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1079/1079 places, 1997/1997 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 0 with 1 rules applied. Total rules applied 1 place count 1079 transition count 1996
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1078 transition count 1996
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1078 transition count 1995
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1077 transition count 1995
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 15 place count 1066 transition count 1973
Iterating global reduction 2 with 11 rules applied. Total rules applied 26 place count 1066 transition count 1973
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 1060 transition count 1967
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 1058 transition count 1967
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 1058 transition count 1967
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 1057 transition count 1965
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 1057 transition count 1965
Applied a total of 45 rules in 417 ms. Remains 1057 /1079 variables (removed 22) and now considering 1965/1997 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 1057/1079 places, 1965/1997 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 188359 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188359 steps, saw 70692 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1965 rows 1057 cols
[2023-03-14 12:40:09] [INFO ] Computed 33 place invariants in 26 ms
[2023-03-14 12:40:09] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:40:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-14 12:40:09] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:40:10] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:10] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2023-03-14 12:40:11] [INFO ] After 592ms SMT Verify possible using 1777 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:11] [INFO ] After 1186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-14 12:40:12] [INFO ] After 2317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 38 ms.
Support contains 88 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 1965/1965 transitions.
Applied a total of 0 rules in 63 ms. Remains 1057 /1057 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1057/1057 places, 1965/1965 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 1965/1965 transitions.
Applied a total of 0 rules in 97 ms. Remains 1057 /1057 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
[2023-03-14 12:40:12] [INFO ] Invariant cache hit.
[2023-03-14 12:40:12] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-14 12:40:12] [INFO ] Invariant cache hit.
[2023-03-14 12:40:13] [INFO ] State equation strengthened by 1777 read => feed constraints.
[2023-03-14 12:40:19] [INFO ] Implicit Places using invariants and state equation in 6822 ms returned []
Implicit Place search using SMT with State Equation took 7466 ms to find 0 implicit places.
[2023-03-14 12:40:19] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-14 12:40:19] [INFO ] Invariant cache hit.
[2023-03-14 12:40:20] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8642 ms. Remains : 1057/1057 places, 1965/1965 transitions.
Graph (trivial) has 1685 edges and 1057 vertex of which 575 / 1057 are part of one of the 20 SCC in 7 ms
Free SCC test removed 555 places
Drop transitions removed 1090 transitions
Reduce isomorphic transitions removed 1090 transitions.
Graph (complete) has 1013 edges and 502 vertex of which 470 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 322 rules applied. Total rules applied 324 place count 470 transition count 552
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 1 with 519 rules applied. Total rules applied 843 place count 204 transition count 299
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 843 place count 204 transition count 296
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 849 place count 201 transition count 296
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 858 place count 192 transition count 286
Iterating global reduction 2 with 9 rules applied. Total rules applied 867 place count 192 transition count 286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 871 place count 192 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 873 place count 191 transition count 281
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 879 place count 188 transition count 291
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 888 place count 188 transition count 282
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 912 place count 188 transition count 258
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 936 place count 164 transition count 258
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 938 place count 164 transition count 256
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 952 place count 164 transition count 256
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 961 place count 155 transition count 247
Iterating global reduction 4 with 9 rules applied. Total rules applied 970 place count 155 transition count 247
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 971 place count 155 transition count 246
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 972 place count 154 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 973 place count 154 transition count 245
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 983 place count 144 transition count 235
Applied a total of 983 rules in 60 ms. Remains 144 /1057 variables (removed 913) and now considering 235/1965 (removed 1730) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 235 rows 144 cols
[2023-03-14 12:40:20] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-14 12:40:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:40:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 12:40:20] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 12:40:21] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:21] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-14 12:40:21] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:40:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-14 12:40:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1057 places, 1965 transitions and 7623 arcs took 10 ms.
[2023-03-14 12:40:21] [INFO ] Flatten gal took : 126 ms
Total runtime 45377 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 030
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: 1057 places, 1965 transitions, 7623 arcs.
Final Score: 143731.916
Took : 96 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANConstruction-PT-030-ReachabilityCardinality-02 (reachable & potential(( ( (tk(P517)) <= ( 1 ) ) & ( (! ( (tk(P157)) <= (tk(P90)) )) & ( ( 1 ) <= (tk(P304)) ) ) )))
PROPERTY: CANConstruction-PT-030-ReachabilityCardinality-05 (reachable &!potential( ( ( (! ( (tk(P330)) <= ( 0 ) )) | ( (! ( ( 1 ) <= (tk(P689)) )) | ( (tk(P335)) <= (tk(P628)) ) ) ) | ( ( ( (tk(P388)) <= ( 1 ) ) & ( (tk(P150)) <= (tk(P189)) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P879)) )) & (! ( (tk(P423)) <= ( 0 ) )) ) & ( (! ( (tk(P516)) <= (tk(P456)) )) & ( (! ( ( 1 ) <= (tk(P9)) )) & ( (! ( ( 1 ) <= (tk(P296)) )) | (! ( (tk(P27)) <= ( 0 ) )) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P88)) )) & ( ( (tk(P75)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P469)) ) | ( (! ( (tk(P681)) <= (tk(P801)) )) & ( (! ( (tk(P69)) <= (tk(P40)) )) | ( (! ( (tk(P294)) <= (tk(P876)) )) | (! ( ( 1 ) <= (tk(P950)) )) ) ) ) ) ) ) ) ) )))
PROPERTY: CANConstruction-PT-030-ReachabilityCardinality-07 (reachable & potential(( ( ( ( 1 ) <= (tk(P723)) ) | ( (! ( (tk(P114)) <= ( 0 ) )) & ( ( ( (tk(P98)) <= ( 1 ) ) | ( ( (tk(P388)) <= (tk(P738)) ) | ( ( 1 ) <= (tk(P998)) ) ) ) | ( ( ( (tk(P912)) <= ( 0 ) ) | (! ( (tk(P934)) <= (tk(P51)) )) ) | ( ( ( (tk(P866)) <= (tk(P349)) ) & ( (tk(P709)) <= (tk(P312)) ) ) | ( ( ( 1 ) <= (tk(P140)) ) & (! ( (tk(P624)) <= (tk(P429)) )) ) ) ) ) ) ) & ( (! ( (tk(P403)) <= ( 0 ) )) | ( (! ( (tk(P818)) <= ( 1 ) )) | ( ( ( (tk(P668)) <= ( 1 ) ) & ( (tk(P744)) <= (tk(P17)) ) ) & ( ( (! ( (tk(P195)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P487)) ) | ( ( ( 1 ) <= (tk(P349)) ) & (! ( ( 1 ) <= (tk(P61)) )) ) ) ) & ( (! ( ( 1 ) <= (tk(P569)) )) | (! ( ( 1 ) <= (tk(P167)) )) ) ) ) ) ) )))
PROPERTY: CANConstruction-PT-030-ReachabilityCardinality-12 (reachable &!potential( ( ( (! ( (tk(P765)) <= (tk(P256)) )) | ( ( ( ( (tk(P728)) <= (tk(P896)) ) & ( ( 1 ) <= (tk(P11)) ) ) & ( (! ( (tk(P193)) <= ( 1 ) )) & ( ( ( ( (tk(P789)) <= (tk(P50)) ) & ( (tk(P637)) <= (tk(P22)) ) ) | ( ( ( 1 ) <= (tk(P107)) ) & ( (tk(P497)) <= ( 0 ) ) ) ) & ( ( (tk(P968)) <= (tk(P30)) ) | ( ( ( 1 ) <= (tk(P997)) ) & ( ( 1 ) <= (tk(P593)) ) ) ) ) ) ) | ( ( ( (tk(P1021)) <= ( 0 ) ) & (! ( (tk(P233)) <= ( 0 ) )) ) & ( (! ( (tk(P406)) <= (tk(P656)) )) & (! ( (tk(P993)) <= (tk(P349)) )) ) ) ) ) | ( ( ( ( (tk(P96)) <= (tk(P435)) ) | ( (tk(P501)) <= ( 0 ) ) ) & ( ( (tk(P656)) <= ( 0 ) ) | ( (tk(P840)) <= (tk(P228)) ) ) ) | ( ( ( ( 1 ) <= (tk(P240)) ) & (! ( (tk(P272)) <= ( 1 ) )) ) | ( (! ( ( 1 ) <= (tk(P900)) )) & ( (! ( ( 1 ) <= (tk(P344)) )) | ( (! ( ( 1 ) <= (tk(P408)) )) | ( (! ( (tk(P83)) <= ( 1 ) )) & ( ( (tk(P471)) <= (tk(P600)) ) | ( ( 1 ) <= (tk(P714)) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 593464 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16102064 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="CANConstruction-PT-030"
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 CANConstruction-PT-030, 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 r043-tajo-167813697100638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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