About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V80P50N20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.580 | 3600000.00 | 281900.00 | 237.90 | FFTF?TTFTTTTTFFT | 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-158987913700279.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-COL-V80P50N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700279
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 22:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:27 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 4.0K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 25 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 25 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 45K 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-COL-V80P50N20-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591141615320
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:46:57] [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.
[2020-06-02 23:46:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 534 ms
[2020-06-02 23:46:58] [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,
[2020-06-02 23:46:58] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 33 ms.
[2020-06-02 23:46:58] [INFO ] Computed order based on color domains.
[2020-06-02 23:46:58] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions in 66 ms.
[2020-06-02 23:46:58] [INFO ] Unfolded HLPN properties in 3 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 291 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1002 ms. (steps per millisecond=9 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1]
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1258 ms. (steps per millisecond=7 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 194 ms. (steps per millisecond=51 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 396 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 1354 ms. (steps per millisecond=7 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 1178 ms. (steps per millisecond=8 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-02 23:47:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2020-06-02 23:47:04] [INFO ] Computed 7 place invariants in 21 ms
[2020-06-02 23:47:04] [INFO ] [Real]Absence check using 7 positive place invariants in 48 ms returned unsat
[2020-06-02 23:47:04] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 23:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:47:04] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-06-02 23:47:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:47:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2020-06-02 23:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:47:05] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2020-06-02 23:47:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:47:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 45 ms returned sat
[2020-06-02 23:47:05] [INFO ] Deduced a trap composed of 25 places in 352 ms
[2020-06-02 23:47:06] [INFO ] Deduced a trap composed of 24 places in 326 ms
[2020-06-02 23:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 767 ms
[2020-06-02 23:47:06] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 219 ms.
[2020-06-02 23:47:09] [INFO ] Added : 185 causal constraints over 37 iterations in 3773 ms. Result :unknown
[2020-06-02 23:47:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 23:47:10] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2020-06-02 23:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:47:11] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2020-06-02 23:47:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:47:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 104 ms returned sat
[2020-06-02 23:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:47:13] [INFO ] [Nat]Absence check using state equation in 1834 ms returned sat
[2020-06-02 23:47:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 70 ms returned sat
[2020-06-02 23:47:13] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 325 ms.
[2020-06-02 23:47:16] [INFO ] Added : 165 causal constraints over 33 iterations in 2932 ms. Result :unknown
[2020-06-02 23:47:16] [INFO ] [Real]Absence check using 7 positive place invariants in 25 ms returned unsat
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 218900 steps, including 1183 resets, run finished after 3185 ms. (steps per millisecond=68 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BridgeAndVehicles-COL-V80P50N20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 191500 steps, including 1048 resets, run finished after 1199 ms. (steps per millisecond=159 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 198/198 places, 3728/3728 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Applied a total of 1 rules in 696 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:47:21] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:47:21] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-02 23:47:23] [INFO ] Dead Transitions using invariants and state equation in 2623 ms returned []
Finished structural reductions, in 1 iterations. Remains : 196/198 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1454 resets, run finished after 7541 ms. (steps per millisecond=132 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 452 resets, run finished after 2656 ms. (steps per millisecond=376 ) properties seen :[0]
Interrupted probabilistic random walk after 3685637 steps, run timeout after 30001 ms. (steps per millisecond=122 ) properties seen :[0]
Probabilistic random walk after 3685637 steps, saw 962783 distinct states, run finished after 30001 ms. (steps per millisecond=122 ) properties seen :[0]
[2020-06-02 23:48:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:48:04] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-02 23:48:04] [INFO ] [Real]Absence check using 5 positive place invariants in 31 ms returned sat
[2020-06-02 23:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:48:04] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2020-06-02 23:48:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:48:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-06-02 23:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:48:06] [INFO ] [Nat]Absence check using state equation in 1253 ms returned sat
[2020-06-02 23:48:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:48:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 102 ms returned sat
[2020-06-02 23:48:06] [INFO ] Deduced a trap composed of 26 places in 445 ms
[2020-06-02 23:48:07] [INFO ] Deduced a trap composed of 25 places in 369 ms
[2020-06-02 23:48:07] [INFO ] Deduced a trap composed of 25 places in 475 ms
[2020-06-02 23:48:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1379 ms
[2020-06-02 23:48:07] [INFO ] Computed and/alt/rep : 3725/99059/407 causal constraints in 153 ms.
[2020-06-02 23:48:30] [INFO ] Added : 280 causal constraints over 56 iterations in 22993 ms. Result :unknown
Incomplete Parikh walk after 195300 steps, including 1171 resets, run finished after 2094 ms. (steps per millisecond=93 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 541 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 666 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:48:34] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:48:34] [INFO ] Computed 5 place invariants in 20 ms
[2020-06-02 23:48:34] [INFO ] Implicit Places using invariants in 670 ms returned []
[2020-06-02 23:48:34] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2020-06-02 23:48:34] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:48:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:48:36] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2367 ms to find 2 implicit places.
[2020-06-02 23:48:36] [INFO ] Redundant transitions in 192 ms returned []
[2020-06-02 23:48:36] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:48:36] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:48:41] [INFO ] Dead Transitions using invariants and state equation in 5027 ms returned []
Starting structural reductions, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 641 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:48:42] [INFO ] Redundant transitions in 230 ms returned []
[2020-06-02 23:48:42] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:48:42] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:48:45] [INFO ] Dead Transitions using invariants and state equation in 2527 ms returned []
Finished structural reductions, in 2 iterations. Remains : 194/196 places, 3728/3728 transitions.
Incomplete random walk after 1000000 steps, including 1455 resets, run finished after 7220 ms. (steps per millisecond=138 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 453 resets, run finished after 2567 ms. (steps per millisecond=389 ) properties seen :[0]
Interrupted probabilistic random walk after 3961528 steps, run timeout after 30001 ms. (steps per millisecond=132 ) properties seen :[0]
Probabilistic random walk after 3961528 steps, saw 1034263 distinct states, run finished after 30001 ms. (steps per millisecond=132 ) properties seen :[0]
[2020-06-02 23:49:24] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:49:24] [INFO ] Computed 5 place invariants in 4 ms
[2020-06-02 23:49:25] [INFO ] [Real]Absence check using 5 positive place invariants in 31 ms returned sat
[2020-06-02 23:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:25] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-06-02 23:49:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:49:25] [INFO ] [Real]Added 42 Read/Feed constraints in 53 ms returned sat
[2020-06-02 23:49:25] [INFO ] Computed and/alt/rep : 3725/86099/407 causal constraints in 127 ms.
[2020-06-02 23:49:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:49:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 33 ms returned sat
[2020-06-02 23:49:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:26] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2020-06-02 23:49:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 87 ms returned sat
[2020-06-02 23:49:26] [INFO ] Computed and/alt/rep : 3725/86099/407 causal constraints in 112 ms.
[2020-06-02 23:49:47] [INFO ] Added : 370 causal constraints over 74 iterations in 21226 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 342 ms.
Incomplete Parikh walk after 81800 steps, including 921 resets, run finished after 445 ms. (steps per millisecond=183 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 455 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 3728/3728 transitions.
Starting structural reductions, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 701 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2020-06-02 23:49:49] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:49:49] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:49:51] [INFO ] Implicit Places using invariants in 2110 ms returned []
[2020-06-02 23:49:51] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:49:51] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 23:49:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:49:54] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 4429 ms to find 0 implicit places.
[2020-06-02 23:49:54] [INFO ] Redundant transitions in 115 ms returned []
[2020-06-02 23:49:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:49:54] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 23:50:00] [INFO ] Dead Transitions using invariants and state equation in 6512 ms returned []
Finished structural reductions, in 1 iterations. Remains : 194/194 places, 3728/3728 transitions.
Incomplete random walk after 100000 steps, including 145 resets, run finished after 752 ms. (steps per millisecond=132 ) properties seen :[0]
[2020-06-02 23:50:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2020-06-02 23:50:01] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 23:50:01] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-02 23:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:01] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-06-02 23:50:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 23:50:01] [INFO ] [Real]Added 42 Read/Feed constraints in 29 ms returned sat
[2020-06-02 23:50:01] [INFO ] Computed and/alt/rep : 3725/86099/407 causal constraints in 86 ms.
[2020-06-02 23:50:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:50:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-02 23:50:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:02] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-02 23:50:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 51 ms returned sat
[2020-06-02 23:50:02] [INFO ] Computed and/alt/rep : 3725/86099/407 causal constraints in 132 ms.
[2020-06-02 23:50:13] [INFO ] Added : 360 causal constraints over 72 iterations in 10919 ms. Result :sat
[2020-06-02 23:50:13] [INFO ] Deduced a trap composed of 24 places in 518 ms
[2020-06-02 23:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 883 ms
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 194 transition count 410
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3320 place count 194 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3322 place count 192 transition count 408
Applied a total of 3322 rules in 33 ms. Remains 192 /194 variables (removed 2) and now considering 408/3728 (removed 3320) transitions.
// Phase 1: matrix 408 rows 192 cols
[2020-06-02 23:50:14] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:50:14] [INFO ] [Real]Absence check using 5 positive place invariants in 32 ms returned sat
[2020-06-02 23:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:14] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2020-06-02 23:50:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-02 23:50:14] [INFO ] [Real]Added 2 Read/Feed constraints in 19 ms returned sat
[2020-06-02 23:50:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:50:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 43 ms returned sat
[2020-06-02 23:50:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:15] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2020-06-02 23:50:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 26 ms returned sat
[2020-06-02 23:50:15] [INFO ] Computed and/alt/rep : 405/6735/405 causal constraints in 42 ms.
[2020-06-02 23:50:29] [INFO ] Added : 401 causal constraints over 81 iterations in 13489 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 125 ms.
[2020-06-02 23:50:29] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-02 23:50:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 77 ms.
[2020-06-02 23:50:30] [INFO ] Flatten gal took : 930 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-COL-V80P50N20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ BridgeAndVehicles-COL-V80P50N20
{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:50:32 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 141184,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 6,
"aneg": 0,
"comp": 10,
"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": 8,
"visible_transitions": 0
},
"processed": "A (G (((p165 <= 0) OR ((p83 <= 0) AND ((((p0 <= 49) OR (p193 <= 0)) AND ((p0 <= 49) OR (p192 <= 0))) OR (((p170 <= 0) OR (p191 <= 0)) AND ((p169 <= 0) OR (p191 <= 0))))))))",
"processed_size": 178,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 28506,
"conflict_clusters": 3,
"places": 194,
"places_significant": 189,
"singleton_clusters": 0,
"transitions": 3728
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 5
},
"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: 3922/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6208
lola: finding significant places
lola: 194 places, 3728 transitions, 189 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 ReachabilityFireability.xml
lola: A (G (((p165 <= 0) OR ((p83 <= 0) AND ((((p0 <= 49) OR (p193 <= 0)) AND ((p0 <= 49) OR (p192 <= 0))) OR (((p170 <= 0) OR (p191 <= 0)) AND ((p169 <= 0) OR (p191 <= 0))))))))
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 (((p165 <= 0) OR ((p83 <= 0) AND ((((p0 <= 49) OR (p193 <= 0)) AND ((p0 <= 49) OR (p192 <= 0))) OR (((p170 <= 0) OR (p191 <= 0)) AND ((p169 <= 0) OR (p191 <= 0))))))))
lola: processed formula length: 178
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p165) AND ((1 <= p83) OR ((((50 <= p0) AND (1 <= p193)) OR ((50 <= p0) AND (1 <= p192))) AND (((1 <= p170) AND (1 <= p191)) OR ((1 <= p169) AND (1 <= p191))))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 5 conjunctive subformulas
lola: memory consumption: 141184 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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-V80P50N20"
export BK_EXAMINATION="ReachabilityFireability"
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-COL-V80P50N20, examination is ReachabilityFireability"
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-158987913700279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N20.tgz
mv BridgeAndVehicles-COL-V80P50N20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;