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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K Mar 26 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 26 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Mar 25 20:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 25 20:49 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 5.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 25 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 25 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Mar 25 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Mar 25 12:14 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 598K 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-V20P10N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591143196934

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:13:19] [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:13:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:13:19] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-03 00:13:19] [INFO ] Transformed 68 places.
[2020-06-03 00:13:19] [INFO ] Transformed 548 transitions.
[2020-06-03 00:13:19] [INFO ] Parsed PT model containing 68 places and 548 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 56 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 00:13:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-03 00:13:19] [INFO ] Computed 7 place invariants in 16 ms
[2020-06-03 00:13:19] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-06-03 00:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:20] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-03 00:13:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-03 00:13:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:20] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-03 00:13:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-03 00:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:20] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-03 00:13:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:13:20] [INFO ] [Nat]Added 22 Read/Feed constraints in 28 ms returned sat
[2020-06-03 00:13:20] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2020-06-03 00:13:20] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-06-03 00:13:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2020-06-03 00:13:20] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 40 ms.
[2020-06-03 00:13:22] [INFO ] Added : 125 causal constraints over 30 iterations in 1522 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 00:13:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:22] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2020-06-03 00:13:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 00:13:22] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-03 00:13:22] [INFO ] [Real]Absence check using 7 positive place invariants in 25 ms returned unsat
[2020-06-03 00:13:22] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 00:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:22] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2020-06-03 00:13:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 62700 steps, including 1108 resets, run finished after 257 ms. (steps per millisecond=243 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 66 transition count 548
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 91 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2020-06-03 00:13:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-06-03 00:13:23] [INFO ] Computed 5 place invariants in 4 ms
[2020-06-03 00:13:24] [INFO ] Dead Transitions using invariants and state equation in 705 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 547/548 transitions.
Incomplete random walk after 1000001 steps, including 5631 resets, run finished after 1936 ms. (steps per millisecond=516 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1995 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties seen :[0]
Interrupted probabilistic random walk after 17619589 steps, run timeout after 30001 ms. (steps per millisecond=587 ) properties seen :[0]
Probabilistic random walk after 17619589 steps, saw 3957452 distinct states, run finished after 30012 ms. (steps per millisecond=587 ) properties seen :[0]
[2020-06-03 00:13:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-06-03 00:13:56] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:13:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-03 00:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:56] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-03 00:13:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:13:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-03 00:13:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:13:56] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 00:13:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:13:56] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2020-06-03 00:13:57] [INFO ] Deduced a trap composed of 5 places in 124 ms
[2020-06-03 00:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2020-06-03 00:13:57] [INFO ] Computed and/alt/rep : 544/7789/126 causal constraints in 24 ms.
[2020-06-03 00:13:58] [INFO ] Added : 117 causal constraints over 24 iterations in 881 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 71200 steps, including 1204 resets, run finished after 167 ms. (steps per millisecond=426 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2020-06-03 00:13:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-06-03 00:13:58] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-03 00:13:58] [INFO ] Implicit Places using invariants in 270 ms returned []
[2020-06-03 00:13:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2020-06-03 00:13:58] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:13:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:13:59] [INFO ] Implicit Places using invariants and state equation in 922 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1222 ms to find 2 implicit places.
[2020-06-03 00:13:59] [INFO ] Redundant transitions in 32 ms returned []
[2020-06-03 00:13:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:13:59] [INFO ] Computed 5 place invariants in 26 ms
[2020-06-03 00:14:00] [INFO ] Dead Transitions using invariants and state equation in 775 ms returned []
Starting structural reductions, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2020-06-03 00:14:00] [INFO ] Redundant transitions in 8 ms returned []
[2020-06-03 00:14:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:14:00] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:14:00] [INFO ] Dead Transitions using invariants and state equation in 471 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/65 places, 547/547 transitions.
Incomplete random walk after 1000000 steps, including 5631 resets, run finished after 1673 ms. (steps per millisecond=597 ) properties seen :[0]
Incomplete Best-First random walk after 1000003 steps, including 1998 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties seen :[0]
Interrupted probabilistic random walk after 19619017 steps, run timeout after 30001 ms. (steps per millisecond=653 ) properties seen :[0]
Probabilistic random walk after 19619017 steps, saw 4399149 distinct states, run finished after 30001 ms. (steps per millisecond=653 ) properties seen :[0]
[2020-06-03 00:14:33] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:14:33] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 00:14:33] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-03 00:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-03 00:14:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-03 00:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:33] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-03 00:14:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:14:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2020-06-03 00:14:33] [INFO ] Deduced a trap composed of 5 places in 340 ms
[2020-06-03 00:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2020-06-03 00:14:33] [INFO ] Computed and/alt/rep : 544/6949/126 causal constraints in 20 ms.
[2020-06-03 00:14:34] [INFO ] Added : 124 causal constraints over 26 iterations in 905 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 63100 steps, including 1090 resets, run finished after 167 ms. (steps per millisecond=377 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 12 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2020-06-03 00:14:34] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:14:34] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-03 00:14:35] [INFO ] Implicit Places using invariants in 393 ms returned []
[2020-06-03 00:14:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:14:35] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-03 00:14:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:14:35] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2020-06-03 00:14:35] [INFO ] Redundant transitions in 3 ms returned []
[2020-06-03 00:14:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:14:35] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-03 00:14:35] [INFO ] Dead Transitions using invariants and state equation in 303 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Incomplete random walk after 100000 steps, including 563 resets, run finished after 165 ms. (steps per millisecond=606 ) properties seen :[0]
[2020-06-03 00:14:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2020-06-03 00:14:36] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:14:36] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-03 00:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:36] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 00:14:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 00:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-03 00:14:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:14:36] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-06-03 00:14:36] [INFO ] Deduced a trap composed of 5 places in 257 ms
[2020-06-03 00:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2020-06-03 00:14:36] [INFO ] Computed and/alt/rep : 544/6949/126 causal constraints in 17 ms.
[2020-06-03 00:14:37] [INFO ] Added : 124 causal constraints over 26 iterations in 1090 ms. Result :sat
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 63 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 61 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 61 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 426 place count 59 transition count 125
Applied a total of 426 rules in 8 ms. Remains 59 /63 variables (removed 4) and now considering 125/547 (removed 422) transitions.
// Phase 1: matrix 125 rows 59 cols
[2020-06-03 00:14:37] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 00:14:37] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-03 00:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:37] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 00:14:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:14:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-03 00:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:14:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-03 00:14:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 00:14:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-03 00:14:37] [INFO ] Computed and/alt/rep : 122/1242/122 causal constraints in 16 ms.
[2020-06-03 00:14:38] [INFO ] Added : 107 causal constraints over 23 iterations in 759 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 00:14:38] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-03 00:14:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 00:14:38] [INFO ] Flatten gal took : 137 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V20P10N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V20P10N10

{
"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:14:39 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 22800,
"runtime": 3.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": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p23 + 1 <= p61))))",
"processed_size": 26,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3984,
"conflict_clusters": 2,
"places": 63,
"places_significant": 58,
"singleton_clusters": 0,
"transitions": 547
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"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: 610/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2016
lola: finding significant places
lola: 63 places, 547 transitions, 58 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: (2 <= p58)
lola: LP says that atomic proposition is always false: (2 <= p35)
lola: E (F (((p23 + 1 <= p61))))
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 (((p23 + 1 <= p61))))
lola: processed formula length: 26
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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p23 + 1 <= p61))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 22800 KB
lola: time consumption: 3 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-V20P10N10"
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-V20P10N10, 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-158987913700310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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