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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 3.8K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 02:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 11:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 41K 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-COL-V20P20N50-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620925094584

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 16:58:16] [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 16:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:58:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-13 16:58:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2021-05-13 16:58:16] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2021-05-13 16:58:16] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 28 ms.
[2021-05-13 16:58:16] [INFO ] Computed order based on color domains.
[2021-05-13 16:58:16] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions in 28 ms.
[2021-05-13 16:58:16] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 75 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 57 resets, run finished after 159 ms. (steps per millisecond=62 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1]
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 36 ms. (steps per millisecond=277 ) 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 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 1, 0, 0]
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2021-05-13 16:58:17] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:58:17] [INFO ] Computed 7 place invariants in 13 ms
[2021-05-13 16:58:17] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
[2021-05-13 16:58:17] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 16:58:17] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 16:58:17] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 16:58:17] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 16:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:17] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-13 16:58:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:58:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2021-05-13 16:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:18] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-13 16:58:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:58:18] [INFO ] [Nat]Added 102 Read/Feed constraints in 65 ms returned sat
[2021-05-13 16:58:18] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 358 ms.
[2021-05-13 16:58:22] [INFO ] Added : 195 causal constraints over 39 iterations in 4624 ms. Result :unknown
[2021-05-13 16:58:22] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 16:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:23] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-13 16:58:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:58:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2021-05-13 16:58:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:23] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-13 16:58:23] [INFO ] [Nat]Added 102 Read/Feed constraints in 36 ms returned sat
[2021-05-13 16:58:23] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 121 ms.
[2021-05-13 16:58:28] [INFO ] Added : 215 causal constraints over 43 iterations in 4738 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 16:58:28] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 508000 steps, including 3754 resets, run finished after 4463 ms. (steps per millisecond=113 ) properties seen :[0, 0] could not realise parikh vector
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 332 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2021-05-13 16:58:33] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:58:33] [INFO ] Computed 7 place invariants in 12 ms
[2021-05-13 16:58:34] [INFO ] Dead Transitions using invariants and state equation in 1352 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 2228/2228 transitions.
Incomplete random walk after 1000000 steps, including 5779 resets, run finished after 7162 ms. (steps per millisecond=139 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2031 resets, run finished after 2405 ms. (steps per millisecond=415 ) properties seen :[1, 0]
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1790 resets, run finished after 2533 ms. (steps per millisecond=394 ) properties seen :[0]
[2021-05-13 16:58:46] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:58:46] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-13 16:58:46] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 16:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:46] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-13 16:58:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:58:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2021-05-13 16:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:46] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-13 16:58:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:58:47] [INFO ] [Nat]Added 102 Read/Feed constraints in 72 ms returned sat
[2021-05-13 16:58:47] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 122 ms.
[2021-05-13 16:58:54] [INFO ] Added : 215 causal constraints over 43 iterations in 7877 ms. Result :sat
[2021-05-13 16:58:55] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2021-05-13 16:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 896 ms
Attempting to minimize the solution found.
Minimization took 206 ms.
Incomplete Parikh walk after 329200 steps, including 2710 resets, run finished after 3235 ms. (steps per millisecond=101 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 311 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 2228/2228 transitions.
Incomplete random walk after 1000000 steps, including 5776 resets, run finished after 6846 ms. (steps per millisecond=146 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1788 resets, run finished after 3012 ms. (steps per millisecond=332 ) properties seen :[0]
Interrupted probabilistic random walk after 5117562 steps, run timeout after 30001 ms. (steps per millisecond=170 ) properties seen :[0]
Probabilistic random walk after 5117562 steps, saw 1182735 distinct states, run finished after 30013 ms. (steps per millisecond=170 ) properties seen :[0]
[2021-05-13 16:59:39] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:59:39] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-13 16:59:39] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 16:59:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:59:39] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-13 16:59:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:59:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 16:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:59:39] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-13 16:59:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:59:39] [INFO ] [Nat]Added 102 Read/Feed constraints in 43 ms returned sat
[2021-05-13 16:59:40] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 122 ms.
[2021-05-13 16:59:47] [INFO ] Added : 215 causal constraints over 43 iterations in 7069 ms. Result :sat
[2021-05-13 16:59:47] [INFO ] Deduced a trap composed of 5 places in 625 ms
[2021-05-13 16:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1040 ms
Attempting to minimize the solution found.
Minimization took 227 ms.
Incomplete Parikh walk after 334000 steps, including 2733 resets, run finished after 2761 ms. (steps per millisecond=120 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 303 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 2228/2228 transitions.
Starting structural reductions, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 263 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2021-05-13 16:59:51] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:59:51] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-13 16:59:52] [INFO ] Implicit Places using invariants in 396 ms returned []
[2021-05-13 16:59:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 16:59:52] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 16:59:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 16:59:52] [INFO ] Implicit Places using invariants and state equation in 891 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1303 ms to find 1 implicit places.
[2021-05-13 16:59:53] [INFO ] Redundant transitions in 151 ms returned []
[2021-05-13 16:59:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 16:59:53] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 16:59:54] [INFO ] Dead Transitions using invariants and state equation in 1370 ms returned []
Starting structural reductions, iteration 1 : 107/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 185 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2021-05-13 16:59:54] [INFO ] Redundant transitions in 139 ms returned []
[2021-05-13 16:59:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 16:59:54] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 16:59:56] [INFO ] Dead Transitions using invariants and state equation in 1277 ms returned []
Finished structural reductions, in 2 iterations. Remains : 107/108 places, 2228/2228 transitions.
Incomplete random walk after 1000000 steps, including 5779 resets, run finished after 5805 ms. (steps per millisecond=172 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1792 resets, run finished after 2591 ms. (steps per millisecond=385 ) properties seen :[0]
Interrupted probabilistic random walk after 5635610 steps, run timeout after 30001 ms. (steps per millisecond=187 ) properties seen :[0]
Probabilistic random walk after 5635610 steps, saw 1297690 distinct states, run finished after 30002 ms. (steps per millisecond=187 ) properties seen :[0]
[2021-05-13 17:00:34] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 17:00:34] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 17:00:34] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2021-05-13 17:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:00:34] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-13 17:00:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:00:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-13 17:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:00:34] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-13 17:00:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 17:00:34] [INFO ] [Nat]Added 102 Read/Feed constraints in 49 ms returned sat
[2021-05-13 17:00:35] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2021-05-13 17:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2021-05-13 17:00:35] [INFO ] Computed and/alt/rep : 2225/113969/287 causal constraints in 82 ms.
[2021-05-13 17:00:45] [INFO ] Added : 234 causal constraints over 48 iterations in 10234 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 235 ms.
Incomplete Parikh walk after 411000 steps, including 3284 resets, run finished after 3300 ms. (steps per millisecond=124 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 107/107 places, 2228/2228 transitions.
Applied a total of 0 rules in 147 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 2228/2228 transitions.
Starting structural reductions, iteration 0 : 107/107 places, 2228/2228 transitions.
Applied a total of 0 rules in 161 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2021-05-13 17:00:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 17:00:49] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 17:00:49] [INFO ] Implicit Places using invariants in 397 ms returned []
[2021-05-13 17:00:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 17:00:49] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 17:00:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 17:00:50] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2021-05-13 17:00:50] [INFO ] Redundant transitions in 95 ms returned []
[2021-05-13 17:00:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 17:00:51] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 17:00:52] [INFO ] Dead Transitions using invariants and state equation in 1254 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 2228/2228 transitions.
Incomplete random walk after 100000 steps, including 577 resets, run finished after 567 ms. (steps per millisecond=176 ) properties seen :[0]
[2021-05-13 17:00:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2021-05-13 17:00:52] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 17:00:52] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-13 17:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:00:53] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-13 17:00:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:00:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 55 ms returned sat
[2021-05-13 17:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:00:53] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-13 17:00:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 17:00:53] [INFO ] [Nat]Added 102 Read/Feed constraints in 64 ms returned sat
[2021-05-13 17:00:53] [INFO ] Deduced a trap composed of 5 places in 343 ms
[2021-05-13 17:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2021-05-13 17:00:53] [INFO ] Computed and/alt/rep : 2225/113969/287 causal constraints in 106 ms.
[2021-05-13 17:01:06] [INFO ] Added : 234 causal constraints over 48 iterations in 12155 ms. Result :sat
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 107 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 105 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 105 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 104 transition count 287
Applied a total of 1944 rules in 46 ms. Remains 104 /107 variables (removed 3) and now considering 287/2228 (removed 1941) transitions.
// Phase 1: matrix 287 rows 104 cols
[2021-05-13 17:01:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 17:01:06] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 17:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:06] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-13 17:01:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:01:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-13 17:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:01:06] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2021-05-13 17:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 17:01:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2021-05-13 17:01:06] [INFO ] Computed and/alt/rep : 284/11785/284 causal constraints in 26 ms.
[2021-05-13 17:01:09] [INFO ] Added : 154 causal constraints over 32 iterations in 2630 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2021-05-13 17:01:09] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2021-05-13 17:01:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 49 ms.
[2021-05-13 17:01:09] [INFO ] Flatten gal took : 265 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V20P20N50 @ 3570 seconds
vrfy: finished
info: timeLeft: 3557
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-COL-V20P20N50

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 17:01:10 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 72540,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((3 <= p24) OR (p49 <= p0) OR (p23 <= p49) OR (((2 <= p0) OR (p22 <= p49)) AND ((2 <= p22) OR (2 <= p47))))))",
"processed_size": 120,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 17149,
"conflict_clusters": 5,
"places": 107,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2335/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3424
lola: finding significant places
lola: 107 places, 2228 transitions, 101 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 (((3 <= p24) OR (p49 <= p0) OR (p23 <= p49) OR (((2 <= p0) OR (p22 <= p49)) AND ((2 <= p22) OR (2 <= p47))))))
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 (((3 <= p24) OR (p49 <= p0) OR (p23 <= p49) OR (((2 <= p0) OR (p22 <= p49)) AND ((2 <= p22) OR (2 <= p47))))))
lola: processed formula length: 120
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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p24 <= 2) AND (p0 + 1 <= p49) AND (p49 + 1 <= p23) AND (((p0 <= 1) AND (p49 + 1 <= p22)) OR ((p22 <= 1) AND (p47 <= 1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 72540 KB
lola: time consumption: 13 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-COL-V20P20N50"
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-COL-V20P20N50, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038176700031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;