fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038176900103
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4280.279 3600000.00 103258.00 80.90 ?FFTTFFFFFTTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176900103.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176900103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 46K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 255K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 443K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 113K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Mar 22 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 22 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 598K May 5 16:51 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-V20P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620930093103

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:21:34] [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]
[2021-05-13 18:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:21:34] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-13 18:21:34] [INFO ] Transformed 68 places.
[2021-05-13 18:21:34] [INFO ] Transformed 548 transitions.
[2021-05-13 18:21:34] [INFO ] Parsed PT model containing 68 places and 548 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 16 ms. (steps per millisecond=625 ) 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 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 13 ms. (steps per millisecond=769 ) 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 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-13 18:21:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2021-05-13 18:21:35] [INFO ] Computed 7 place invariants in 8 ms
[2021-05-13 18:21:35] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2021-05-13 18:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:35] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-13 18:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:21:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:35] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-13 18:21:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:21:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:21:35] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 29 ms.
[2021-05-13 18:21:36] [INFO ] Added : 124 causal constraints over 28 iterations in 1446 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2021-05-13 18:21:37] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:21:37] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:37] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-13 18:21:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:21:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 18:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:21:37] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-13 18:21:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2021-05-13 18:21:37] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 38 ms.
[2021-05-13 18:21:39] [INFO ] Added : 125 causal constraints over 26 iterations in 2272 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 62 ms.
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned unsat
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 63600 steps, including 1125 resets, run finished after 340 ms. (steps per millisecond=187 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 61000 steps, including 1107 resets, run finished after 289 ms. (steps per millisecond=211 ) properties seen :[0] could not realise parikh vector
Support contains 5 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.16 ms
Applied a total of 1 rules in 114 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:21:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:21:40] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:21:41] [INFO ] Dead Transitions using invariants and state equation in 494 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 1000004 steps, including 5631 resets, run finished after 2260 ms. (steps per millisecond=442 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 2292 resets, run finished after 1378 ms. (steps per millisecond=725 ) properties seen :[0]
Interrupted probabilistic random walk after 14106146 steps, run timeout after 30001 ms. (steps per millisecond=470 ) properties seen :[0]
Probabilistic random walk after 14106146 steps, saw 3183608 distinct states, run finished after 30004 ms. (steps per millisecond=470 ) properties seen :[0]
[2021-05-13 18:22:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:22:14] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:22:14] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-13 18:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:14] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-13 18:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-13 18:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:14] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 18:22:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:22:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2021-05-13 18:22:14] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 23 ms.
[2021-05-13 18:22:15] [INFO ] Added : 87 causal constraints over 18 iterations in 600 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
Incomplete Parikh walk after 12500 steps, including 518 resets, run finished after 71 ms. (steps per millisecond=176 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 37 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 36 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:22:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:22:15] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:22:15] [INFO ] Implicit Places using invariants in 136 ms returned []
[2021-05-13 18:22:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:22:15] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:22:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:22:16] [INFO ] Implicit Places using invariants and state equation in 267 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 407 ms to find 2 implicit places.
[2021-05-13 18:22:16] [INFO ] Redundant transitions in 35 ms returned []
[2021-05-13 18:22:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:16] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:22:16] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Starting structural reductions, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 27 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:22:16] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-13 18:22:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:16] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:22:16] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 1946 ms. (steps per millisecond=513 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 2291 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties seen :[0]
Interrupted probabilistic random walk after 14647201 steps, run timeout after 30001 ms. (steps per millisecond=488 ) properties seen :[0]
Probabilistic random walk after 14647201 steps, saw 3300992 distinct states, run finished after 30002 ms. (steps per millisecond=488 ) properties seen :[0]
[2021-05-13 18:22:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:49] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 18:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:49] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-13 18:22:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-13 18:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:49] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-13 18:22:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:22:49] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2021-05-13 18:22:49] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 34 ms.
[2021-05-13 18:22:50] [INFO ] Added : 124 causal constraints over 25 iterations in 1042 ms. Result :sat
[2021-05-13 18:22:51] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2021-05-13 18:22:51] [INFO ] Deduced a trap composed of 5 places in 78 ms
[2021-05-13 18:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
Attempting to minimize the solution found.
Minimization took 59 ms.
Incomplete Parikh walk after 51400 steps, including 1029 resets, run finished after 212 ms. (steps per millisecond=242 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 42 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 29 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:22:51] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:22:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2021-05-13 18:22:51] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:22:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:22:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2021-05-13 18:22:52] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-13 18:22:52] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:22:52] [INFO ] Dead Transitions using invariants and state equation in 368 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 100000 steps, including 563 resets, run finished after 345 ms. (steps per millisecond=289 ) properties seen :[0]
[2021-05-13 18:22:52] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2021-05-13 18:22:52] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:22:52] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-13 18:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:52] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-13 18:22:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-13 18:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:53] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-13 18:22:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:22:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-13 18:22:53] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 22 ms.
[2021-05-13 18:22:54] [INFO ] Added : 124 causal constraints over 25 iterations in 1223 ms. Result :sat
[2021-05-13 18:22:54] [INFO ] Deduced a trap composed of 5 places in 100 ms
[2021-05-13 18:22:54] [INFO ] Deduced a trap composed of 5 places in 108 ms
[2021-05-13 18:22:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
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 64 transition count 130
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 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 38 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
// Phase 1: matrix 127 rows 61 cols
[2021-05-13 18:22:54] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:22:54] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-13 18:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:54] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-13 18:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-13 18:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:54] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-13 18:22:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 18:22:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:22:54] [INFO ] Computed and/alt/rep : 124/1245/124 causal constraints in 10 ms.
[2021-05-13 18:22:55] [INFO ] Added : 112 causal constraints over 24 iterations in 406 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-13 18:22:55] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2021-05-13 18:22:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
[2021-05-13 18:22:55] [INFO ] Flatten gal took : 99 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N10

{
"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": "Thu May 13 18:22:55 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 22888,
"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": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p24 + p25) OR (1 <= p0) OR (2 <= p0) OR (2 <= p23))))",
"processed_size": 69,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 3986,
"conflict_clusters": 3,
"places": 64,
"places_significant": 59,
"singleton_clusters": 0,
"transitions": 548
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"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: 612/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2048
lola: finding significant places
lola: 64 places, 548 transitions, 59 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: A (G (((1 <= p24 + p25) OR (1 <= p0) OR (2 <= p0) OR (2 <= p23))))
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 <= p24 + p25) OR (1 <= p0) OR (2 <= p0) OR (2 <= p23))))
lola: processed formula length: 69
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: 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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p24 + p25 <= 0) AND (p0 <= 0) AND (p0 <= 1) AND (p23 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 22888 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-V20P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BridgeAndVehicles-PT-V20P20N10, 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 r037-tajo-162038176900103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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