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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 8.3K Mar 26 02:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 369K Mar 25 21:05 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 8.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 309K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 25 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 128K Mar 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 374K Mar 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 25 17:54 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.5M 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-V20P20N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591145012784

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:43:35] [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 00:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:43:35] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2020-06-03 00:43:35] [INFO ] Transformed 108 places.
[2020-06-03 00:43:35] [INFO ] Transformed 2228 transitions.
[2020-06-03 00:43:35] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 57 resets, run finished after 132 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1]
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 00:43:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-03 00:43:35] [INFO ] Computed 7 place invariants in 13 ms
[2020-06-03 00:43:35] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned unsat
[2020-06-03 00:43:35] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2020-06-03 00:43:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:43:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:36] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2020-06-03 00:43:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:43:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-03 00:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:43:36] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-06-03 00:43:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:43:36] [INFO ] [Nat]Added 102 Read/Feed constraints in 61 ms returned sat
[2020-06-03 00:43:36] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 247 ms.
[2020-06-03 00:43:41] [INFO ] Added : 205 causal constraints over 41 iterations in 4738 ms. Result :unknown
[2020-06-03 00:43:41] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned unsat
[2020-06-03 00:43:41] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-03 00:43:41] [INFO ] [Real]Absence check using 7 positive place invariants in 41 ms returned unsat
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 1079600 steps, including 7186 resets, run finished after 7670 ms. (steps per millisecond=140 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 106 transition count 2228
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 101 transition count 2224
Applied a total of 11 rules in 470 ms. Remains 101 /108 variables (removed 7) and now considering 2224/2228 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/108 places, 2224/2228 transitions.
Incomplete random walk after 1000000 steps, including 8020 resets, run finished after 6561 ms. (steps per millisecond=152 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 3115 resets, run finished after 2617 ms. (steps per millisecond=382 ) properties seen :[0]
Interrupted probabilistic random walk after 5565075 steps, run timeout after 30001 ms. (steps per millisecond=185 ) properties seen :[0]
Probabilistic random walk after 5565075 steps, saw 1476757 distinct states, run finished after 30014 ms. (steps per millisecond=185 ) properties seen :[0]
[2020-06-03 00:44:28] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2020-06-03 00:44:28] [INFO ] Computed 4 place invariants in 2 ms
[2020-06-03 00:44:28] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-06-03 00:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:44:29] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2020-06-03 00:44:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:44:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 00:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:44:29] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2020-06-03 00:44:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:44:29] [INFO ] [Nat]Added 102 Read/Feed constraints in 93 ms returned sat
[2020-06-03 00:44:30] [INFO ] Computed and/alt/rep : 2221/116846/283 causal constraints in 270 ms.
[2020-06-03 00:44:54] [INFO ] Added : 265 causal constraints over 53 iterations in 24365 ms.(timeout) Result :unknown
Incomplete Parikh walk after 673300 steps, including 6092 resets, run finished after 5979 ms. (steps per millisecond=112 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 405 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2224/2224 transitions.
Starting structural reductions, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 706 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2020-06-03 00:45:01] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2020-06-03 00:45:01] [INFO ] Computed 4 place invariants in 25 ms
[2020-06-03 00:45:03] [INFO ] Implicit Places using invariants in 1659 ms returned []
[2020-06-03 00:45:03] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2020-06-03 00:45:03] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:45:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:45:05] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4206 ms to find 2 implicit places.
[2020-06-03 00:45:05] [INFO ] Redundant transitions in 89 ms returned []
[2020-06-03 00:45:05] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:45:05] [INFO ] Computed 4 place invariants in 3 ms
[2020-06-03 00:45:08] [INFO ] Dead Transitions using invariants and state equation in 2881 ms returned []
Starting structural reductions, iteration 1 : 99/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 333 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2020-06-03 00:45:09] [INFO ] Redundant transitions in 115 ms returned []
[2020-06-03 00:45:09] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:45:09] [INFO ] Computed 4 place invariants in 2 ms
[2020-06-03 00:45:13] [INFO ] Dead Transitions using invariants and state equation in 4589 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/101 places, 2224/2224 transitions.
Incomplete random walk after 1000000 steps, including 8021 resets, run finished after 5966 ms. (steps per millisecond=167 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 3105 resets, run finished after 2482 ms. (steps per millisecond=402 ) properties seen :[0]
Probably explored full state space saw : 1489289 states, properties seen :[0]
Probabilistic random walk after 5612886 steps, saw 1489289 distinct states, run finished after 25742 ms. (steps per millisecond=218 ) properties seen :[0]
Interrupted probabilistic random walk after 5414849 steps, run timeout after 30216 ms. (steps per millisecond=179 ) properties seen :[0]
Exhaustive walk after 5414849 steps, saw 1437659 distinct states, run finished after 30216 ms. (steps per millisecond=179 ) properties seen :[0]
[2020-06-03 00:46:18] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:46:18] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:46:18] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2020-06-03 00:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:46:18] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2020-06-03 00:46:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:46:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 00:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:46:19] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-06-03 00:46:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:46:19] [INFO ] [Nat]Added 102 Read/Feed constraints in 48 ms returned sat
[2020-06-03 00:46:19] [INFO ] Computed and/alt/rep : 2221/116006/283 causal constraints in 80 ms.
[2020-06-03 00:46:29] [INFO ] Added : 230 causal constraints over 46 iterations in 10211 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 303 ms.
Incomplete Parikh walk after 750400 steps, including 6722 resets, run finished after 7329 ms. (steps per millisecond=102 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 207 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 2224/2224 transitions.
Starting structural reductions, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 578 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2020-06-03 00:46:37] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:46:37] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:46:39] [INFO ] Implicit Places using invariants in 1666 ms returned []
[2020-06-03 00:46:39] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:46:39] [INFO ] Computed 4 place invariants in 2 ms
[2020-06-03 00:46:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:46:42] [INFO ] Implicit Places using invariants and state equation in 2429 ms returned []
Implicit Place search using SMT with State Equation took 4128 ms to find 0 implicit places.
[2020-06-03 00:46:42] [INFO ] Redundant transitions in 46 ms returned []
[2020-06-03 00:46:42] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:46:42] [INFO ] Computed 4 place invariants in 12 ms
[2020-06-03 00:47:12] [INFO ] Performed 1824/2224 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-03 00:47:17] [INFO ] Dead Transitions using invariants and state equation in 35456 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 2224/2224 transitions.
Incomplete random walk after 100000 steps, including 802 resets, run finished after 578 ms. (steps per millisecond=173 ) properties seen :[0]
[2020-06-03 00:47:18] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2020-06-03 00:47:18] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:47:18] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-06-03 00:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:47:18] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2020-06-03 00:47:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:47:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2020-06-03 00:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:47:19] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2020-06-03 00:47:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:47:19] [INFO ] [Nat]Added 102 Read/Feed constraints in 79 ms returned sat
[2020-06-03 00:47:20] [INFO ] Computed and/alt/rep : 2221/116006/283 causal constraints in 531 ms.
[2020-06-03 00:47:31] [INFO ] Added : 230 causal constraints over 46 iterations in 11765 ms. Result :sat
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 99 transition count 286
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1939 place count 99 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1940 place count 98 transition count 285
Applied a total of 1940 rules in 7 ms. Remains 98 /99 variables (removed 1) and now considering 285/2224 (removed 1939) transitions.
// Phase 1: matrix 285 rows 98 cols
[2020-06-03 00:47:31] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:47:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 00:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:47:32] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-06-03 00:47:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:47:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 00:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:47:32] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2020-06-03 00:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 00:47:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 00:47:32] [INFO ] Computed and/alt/rep : 282/11325/282 causal constraints in 34 ms.
[2020-06-03 00:47:40] [INFO ] Added : 209 causal constraints over 42 iterations in 7724 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 158 ms.
[2020-06-03 00:47:40] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2020-06-03 00:47:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 57 ms.
[2020-06-03 00:47:41] [INFO ] Flatten gal took : 625 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N50

{
"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 00:47:42 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 71516,
"runtime": 3.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": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "A (G (((1 <= p41) OR ((p97 <= 0)) OR ((p6 <= p37) AND (p44 <= p28)))))",
"processed_size": 72,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 17014,
"conflict_clusters": 1,
"places": 99,
"places_significant": 95,
"singleton_clusters": 0,
"transitions": 2224
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"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: 2323/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3168
lola: finding significant places
lola: 99 places, 2224 transitions, 95 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 <= p68)
lola: LP says that atomic proposition is always false: (2 <= p2)
lola: A (G (((1 <= p41) OR ((p97 <= 0)) OR ((p6 <= p37) AND (p44 <= p28)))))
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 (((1 <= p41) OR ((p97 <= 0)) OR ((p6 <= p37) AND (p44 <= p28)))))
lola: processed formula length: 72
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: ((p41 <= 0) AND ((1 <= p97)) AND ((p37 + 1 <= p6) OR (p28 + 1 <= p44)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: memory consumption: 71516 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
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-V20P20N50"
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-V20P20N50, 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-158987913800350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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