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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15737.200 3600000.00 333676.00 239.90 FFFTFTFFFFFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700326.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-V20P10N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.7K Mar 26 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 25 20:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K Mar 25 20:55 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 7.8K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 129K Mar 25 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 376K Mar 25 12:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.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-V20P10N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591143956019

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:25:59] [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:25:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:26:00] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2020-06-03 00:26:00] [INFO ] Transformed 108 places.
[2020-06-03 00:26:00] [INFO ] Transformed 2228 transitions.
[2020-06-03 00:26:00] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 120 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 57 resets, run finished after 225 ms. (steps per millisecond=44 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 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 17 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 18 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 00:26:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-03 00:26:01] [INFO ] Computed 7 place invariants in 8 ms
[2020-06-03 00:26:01] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-03 00:26:01] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-06-03 00:26:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 00:26:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:26:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:01] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 00:26:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:26:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 69 ms returned sat
[2020-06-03 00:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:02] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2020-06-03 00:26:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:26:02] [INFO ] [Nat]Added 102 Read/Feed constraints in 64 ms returned sat
[2020-06-03 00:26:02] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 512 ms.
[2020-06-03 00:26:06] [INFO ] Added : 190 causal constraints over 38 iterations in 4371 ms. Result :unknown
[2020-06-03 00:26:06] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:26:06] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:06] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-03 00:26:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:26:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:07] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-06-03 00:26:07] [INFO ] [Nat]Added 102 Read/Feed constraints in 27 ms returned sat
[2020-06-03 00:26:07] [INFO ] Deduced a trap composed of 5 places in 309 ms
[2020-06-03 00:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2020-06-03 00:26:07] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 448 ms.
[2020-06-03 00:26:10] [INFO ] Added : 108 causal constraints over 22 iterations in 2615 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-06-03 00:26:10] [INFO ] [Real]Absence check using 7 positive place invariants in 70 ms returned unsat
[2020-06-03 00:26:10] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 00:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:10] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2020-06-03 00:26:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:26:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:11] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-06-03 00:26:11] [INFO ] [Nat]Added 102 Read/Feed constraints in 19 ms returned sat
[2020-06-03 00:26:11] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 299 ms.
[2020-06-03 00:26:16] [INFO ] Added : 205 causal constraints over 41 iterations in 4753 ms. Result :unknown
[2020-06-03 00:26:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:16] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-06-03 00:26:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:26:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 00:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:26:16] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-06-03 00:26:16] [INFO ] [Nat]Added 102 Read/Feed constraints in 41 ms returned sat
[2020-06-03 00:26:16] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 96 ms.
[2020-06-03 00:26:21] [INFO ] Added : 190 causal constraints over 38 iterations in 4807 ms. Result :unknown
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 1215000 steps, including 7967 resets, run finished after 9308 ms. (steps per millisecond=130 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1153100 steps, including 7616 resets, run finished after 8738 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 15800 steps, including 494 resets, run finished after 86 ms. (steps per millisecond=183 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1063700 steps, including 7127 resets, run finished after 7650 ms. (steps per millisecond=139 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 13 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.44 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 3 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 16 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 102 transition count 2225
Applied a total of 9 rules in 711 ms. Remains 102 /108 variables (removed 6) and now considering 2225/2228 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 102/108 places, 2225/2228 transitions.
Incomplete random walk after 1000000 steps, including 8002 resets, run finished after 6731 ms. (steps per millisecond=148 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2757 resets, run finished after 2395 ms. (steps per millisecond=417 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3318 resets, run finished after 2917 ms. (steps per millisecond=342 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3320 resets, run finished after 2758 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3130 resets, run finished after 2699 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0]
Probably explored full state space saw : 1533377 states, properties seen :[0, 0, 0, 0]
Probabilistic random walk after 5780809 steps, saw 1533377 distinct states, run finished after 29532 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 5553089 steps, run timeout after 30001 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0]
Exhaustive walk after 5553089 steps, saw 1474145 distinct states, run finished after 30005 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0]
[2020-06-03 00:28:04] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 102 cols
[2020-06-03 00:28:04] [INFO ] Computed 4 place invariants in 6 ms
[2020-06-03 00:28:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 00:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:05] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 00:28:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:28:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 10 ms returned sat
[2020-06-03 00:28:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:05] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2020-06-03 00:28:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:28:05] [INFO ] [Nat]Added 102 Read/Feed constraints in 37 ms returned sat
[2020-06-03 00:28:05] [INFO ] Computed and/alt/rep : 2222/116898/284 causal constraints in 102 ms.
[2020-06-03 00:28:11] [INFO ] Added : 218 causal constraints over 44 iterations in 6019 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 231 ms.
[2020-06-03 00:28:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 00:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:11] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 00:28:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:28:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-03 00:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:12] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2020-06-03 00:28:12] [INFO ] [Nat]Added 102 Read/Feed constraints in 31 ms returned sat
[2020-06-03 00:28:12] [INFO ] Computed and/alt/rep : 2222/116898/284 causal constraints in 210 ms.
[2020-06-03 00:28:23] [INFO ] Added : 210 causal constraints over 42 iterations in 10883 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 165 ms.
[2020-06-03 00:28:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 00:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:23] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-06-03 00:28:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:28:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-03 00:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:23] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2020-06-03 00:28:23] [INFO ] [Nat]Added 102 Read/Feed constraints in 17 ms returned sat
[2020-06-03 00:28:24] [INFO ] Computed and/alt/rep : 2222/116898/284 causal constraints in 103 ms.
[2020-06-03 00:28:40] [INFO ] Added : 250 causal constraints over 50 iterations in 16733 ms. Result :unknown
[2020-06-03 00:28:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 00:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:40] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2020-06-03 00:28:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:28:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 31 ms returned sat
[2020-06-03 00:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:28:41] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-06-03 00:28:41] [INFO ] [Nat]Added 102 Read/Feed constraints in 31 ms returned sat
[2020-06-03 00:28:41] [INFO ] Computed and/alt/rep : 2222/116898/284 causal constraints in 84 ms.
[2020-06-03 00:28:58] [INFO ] Added : 240 causal constraints over 48 iterations in 17011 ms. Result :unknown
Incomplete Parikh walk after 552000 steps, including 5177 resets, run finished after 4607 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 629800 steps, including 5851 resets, run finished after 5300 ms. (steps per millisecond=118 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 388900 steps, including 3818 resets, run finished after 3351 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 12200 steps, including 461 resets, run finished after 50 ms. (steps per millisecond=244 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 13 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 2225/2225 transitions.
Applied a total of 0 rules in 384 ms. Remains 102 /102 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 2225/2225 transitions.
Starting structural reductions, iteration 0 : 102/102 places, 2225/2225 transitions.
Applied a total of 0 rules in 246 ms. Remains 102 /102 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2020-06-03 00:29:12] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 102 cols
[2020-06-03 00:29:12] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:29:12] [INFO ] Implicit Places using invariants in 786 ms returned []
[2020-06-03 00:29:13] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 102 cols
[2020-06-03 00:29:13] [INFO ] Computed 4 place invariants in 4 ms
[2020-06-03 00:29:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:29:15] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3535 ms to find 2 implicit places.
[2020-06-03 00:29:15] [INFO ] Redundant transitions in 103 ms returned []
[2020-06-03 00:29:15] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2020-06-03 00:29:15] [INFO ] Computed 4 place invariants in 2 ms
[2020-06-03 00:29:17] [INFO ] Dead Transitions using invariants and state equation in 1892 ms returned []
Starting structural reductions, iteration 1 : 100/102 places, 2225/2225 transitions.
Applied a total of 0 rules in 310 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2020-06-03 00:29:18] [INFO ] Redundant transitions in 130 ms returned []
[2020-06-03 00:29:18] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2020-06-03 00:29:18] [INFO ] Computed 4 place invariants in 1 ms
[2020-06-03 00:29:20] [INFO ] Dead Transitions using invariants and state equation in 2122 ms returned []
Finished structural reductions, in 2 iterations. Remains : 100/102 places, 2225/2225 transitions.
Incomplete random walk after 1000000 steps, including 8001 resets, run finished after 6124 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2751 resets, run finished after 2245 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3313 resets, run finished after 2534 ms. (steps per millisecond=394 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3315 resets, run finished after 2507 ms. (steps per millisecond=398 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3130 resets, run finished after 2422 ms. (steps per millisecond=412 ) properties seen :[0, 0, 0, 0]
Probably explored full state space saw : 1533451 states, properties seen :[0, 0, 0, 0]
Probabilistic random walk after 5781080 steps, saw 1533451 distinct states, run finished after 27010 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0]
Explored full state space saw : 1533462 states, properties seen :[0, 0, 0, 0]
Exhaustive walk after 5781121 steps, saw 1533462 distinct states, run finished after 25966 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.

--------------------
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-V20P10N50"
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-V20P10N50, 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-158987913700326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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