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

About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15728.450 3600000.00 311264.00 102.40 TTTFTFTFFTFFTFFF 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-158987913500174.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-V20P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913500174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 20:56 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 3.6K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:54 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 39K 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-V20P20N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591131687480

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:01:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 21:01:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:01:28] [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 21:01:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 502 ms
[2020-06-02 21:01:29] [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 21:01:29] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 24 ms.
[2020-06-02 21:01:29] [INFO ] Computed order based on color domains.
[2020-06-02 21:01:29] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions in 20 ms.
[2020-06-02 21:01:29] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0]
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-06-02 21:01:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-02 21:01:29] [INFO ] Computed 7 place invariants in 7 ms
[2020-06-02 21:01:29] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-02 21:01:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 21:01:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 21:01:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 21:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:01:29] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-02 21:01:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:01:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 21:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:01:29] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-02 21:01:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 21:01:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2020-06-02 21:01:30] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 35 ms.
[2020-06-02 21:01:31] [INFO ] Added : 118 causal constraints over 24 iterations in 1109 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-02 21:01:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 21:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:01:31] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-02 21:01:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:01:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 21:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:01:31] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-02 21:01:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2020-06-02 21:01:31] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-06-02 21:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2020-06-02 21:01:31] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 22 ms.
[2020-06-02 21:01:32] [INFO ] Added : 125 causal constraints over 25 iterations in 697 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-02 21:01:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 44400 steps, including 1097 resets, run finished after 142 ms. (steps per millisecond=312 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14900 steps, including 336 resets, run finished after 31 ms. (steps per millisecond=480 ) properties seen :[0, 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.
Applied a total of 0 rules in 41 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-06-02 21:01:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-02 21:01:32] [INFO ] Computed 7 place invariants in 2 ms
[2020-06-02 21:01:32] [INFO ] Dead Transitions using invariants and state equation in 242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2043 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1939 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 18318389 steps, run timeout after 30001 ms. (steps per millisecond=610 ) properties seen :[0, 0]
Probabilistic random walk after 18318389 steps, saw 4113583 distinct states, run finished after 30001 ms. (steps per millisecond=610 ) properties seen :[0, 0]
[2020-06-02 21:02:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-02 21:02:06] [INFO ] Computed 7 place invariants in 1 ms
[2020-06-02 21:02:06] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-02 21:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:06] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-02 21:02:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2020-06-02 21:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:06] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-06-02 21:02:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 21:02:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-06-02 21:02:06] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 22 ms.
[2020-06-02 21:02:07] [INFO ] Added : 118 causal constraints over 24 iterations in 1105 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-02 21:02:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 21:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:07] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-02 21:02:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 21:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:07] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-02 21:02:07] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2020-06-02 21:02:07] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-06-02 21:02:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2020-06-02 21:02:07] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 24 ms.
[2020-06-02 21:02:08] [INFO ] Added : 125 causal constraints over 25 iterations in 706 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 44400 steps, including 1096 resets, run finished after 105 ms. (steps per millisecond=422 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 14900 steps, including 345 resets, run finished after 27 ms. (steps per millisecond=551 ) properties seen :[0, 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.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-06-02 21:02:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-02 21:02:08] [INFO ] Computed 7 place invariants in 1 ms
[2020-06-02 21:02:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2020-06-02 21:02:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-02 21:02:08] [INFO ] Computed 7 place invariants in 2 ms
[2020-06-02 21:02:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 21:02:09] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [24, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 296 ms to find 2 implicit places.
[2020-06-02 21:02:09] [INFO ] Redundant transitions in 22 ms returned []
[2020-06-02 21:02:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:09] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 21:02:09] [INFO ] Dead Transitions using invariants and state equation in 353 ms returned []
Starting structural reductions, iteration 1 : 66/68 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-06-02 21:02:09] [INFO ] Redundant transitions in 3 ms returned []
[2020-06-02 21:02:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:09] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 21:02:09] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5632 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2044 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1937 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 20261038 steps, run timeout after 30001 ms. (steps per millisecond=675 ) properties seen :[0, 0]
Probabilistic random walk after 20261038 steps, saw 4539959 distinct states, run finished after 30001 ms. (steps per millisecond=675 ) properties seen :[0, 0]
[2020-06-02 21:02:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:42] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 21:02:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-02 21:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-02 21:02:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-02 21:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:42] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-02 21:02:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 21:02:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2020-06-02 21:02:42] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 21 ms.
[2020-06-02 21:02:43] [INFO ] Added : 117 causal constraints over 24 iterations in 693 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-02 21:02:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-02 21:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:43] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-02 21:02:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 21:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:43] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-02 21:02:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2020-06-02 21:02:43] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 14 ms.
[2020-06-02 21:02:44] [INFO ] Added : 123 causal constraints over 25 iterations in 634 ms. Result :sat
[2020-06-02 21:02:44] [INFO ] Deduced a trap composed of 5 places in 16 ms
[2020-06-02 21:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 38800 steps, including 1014 resets, run finished after 88 ms. (steps per millisecond=440 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 22200 steps, including 779 resets, run finished after 39 ms. (steps per millisecond=569 ) properties seen :[0, 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 13 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 12 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2020-06-02 21:02:44] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:44] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 21:02:44] [INFO ] Implicit Places using invariants in 167 ms returned []
[2020-06-02 21:02:44] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:44] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 21:02:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 21:02:45] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2020-06-02 21:02:45] [INFO ] Redundant transitions in 1 ms returned []
[2020-06-02 21:02:45] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:45] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 21:02:45] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 100000 steps, including 563 resets, run finished after 181 ms. (steps per millisecond=552 ) properties seen :[0, 0]
[2020-06-02 21:02:45] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2020-06-02 21:02:45] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-02 21:02:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 21:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:45] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-02 21:02:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 21:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-02 21:02:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 21:02:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-06-02 21:02:45] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 14 ms.
[2020-06-02 21:02:46] [INFO ] Added : 117 causal constraints over 24 iterations in 549 ms. Result :sat
[2020-06-02 21:02:46] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-02 21:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:46] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-06-02 21:02:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-02 21:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:46] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-06-02 21:02:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2020-06-02 21:02:46] [INFO ] Computed and/alt/rep : 545/6949/127 causal constraints in 28 ms.
[2020-06-02 21:02:47] [INFO ] Added : 123 causal constraints over 25 iterations in 909 ms. Result :sat
[2020-06-02 21:02:47] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-06-02 21:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 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 66 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 64 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 64 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 63 transition count 127
Applied a total of 424 rules in 10 ms. Remains 63 /66 variables (removed 3) and now considering 127/548 (removed 421) transitions.
// Phase 1: matrix 127 rows 63 cols
[2020-06-02 21:02:47] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-02 21:02:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-02 21:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:48] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2020-06-02 21:02:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 21:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:48] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-02 21:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-02 21:02:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-02 21:02:48] [INFO ] Computed and/alt/rep : 124/1245/124 causal constraints in 6 ms.
[2020-06-02 21:02:48] [INFO ] Added : 110 causal constraints over 22 iterations in 312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-02 21:02:48] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 21:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-02 21:02:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-02 21:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:48] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-02 21:02:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2020-06-02 21:02:48] [INFO ] Computed and/alt/rep : 124/1245/124 causal constraints in 9 ms.
[2020-06-02 21:02:49] [INFO ] Added : 107 causal constraints over 22 iterations in 303 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-02 21:02:49] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-02 21:02:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2020-06-02 21:02:49] [INFO ] Flatten gal took : 132 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V20P20N10 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3463
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-COL-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",
"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": "Tue Jun 2 21:02:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= p0)))",
"processed_size": 17,
"rewrites": 2
},
"result":
{
"edges": 13922873,
"markings": 6176970,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3502
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "E (F (((p0 <= 2) AND (p24 <= 0) AND ((2 <= p22) OR (p48 + 1 <= p47)))))",
"processed_size": 72,
"rewrites": 1
},
"result":
{
"edges": 8078447,
"markings": 3914033,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22984,
"runtime": 107.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 3988,
"conflict_clusters": 5,
"places": 66,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 548
},
"result":
{
"preliminary_value": "yes no ",
"value": "yes no "
},
"task":
{
"type": "compound"
}
}
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: 614/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2112
lola: finding significant places
lola: 66 places, 548 transitions, 61 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 <= p0))) : E (F (((p0 <= 2) AND (p24 <= 0) AND ((2 <= p22) OR (p48 + 1 <= p47)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p0)))
lola: ========================================
lola: SUBTASK
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 <= p0)))
lola: processed formula length: 17
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: 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: (p0 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 7)
lola: sara is running 0 secs || 443718 markings, 1004362 edges, 88744 markings/sec, 0 secs
lola: sara is running 5 secs || 914031 markings, 2068244 edges, 94063 markings/sec, 5 secs
lola: sara is running 10 secs || 1379140 markings, 3123771 edges, 93022 markings/sec, 10 secs
lola: sara is running 15 secs || 1849261 markings, 4195385 edges, 94024 markings/sec, 15 secs
lola: sara is running 20 secs || 2325036 markings, 5274019 edges, 95155 markings/sec, 20 secs
lola: sara is running 25 secs || 2802150 markings, 6353296 edges, 95423 markings/sec, 25 secs
lola: sara is running 30 secs || 3281234 markings, 7432503 edges, 95817 markings/sec, 30 secs
lola: sara is running 35 secs || 3761592 markings, 8513496 edges, 96072 markings/sec, 35 secs
lola: sara is running 40 secs || 4241447 markings, 9592981 edges, 95971 markings/sec, 40 secs
lola: sara is running 45 secs || 4723542 markings, 10673192 edges, 96419 markings/sec, 45 secs
lola: sara is running 50 secs || 5206415 markings, 11754346 edges, 96575 markings/sec, 50 secs
lola: sara is running 55 secs || 5690904 markings, 12837043 edges, 96898 markings/sec, 55 secs
lola: sara is running 60 secs || 6174943 markings, 13919201 edges, 96808 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6176970 markings, 13922873 edges
lola: subprocess 1 will run for 3502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 <= 2) AND (p24 <= 0) AND ((2 <= p22) OR (p48 + 1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p0 <= 2) AND (p24 <= 0) AND ((2 <= p22) OR (p48 + 1 <= p47)))))
lola: processed formula length: 72
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 2) AND (p24 <= 0) AND ((2 <= p22) OR (p48 + 1 <= p47)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 180)
lola: sara is running 0 secs || 480146 markings, 1002117 edges, 96029 markings/sec, 0 secs
lola: sara is running 5 secs || 983762 markings, 2062348 edges, 100723 markings/sec, 5 secs
lola: sara is running 10 secs || 1484747 markings, 3089011 edges, 100197 markings/sec, 10 secs
lola: sara is running 15 secs || 1987953 markings, 4108648 edges, 100641 markings/sec, 15 secs
lola: sara is running 20 secs || 2492954 markings, 5128903 edges, 101000 markings/sec, 20 secs
lola: sara is running 25 secs || 2993752 markings, 6137662 edges, 100160 markings/sec, 25 secs
lola: sara is running 30 secs || 3503020 markings, 7170068 edges, 101854 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3914033 markings, 8078447 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 22984 KB
lola: time consumption: 107 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-V20P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-COL-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 r182-oct2-158987913500174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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