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-158987913900430.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-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 20K Mar 26 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 26 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Mar 25 22:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K Mar 25 22:17 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 17K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 75K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 233K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 25 17:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 25 17:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 187K Mar 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 541K Mar 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K 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.3M 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-V80P50N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591153331534

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:02:14] [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 03:02:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:02:14] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2020-06-03 03:02:14] [INFO ] Transformed 188 places.
[2020-06-03 03:02:14] [INFO ] Transformed 2108 transitions.
[2020-06-03 03:02:14] [INFO ] Parsed PT model containing 188 places and 2108 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 131 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 145 ms. (steps per millisecond=68 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 03:02:15] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2020-06-03 03:02:15] [INFO ] Computed 7 place invariants in 20 ms
[2020-06-03 03:02:15] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned unsat
[2020-06-03 03:02:15] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2020-06-03 03:02:15] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-06-03 03:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:02:15] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 03:02:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:02:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-03 03:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:02:15] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-03 03:02:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 03:02:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 121 ms returned sat
[2020-06-03 03:02:16] [INFO ] Deduced a trap composed of 5 places in 816 ms
[2020-06-03 03:02:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 927 ms
[2020-06-03 03:02:17] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 172 ms.
[2020-06-03 03:02:20] [INFO ] Added : 230 causal constraints over 46 iterations in 3769 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:02:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 03:02:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 03:02:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 03:02:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 03:02:20] [INFO ] [Real]Absence check using 7 positive place invariants in 44 ms returned unsat
[2020-06-03 03:02:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 188/188 places, 2108/2108 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.70 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 588 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2020-06-03 03:02:21] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 03:02:21] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 03:02:22] [INFO ] Dead Transitions using invariants and state equation in 1291 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 1000000 steps, including 1424 resets, run finished after 4901 ms. (steps per millisecond=204 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 546 resets, run finished after 1755 ms. (steps per millisecond=569 ) properties seen :[0]
Interrupted probabilistic random walk after 6095745 steps, run timeout after 30001 ms. (steps per millisecond=203 ) properties seen :[0]
Probabilistic random walk after 6095745 steps, saw 1635136 distinct states, run finished after 30001 ms. (steps per millisecond=203 ) properties seen :[0]
[2020-06-03 03:02:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 03:02:59] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 03:02:59] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 03:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:02:59] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-03 03:02:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:02:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-03 03:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:00] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2020-06-03 03:03:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 03:03:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 222 ms returned sat
[2020-06-03 03:03:01] [INFO ] Deduced a trap composed of 5 places in 658 ms
[2020-06-03 03:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 706 ms
[2020-06-03 03:03:01] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 75 ms.
[2020-06-03 03:03:26] [INFO ] Added : 320 causal constraints over 65 iterations in 25461 ms.(timeout) Result :unknown
Incomplete Parikh walk after 161100 steps, including 1075 resets, run finished after 812 ms. (steps per millisecond=198 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 149 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 461 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-03 03:03:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 03:03:28] [INFO ] Computed 5 place invariants in 10 ms
[2020-06-03 03:03:29] [INFO ] Implicit Places using invariants in 767 ms returned []
[2020-06-03 03:03:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-03 03:03:29] [INFO ] Computed 5 place invariants in 11 ms
[2020-06-03 03:03:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 03:03:33] [INFO ] Implicit Places using invariants and state equation in 4772 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5556 ms to find 1 implicit places.
[2020-06-03 03:03:34] [INFO ] Redundant transitions in 110 ms returned []
[2020-06-03 03:03:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:03:34] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 03:03:39] [INFO ] Dead Transitions using invariants and state equation in 5031 ms returned []
Starting structural reductions, iteration 1 : 184/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 248 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-03 03:03:39] [INFO ] Redundant transitions in 109 ms returned []
[2020-06-03 03:03:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:03:39] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 03:03:43] [INFO ] Dead Transitions using invariants and state equation in 4093 ms returned []
Finished structural reductions, in 2 iterations. Remains : 184/185 places, 2107/2107 transitions.
Incomplete random walk after 1000000 steps, including 1424 resets, run finished after 4510 ms. (steps per millisecond=221 ) properties seen :[0]
Incomplete Best-First random walk after 1000009 steps, including 546 resets, run finished after 1573 ms. (steps per millisecond=635 ) properties seen :[0]
Interrupted probabilistic random walk after 6015757 steps, run timeout after 30001 ms. (steps per millisecond=200 ) properties seen :[0]
Probabilistic random walk after 6015757 steps, saw 1613911 distinct states, run finished after 30014 ms. (steps per millisecond=200 ) properties seen :[0]
[2020-06-03 03:04:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:04:19] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 03:04:19] [INFO ] [Real]Absence check using 5 positive place invariants in 34 ms returned sat
[2020-06-03 03:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:20] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2020-06-03 03:04:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 66 ms returned sat
[2020-06-03 03:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:21] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2020-06-03 03:04:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 03:04:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 112 ms returned sat
[2020-06-03 03:04:22] [INFO ] Deduced a trap composed of 5 places in 1079 ms
[2020-06-03 03:04:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1209 ms
[2020-06-03 03:04:22] [INFO ] Computed and/alt/rep : 2104/34129/366 causal constraints in 63 ms.
[2020-06-03 03:04:44] [INFO ] Added : 335 causal constraints over 67 iterations in 21522 ms. Result :unknown
Incomplete Parikh walk after 64500 steps, including 821 resets, run finished after 240 ms. (steps per millisecond=268 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 224 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 190 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-03 03:04:44] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:04:44] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 03:04:45] [INFO ] Implicit Places using invariants in 471 ms returned []
[2020-06-03 03:04:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:04:45] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 03:04:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 03:04:46] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
[2020-06-03 03:04:46] [INFO ] Redundant transitions in 52 ms returned []
[2020-06-03 03:04:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:04:46] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 03:04:47] [INFO ] Dead Transitions using invariants and state equation in 1149 ms returned []
Finished structural reductions, in 1 iterations. Remains : 184/184 places, 2107/2107 transitions.
Incomplete random walk after 100000 steps, including 142 resets, run finished after 486 ms. (steps per millisecond=205 ) properties seen :[0]
[2020-06-03 03:04:48] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 184 cols
[2020-06-03 03:04:48] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 03:04:48] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 03:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:48] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2020-06-03 03:04:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:04:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-03 03:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:04:48] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-03 03:04:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 03:04:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 50 ms returned sat
[2020-06-03 03:04:49] [INFO ] Deduced a trap composed of 5 places in 234 ms
[2020-06-03 03:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2020-06-03 03:04:49] [INFO ] Computed and/alt/rep : 2104/34129/366 causal constraints in 53 ms.
[2020-06-03 03:05:08] [INFO ] Added : 335 causal constraints over 67 iterations in 19510 ms. Result :unknown
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 184 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 182 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 182 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 181 transition count 366
Applied a total of 1744 rules in 40 ms. Remains 181 /184 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
// Phase 1: matrix 366 rows 181 cols
[2020-06-03 03:05:08] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 03:05:08] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 03:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:08] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-06-03 03:05:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:05:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-03 03:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:05:09] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-06-03 03:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 03:05:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 03:05:09] [INFO ] Computed and/alt/rep : 363/10185/363 causal constraints in 23 ms.
[2020-06-03 03:05:20] [INFO ] Added : 325 causal constraints over 65 iterations in 10901 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 277 ms.
[2020-06-03 03:05:20] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2020-06-03 03:05:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
[2020-06-03 03:05:20] [INFO ] Flatten gal took : 192 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N10

{
"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 03:05:21 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 72612,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p84) OR ((p0 <= 1) AND (3 <= p82)))))",
"processed_size": 51,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 15785,
"conflict_clusters": 2,
"places": 184,
"places_significant": 179,
"singleton_clusters": 0,
"transitions": 2107
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"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: 2291/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5888
lola: finding significant places
lola: 184 places, 2107 transitions, 179 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: A (G (((2 <= p84) OR ((p0 <= 1) AND (3 <= p82)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= p84) OR ((p0 <= 1) AND (3 <= p82)))))
lola: processed formula length: 51
lola: 2 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: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p84 <= 1) AND ((2 <= p0) OR (p82 <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: memory consumption: 72612 KB
lola: time consumption: 6 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-V80P50N10"
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-V80P50N10, 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-158987913900430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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