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.r184-oct2-158987928800614.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 LamportFastMutEx-COL-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 41K Apr 30 13:04 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 LamportFastMutEx-COL-5-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591215756016

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:22:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:22:40] [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-03 20:22:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2020-06-03 20:22:41] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2020-06-03 20:22:41] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 59 ms.
[2020-06-03 20:22:41] [INFO ] Computed order based on color domains.
[2020-06-03 20:22:41] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 39 ms.
[2020-06-03 20:22:41] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0]
[2020-06-03 20:22:41] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 20:22:41] [INFO ] Computed 37 place invariants in 6 ms
[2020-06-03 20:22:41] [INFO ] [Real]Absence check using 37 positive place invariants in 59 ms returned sat
[2020-06-03 20:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:22:41] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 20:22:41] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-06-03 20:22:41] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:22:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:22:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2020-06-03 20:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:22:41] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-06-03 20:22:41] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2020-06-03 20:22:41] [INFO ] Deduced a trap composed of 30 places in 104 ms
[2020-06-03 20:22:42] [INFO ] Deduced a trap composed of 29 places in 72 ms
[2020-06-03 20:22:42] [INFO ] Deduced a trap composed of 48 places in 113 ms
[2020-06-03 20:22:42] [INFO ] Deduced a trap composed of 37 places in 85 ms
[2020-06-03 20:22:42] [INFO ] Deduced a trap composed of 38 places in 55 ms
[2020-06-03 20:22:42] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2020-06-03 20:22:42] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-06-03 20:22:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 665 ms
[2020-06-03 20:22:42] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 17 ms.
[2020-06-03 20:22:43] [INFO ] Added : 165 causal constraints over 34 iterations in 651 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 20:22:43] [INFO ] [Real]Absence check using 37 positive place invariants in 166 ms returned sat
[2020-06-03 20:22:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:22:43] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-03 20:22:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:22:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2020-06-03 20:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:22:43] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-06-03 20:22:43] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-06-03 20:22:43] [INFO ] Deduced a trap composed of 18 places in 39 ms
[2020-06-03 20:22:43] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-06-03 20:22:43] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2020-06-03 20:22:43] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-06-03 20:22:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 169 ms
[2020-06-03 20:22:43] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 10 ms.
[2020-06-03 20:22:44] [INFO ] Added : 151 causal constraints over 31 iterations in 539 ms. Result :sat
[2020-06-03 20:22:44] [INFO ] Deduced a trap composed of 14 places in 28 ms
[2020-06-03 20:22:44] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-06-03 20:22:44] [INFO ] Deduced a trap composed of 14 places in 40 ms
[2020-06-03 20:22:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 33700 steps, including 959 resets, run finished after 111 ms. (steps per millisecond=303 ) properties seen :[0, 1] could not realise parikh vector
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 47700 steps, including 997 resets, run finished after 81 ms. (steps per millisecond=588 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 85 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1415 ms. (steps per millisecond=706 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties seen :[0]
Interrupted probabilistic random walk after 21016419 steps, run timeout after 30001 ms. (steps per millisecond=700 ) properties seen :[0]
Probabilistic random walk after 21016419 steps, saw 3701776 distinct states, run finished after 30004 ms. (steps per millisecond=700 ) properties seen :[0]
[2020-06-03 20:23:16] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2020-06-03 20:23:16] [INFO ] Computed 37 place invariants in 2 ms
[2020-06-03 20:23:17] [INFO ] [Real]Absence check using 37 positive place invariants in 26 ms returned sat
[2020-06-03 20:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:17] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2020-06-03 20:23:17] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-06-03 20:23:17] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-06-03 20:23:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:23:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 48 ms returned sat
[2020-06-03 20:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:17] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2020-06-03 20:23:17] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-06-03 20:23:17] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-06-03 20:23:17] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2020-06-03 20:23:17] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2020-06-03 20:23:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2020-06-03 20:23:17] [INFO ] Computed and/alt/rep : 245/1685/185 causal constraints in 14 ms.
[2020-06-03 20:23:17] [INFO ] Added : 118 causal constraints over 24 iterations in 392 ms. Result :sat
[2020-06-03 20:23:17] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2020-06-03 20:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 24200 steps, including 903 resets, run finished after 68 ms. (steps per millisecond=355 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-06-03 20:23:18] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2020-06-03 20:23:18] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 20:23:18] [INFO ] Implicit Places using invariants in 101 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
[2020-06-03 20:23:18] [INFO ] Redundant transitions in 7 ms returned []
[2020-06-03 20:23:18] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:18] [INFO ] Computed 32 place invariants in 1 ms
[2020-06-03 20:23:18] [INFO ] Dead Transitions using invariants and state equation in 195 ms returned []
Starting structural reductions, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-06-03 20:23:18] [INFO ] Redundant transitions in 1 ms returned []
[2020-06-03 20:23:18] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:18] [INFO ] Computed 32 place invariants in 1 ms
[2020-06-03 20:23:18] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1255 ms. (steps per millisecond=796 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties seen :[0]
Interrupted probabilistic random walk after 21460684 steps, run timeout after 30001 ms. (steps per millisecond=715 ) properties seen :[0]
Probabilistic random walk after 21460684 steps, saw 3777120 distinct states, run finished after 30001 ms. (steps per millisecond=715 ) properties seen :[0]
[2020-06-03 20:23:50] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:50] [INFO ] Computed 32 place invariants in 2 ms
[2020-06-03 20:23:50] [INFO ] [Real]Absence check using 32 positive place invariants in 20 ms returned sat
[2020-06-03 20:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:50] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-03 20:23:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-06-03 20:23:50] [INFO ] [Real]Added 40 Read/Feed constraints in 12 ms returned sat
[2020-06-03 20:23:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:23:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-06-03 20:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:50] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2020-06-03 20:23:50] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2020-06-03 20:23:50] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2020-06-03 20:23:50] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-06-03 20:23:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2020-06-03 20:23:50] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 22 ms.
[2020-06-03 20:23:51] [INFO ] Added : 157 causal constraints over 32 iterations in 541 ms. Result :sat
[2020-06-03 20:23:51] [INFO ] Deduced a trap composed of 7 places in 21 ms
[2020-06-03 20:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 36900 steps, including 980 resets, run finished after 56 ms. (steps per millisecond=658 ) properties seen :[0] could not realise parikh vector
Support contains 15 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2020-06-03 20:23:51] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:51] [INFO ] Computed 32 place invariants in 1 ms
[2020-06-03 20:23:52] [INFO ] Implicit Places using invariants in 491 ms returned []
[2020-06-03 20:23:52] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:52] [INFO ] Computed 32 place invariants in 1 ms
[2020-06-03 20:23:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-06-03 20:23:52] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2020-06-03 20:23:52] [INFO ] Redundant transitions in 3 ms returned []
[2020-06-03 20:23:52] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:52] [INFO ] Computed 32 place invariants in 2 ms
[2020-06-03 20:23:52] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 110 ms. (steps per millisecond=909 ) properties seen :[0]
[2020-06-03 20:23:52] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2020-06-03 20:23:52] [INFO ] Computed 32 place invariants in 0 ms
[2020-06-03 20:23:52] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 20:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:52] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-03 20:23:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2020-06-03 20:23:52] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:23:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:23:52] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-06-03 20:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:52] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-06-03 20:23:52] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2020-06-03 20:23:53] [INFO ] Deduced a trap composed of 7 places in 91 ms
[2020-06-03 20:23:53] [INFO ] Deduced a trap composed of 29 places in 36 ms
[2020-06-03 20:23:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2020-06-03 20:23:53] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 10 ms.
[2020-06-03 20:23:53] [INFO ] Added : 157 causal constraints over 32 iterations in 628 ms. Result :sat
[2020-06-03 20:23:53] [INFO ] Deduced a trap composed of 7 places in 17 ms
[2020-06-03 20:23:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 122 transition count 190
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 60 place count 122 transition count 165
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 130 place count 77 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 72 transition count 160
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 72 transition count 160
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 10 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 155 place count 67 transition count 150
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 67 transition count 150
Applied a total of 160 rules in 9 ms. Remains 67 /122 variables (removed 55) and now considering 150/250 (removed 100) transitions.
// Phase 1: matrix 150 rows 67 cols
[2020-06-03 20:23:53] [INFO ] Computed 12 place invariants in 1 ms
[2020-06-03 20:23:53] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-06-03 20:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 20:23:53] [INFO ] Computed and/alt/rep : 140/730/140 causal constraints in 5 ms.
[2020-06-03 20:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:23:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-03 20:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:23:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 20:23:53] [INFO ] Computed and/alt/rep : 140/730/140 causal constraints in 8 ms.
[2020-06-03 20:23:54] [INFO ] Added : 107 causal constraints over 22 iterations in 296 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-03 20:23:54] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-03 20:23:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2020-06-03 20:23:54] [INFO ] Flatten gal took : 89 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-5 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-COL-5

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:23:54 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 17860,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p112 + p113 + p114 + p115 + p116) AND (p52 + p53 + p54 + p55 + p56 <= p37 + p38 + p39 + p40 + p41))))",
"processed_size": 114,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1160,
"conflict_clusters": 7,
"places": 122,
"places_significant": 90,
"singleton_clusters": 0,
"transitions": 250
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"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: 372/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 122
lola: finding significant places
lola: 122 places, 250 transitions, 90 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: E (F (((3 <= p112 + p113 + p114 + p115 + p116) AND (p52 + p53 + p54 + p55 + p56 <= p37 + p38 + p39 + p40 + p41))))
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 (((3 <= p112 + p113 + p114 + p115 + p116) AND (p52 + p53 + p54 + p55 + p56 <= p37 + p38 + p39 + p40 + p41))))
lola: processed formula length: 114
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: 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:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p112 + p113 + p114 + p115 + p116) AND (p52 + p53 + p54 + p55 + p56 <= p37 + p38 + p39 + p40 + p41))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 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.
lola: memory consumption: 17860 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-5"
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 LamportFastMutEx-COL-5, 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 r184-oct2-158987928800614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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