fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913800390
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V50P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15726.660 3600000.00 179510.00 129.20 ?FFTTFFTFTFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913800390.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V50P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913800390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 14K Mar 26 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 26 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 92K Mar 25 21:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 262K Mar 25 21:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 328K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Mar 25 17:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 380K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.6M Mar 24 05:37 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-V50P50N20-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591149078348

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 01:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:51:20] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2020-06-03 01:51:20] [INFO ] Transformed 138 places.
[2020-06-03 01:51:20] [INFO ] Transformed 2348 transitions.
[2020-06-03 01:51:20] [INFO ] Parsed PT model containing 138 places and 2348 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 73 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 158 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0]
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 01:51:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2020-06-03 01:51:20] [INFO ] Computed 7 place invariants in 15 ms
[2020-06-03 01:51:21] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-06-03 01:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:51:21] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2020-06-03 01:51:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:51:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-03 01:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:51:21] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-03 01:51:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 01:51:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 87 ms returned sat
[2020-06-03 01:51:22] [INFO ] Deduced a trap composed of 24 places in 424 ms
[2020-06-03 01:51:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 477 ms
[2020-06-03 01:51:22] [INFO ] Computed and/alt/rep : 2345/58949/287 causal constraints in 156 ms.
[2020-06-03 01:51:26] [INFO ] Added : 205 causal constraints over 41 iterations in 4242 ms. Result :unknown
[2020-06-03 01:51:26] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-03 01:51:26] [INFO ] [Real]Absence check using 7 positive place invariants in 52 ms returned unsat
[2020-06-03 01:51:26] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 01:51:26] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2020-06-03 01:51:26] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned unsat
[2020-06-03 01:51:26] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 01:51:27] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 86900 steps, including 1009 resets, run finished after 538 ms. (steps per millisecond=161 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 2348/2348 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.37 ms
Applied a total of 1 rules in 408 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2020-06-03 01:51:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-03 01:51:27] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 01:51:29] [INFO ] Dead Transitions using invariants and state equation in 1365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 5280 ms. (steps per millisecond=189 ) properties seen :[0]
Incomplete Best-First random walk after 1000012 steps, including 840 resets, run finished after 1922 ms. (steps per millisecond=520 ) properties seen :[0]
Interrupted probabilistic random walk after 5993328 steps, run timeout after 30001 ms. (steps per millisecond=199 ) properties seen :[0]
Probabilistic random walk after 5993328 steps, saw 1541444 distinct states, run finished after 30001 ms. (steps per millisecond=199 ) properties seen :[0]
[2020-06-03 01:52:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-03 01:52:06] [INFO ] Computed 5 place invariants in 13 ms
[2020-06-03 01:52:06] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-03 01:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:52:06] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-06-03 01:52:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:52:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 41 ms returned sat
[2020-06-03 01:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:52:07] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2020-06-03 01:52:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 01:52:07] [INFO ] [Nat]Added 42 Read/Feed constraints in 118 ms returned sat
[2020-06-03 01:52:07] [INFO ] Computed and/alt/rep : 2345/58949/287 causal constraints in 207 ms.
[2020-06-03 01:52:28] [INFO ] Added : 265 causal constraints over 53 iterations in 21528 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 297 ms.
Incomplete Parikh walk after 103000 steps, including 1089 resets, run finished after 639 ms. (steps per millisecond=161 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 241 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 295 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2020-06-03 01:52:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-03 01:52:30] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:52:30] [INFO ] Implicit Places using invariants in 518 ms returned []
[2020-06-03 01:52:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2020-06-03 01:52:30] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:52:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 01:52:32] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1852 ms to find 1 implicit places.
[2020-06-03 01:52:32] [INFO ] Redundant transitions in 94 ms returned []
[2020-06-03 01:52:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:52:32] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 01:52:34] [INFO ] Dead Transitions using invariants and state equation in 2046 ms returned []
Starting structural reductions, iteration 1 : 135/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 253 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2020-06-03 01:52:34] [INFO ] Redundant transitions in 156 ms returned []
[2020-06-03 01:52:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:52:34] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:52:36] [INFO ] Dead Transitions using invariants and state equation in 1557 ms returned []
Finished structural reductions, in 2 iterations. Remains : 135/136 places, 2348/2348 transitions.
Incomplete random walk after 1000001 steps, including 2316 resets, run finished after 4538 ms. (steps per millisecond=220 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 840 resets, run finished after 1671 ms. (steps per millisecond=598 ) properties seen :[0]
Interrupted probabilistic random walk after 5976300 steps, run timeout after 30001 ms. (steps per millisecond=199 ) properties seen :[0]
Probabilistic random walk after 5976300 steps, saw 1532245 distinct states, run finished after 30001 ms. (steps per millisecond=199 ) properties seen :[0]
[2020-06-03 01:53:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:53:12] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:53:12] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-03 01:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:12] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-06-03 01:53:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:53:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-03 01:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:12] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-06-03 01:53:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 01:53:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 61 ms returned sat
[2020-06-03 01:53:12] [INFO ] Computed and/alt/rep : 2345/56399/287 causal constraints in 48 ms.
[2020-06-03 01:53:22] [INFO ] Added : 215 causal constraints over 43 iterations in 9659 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 188 ms.
Incomplete Parikh walk after 55700 steps, including 976 resets, run finished after 277 ms. (steps per millisecond=201 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 163 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2348/2348 transitions.
Starting structural reductions, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 192 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2020-06-03 01:53:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:53:23] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 01:53:23] [INFO ] Implicit Places using invariants in 343 ms returned []
[2020-06-03 01:53:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:53:23] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:53:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 01:53:24] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2020-06-03 01:53:24] [INFO ] Redundant transitions in 37 ms returned []
[2020-06-03 01:53:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:53:24] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:53:26] [INFO ] Dead Transitions using invariants and state equation in 2003 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 2348/2348 transitions.
Incomplete random walk after 100000 steps, including 231 resets, run finished after 461 ms. (steps per millisecond=216 ) properties seen :[0]
[2020-06-03 01:53:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:53:27] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:53:27] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-03 01:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:27] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-06-03 01:53:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:53:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-03 01:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:27] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-03 01:53:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 01:53:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 58 ms returned sat
[2020-06-03 01:53:27] [INFO ] Computed and/alt/rep : 2345/56399/287 causal constraints in 55 ms.
[2020-06-03 01:53:38] [INFO ] Added : 215 causal constraints over 43 iterations in 10468 ms. Result :sat
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 135 transition count 290
Applied a total of 2058 rules in 17 ms. Remains 135 /135 variables (removed 0) and now considering 290/2348 (removed 2058) transitions.
// Phase 1: matrix 290 rows 135 cols
[2020-06-03 01:53:38] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:53:38] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-03 01:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:38] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-03 01:53:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:53:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-03 01:53:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:53:38] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-06-03 01:53:38] [INFO ] Computed and/alt/rep : 287/7161/287 causal constraints in 20 ms.
[2020-06-03 01:53:44] [INFO ] Added : 240 causal constraints over 57 iterations in 6185 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2020-06-03 01:53:44] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2020-06-03 01:53:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 52 ms.
[2020-06-03 01:53:45] [INFO ] Flatten gal took : 304 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N20

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 01:53:45 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 77100,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((p53 <= p110) AND (p111 + p112 + 1 <= p107) AND ((1 <= p0)))))",
"processed_size": 69,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 17987,
"conflict_clusters": 3,
"places": 135,
"places_significant": 130,
"singleton_clusters": 0,
"transitions": 2348
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2483/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4320
lola: finding significant places
lola: 135 places, 2348 transitions, 130 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p108 + p109)
lola: E (F (((p53 <= p110) AND (p111 + p112 + 1 <= p107) AND ((1 <= p0)))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p53 <= p110) AND (p111 + p112 + 1 <= p107) AND ((1 <= p0)))))
lola: processed formula length: 69
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p53 <= p110) AND (p111 + p112 + 1 <= p107) AND ((1 <= p0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: memory consumption: 77100 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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-V50P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-PT-V50P50N20, 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 r182-oct2-158987913800390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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