About the Execution of Smart+red for BridgeAndVehicles-PT-V50P20N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2029.819 | 123280.00 | 149089.00 | 103.70 | FFFTFFTFFT???TTT | normal |
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-167813696600231.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 BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696600231
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 20K Feb 25 12:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 455K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 12:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 218K Feb 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 856K Feb 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678779580921
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 07:39:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 07:39:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:39:42] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-14 07:39:42] [INFO ] Transformed 128 places.
[2023-03-14 07:39:42] [INFO ] Transformed 1328 transitions.
[2023-03-14 07:39:42] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 15) seen :6
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 1026 ms. (steps per millisecond=9 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 9) seen :1
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-14 07:39:45] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-14 07:39:45] [INFO ] Computed 7 place invariants in 14 ms
[2023-03-14 07:39:46] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-14 07:39:46] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-14 07:39:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-14 07:39:47] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-14 07:39:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:39:47] [INFO ] After 311ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-03-14 07:39:48] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 7 ms to minimize.
[2023-03-14 07:39:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-14 07:39:48] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 458 ms.
[2023-03-14 07:39:49] [INFO ] After 2092ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 63 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 213 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-14 07:39:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-14 07:39:49] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-14 07:39:50] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 853 ms. Remains : 125/128 places, 1327/1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 244169 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244169 steps, saw 67147 distinct states, run finished after 3005 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 07:39:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:39:53] [INFO ] Invariant cache hit.
[2023-03-14 07:39:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:39:53] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 07:39:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:39:54] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 07:39:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:39:54] [INFO ] After 248ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 07:39:54] [INFO ] After 809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-03-14 07:39:55] [INFO ] After 1533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 73 ms.
Support contains 63 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 79 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 93 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-14 07:39:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:39:55] [INFO ] Invariant cache hit.
[2023-03-14 07:39:55] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-14 07:39:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:39:55] [INFO ] Invariant cache hit.
[2023-03-14 07:39:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:39:55] [INFO ] Implicit Places using invariants and state equation in 327 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 427 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 67 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 589 ms. Remains : 124/125 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :1
FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 07:39:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-14 07:39:56] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-14 07:39:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:39:56] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 07:39:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-14 07:39:56] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 07:39:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:39:57] [INFO ] After 256ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 07:39:57] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-03-14 07:39:57] [INFO ] After 1206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 88 ms.
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 110 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 124/124 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 367130 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367130 steps, saw 100562 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-14 07:40:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:40:01] [INFO ] Invariant cache hit.
[2023-03-14 07:40:01] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-14 07:40:01] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 07:40:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:40:01] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 07:40:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:40:02] [INFO ] After 330ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 07:40:02] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-14 07:40:03] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 52 ms.
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 86 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 124/124 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 65 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-14 07:40:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:40:03] [INFO ] Invariant cache hit.
[2023-03-14 07:40:03] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-14 07:40:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:40:03] [INFO ] Invariant cache hit.
[2023-03-14 07:40:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-14 07:40:03] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-14 07:40:03] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-14 07:40:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-14 07:40:03] [INFO ] Invariant cache hit.
[2023-03-14 07:40:04] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1121 ms. Remains : 124/124 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 124 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 123 transition count 248
Applied a total of 1080 rules in 11 ms. Remains 123 /124 variables (removed 1) and now considering 248/1327 (removed 1079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 248 rows 123 cols
[2023-03-14 07:40:04] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-14 07:40:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-14 07:40:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 07:40:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-14 07:40:04] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 07:40:04] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-14 07:40:05] [INFO ] After 740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-14 07:40:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-14 07:40:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 1327 transitions and 9905 arcs took 23 ms.
[2023-03-14 07:40:05] [INFO ] Flatten gal took : 149 ms
Total runtime 23038 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BridgeAndVehicles (PT), instance V50P20N10
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 124 places, 1327 transitions, 9905 arcs.
Final Score: 8485.536
Took : 97 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1678779704201
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 11369:
syntax error
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="BridgeAndVehicles-PT-V50P20N10"
export BK_EXAMINATION="ReachabilityFireability"
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 BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityFireability"
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-167813696600231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;