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

About the Execution of ITS-LoLa for LamportFastMutEx-COL-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15784.740 3600000.00 7036328.00 13157.90 FFFTFT?TTFFTFF?T 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.r184-oct2-158987928800630.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-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800630
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.2K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.6K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 3.1K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 43K 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-7-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591216861399

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:41:05] [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:41:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:41:05] [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:41:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 919 ms
[2020-06-03 20:41:06] [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:41:06] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 118 ms.
[2020-06-03 20:41:06] [INFO ] Computed order based on color domains.
[2020-06-03 20:41:06] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions in 82 ms.
[2020-06-03 20:41:06] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 193 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 182 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0]
[2020-06-03 20:41:07] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2020-06-03 20:41:07] [INFO ] Computed 65 place invariants in 21 ms
[2020-06-03 20:41:07] [INFO ] [Real]Absence check using 65 positive place invariants in 111 ms returned unsat
[2020-06-03 20:41:07] [INFO ] [Real]Absence check using 65 positive place invariants in 34 ms returned sat
[2020-06-03 20:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:08] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2020-06-03 20:41:08] [INFO ] State equation strengthened by 105 read => feed constraints.
[2020-06-03 20:41:08] [INFO ] [Real]Added 105 Read/Feed constraints in 31 ms returned sat
[2020-06-03 20:41:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 466 ms returned sat
[2020-06-03 20:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:10] [INFO ] [Nat]Absence check using state equation in 1303 ms returned sat
[2020-06-03 20:41:10] [INFO ] [Nat]Added 105 Read/Feed constraints in 47 ms returned sat
[2020-06-03 20:41:11] [INFO ] Deduced a trap composed of 9 places in 832 ms
[2020-06-03 20:41:11] [INFO ] Deduced a trap composed of 22 places in 203 ms
[2020-06-03 20:41:11] [INFO ] Deduced a trap composed of 23 places in 188 ms
[2020-06-03 20:41:11] [INFO ] Deduced a trap composed of 9 places in 344 ms
[2020-06-03 20:41:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1705 ms
[2020-06-03 20:41:12] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 24 ms.
[2020-06-03 20:41:13] [INFO ] Added : 165 causal constraints over 33 iterations in 1430 ms. Result :(error "Failed to check-sat")
[2020-06-03 20:41:13] [INFO ] [Real]Absence check using 65 positive place invariants in 96 ms returned sat
[2020-06-03 20:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:14] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2020-06-03 20:41:14] [INFO ] [Real]Added 105 Read/Feed constraints in 15 ms returned sat
[2020-06-03 20:41:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 109 ms returned sat
[2020-06-03 20:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:15] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2020-06-03 20:41:15] [INFO ] [Nat]Added 105 Read/Feed constraints in 16 ms returned sat
[2020-06-03 20:41:15] [INFO ] Deduced a trap composed of 8 places in 220 ms
[2020-06-03 20:41:18] [INFO ] Deduced a trap composed of 43 places in 2588 ms
[2020-06-03 20:41:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2857 ms
[2020-06-03 20:41:18] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 48 ms.
[2020-06-03 20:41:19] [INFO ] Added : 105 causal constraints over 21 iterations in 1210 ms. Result :(error "Failed to check-sat")
FORMULA LamportFastMutEx-COL-7-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 97 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/219 places, 455/462 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2211 ms. (steps per millisecond=452 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 16577340 steps, run timeout after 30001 ms. (steps per millisecond=552 ) properties seen :[0, 0]
Probabilistic random walk after 16577340 steps, saw 2520529 distinct states, run finished after 30008 ms. (steps per millisecond=552 ) properties seen :[0, 0]
[2020-06-03 20:41:53] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2020-06-03 20:41:53] [INFO ] Computed 65 place invariants in 2 ms
[2020-06-03 20:41:53] [INFO ] [Real]Absence check using 65 positive place invariants in 157 ms returned sat
[2020-06-03 20:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:54] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-06-03 20:41:54] [INFO ] State equation strengthened by 105 read => feed constraints.
[2020-06-03 20:41:54] [INFO ] [Real]Added 105 Read/Feed constraints in 49 ms returned sat
[2020-06-03 20:41:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 163 ms returned sat
[2020-06-03 20:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:55] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2020-06-03 20:41:55] [INFO ] [Nat]Added 105 Read/Feed constraints in 58 ms returned sat
[2020-06-03 20:41:56] [INFO ] Deduced a trap composed of 8 places in 809 ms
[2020-06-03 20:41:58] [INFO ] Deduced a trap composed of 30 places in 2882 ms
[2020-06-03 20:41:59] [INFO ] Deduced a trap composed of 8 places in 600 ms
[2020-06-03 20:41:59] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-06-03 20:41:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4471 ms
[2020-06-03 20:41:59] [INFO ] Computed and/alt/rep : 448/3738/322 causal constraints in 73 ms.
[2020-06-03 20:42:01] [INFO ] Added : 192 causal constraints over 39 iterations in 1706 ms. Result :sat
[2020-06-03 20:42:01] [INFO ] Deduced a trap composed of 33 places in 114 ms
[2020-06-03 20:42:01] [INFO ] Deduced a trap composed of 27 places in 263 ms
[2020-06-03 20:42:01] [INFO ] Deduced a trap composed of 13 places in 30 ms
[2020-06-03 20:42:02] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2020-06-03 20:42:02] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2020-06-03 20:42:02] [INFO ] Deduced a trap composed of 7 places in 98 ms
[2020-06-03 20:42:02] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-03 20:42:03] [INFO ] Deduced a trap composed of 7 places in 611 ms
[2020-06-03 20:42:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1983 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 20:42:03] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2020-06-03 20:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:03] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-03 20:42:03] [INFO ] [Real]Added 105 Read/Feed constraints in 18 ms returned sat
[2020-06-03 20:42:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:42:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2020-06-03 20:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:04] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2020-06-03 20:42:04] [INFO ] [Nat]Added 105 Read/Feed constraints in 37 ms returned sat
[2020-06-03 20:42:04] [INFO ] Deduced a trap composed of 7 places in 21 ms
[2020-06-03 20:42:04] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-06-03 20:42:06] [INFO ] Deduced a trap composed of 30 places in 1223 ms
[2020-06-03 20:42:06] [INFO ] Deduced a trap composed of 19 places in 237 ms
[2020-06-03 20:42:06] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-06-03 20:42:06] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-06-03 20:42:07] [INFO ] Deduced a trap composed of 20 places in 707 ms
[2020-06-03 20:42:09] [INFO ] Deduced a trap composed of 8 places in 1739 ms
[2020-06-03 20:42:10] [INFO ] Deduced a trap composed of 19 places in 1314 ms
[2020-06-03 20:42:10] [INFO ] Deduced a trap composed of 28 places in 110 ms
[2020-06-03 20:42:11] [INFO ] Deduced a trap composed of 26 places in 749 ms
[2020-06-03 20:42:11] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-06-03 20:42:12] [INFO ] Deduced a trap composed of 15 places in 920 ms
[2020-06-03 20:42:12] [INFO ] Deduced a trap composed of 24 places in 118 ms
[2020-06-03 20:42:13] [INFO ] Deduced a trap composed of 13 places in 916 ms
[2020-06-03 20:42:13] [INFO ] Deduced a trap composed of 19 places in 62 ms
[2020-06-03 20:42:13] [INFO ] Deduced a trap composed of 13 places in 59 ms
[2020-06-03 20:42:13] [INFO ] Deduced a trap composed of 16 places in 59 ms
[2020-06-03 20:42:13] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 9049 ms
[2020-06-03 20:42:13] [INFO ] Computed and/alt/rep : 448/3738/322 causal constraints in 23 ms.
[2020-06-03 20:42:15] [INFO ] Added : 183 causal constraints over 37 iterations in 1283 ms. Result :sat
[2020-06-03 20:42:15] [INFO ] Deduced a trap composed of 23 places in 106 ms
[2020-06-03 20:42:15] [INFO ] Deduced a trap composed of 9 places in 21 ms
[2020-06-03 20:42:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 33200 steps, including 878 resets, run finished after 197 ms. (steps per millisecond=168 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 22500 steps, including 675 resets, run finished after 86 ms. (steps per millisecond=261 ) properties seen :[0, 0] could not realise parikh vector
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 35 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/212 places, 455/455 transitions.
Starting structural reductions, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 23 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2020-06-03 20:42:15] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2020-06-03 20:42:15] [INFO ] Computed 65 place invariants in 2 ms
[2020-06-03 20:42:16] [INFO ] Implicit Places using invariants in 308 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 310 ms to find 7 implicit places.
[2020-06-03 20:42:16] [INFO ] Redundant transitions in 19 ms returned []
[2020-06-03 20:42:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:42:16] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 20:42:16] [INFO ] Dead Transitions using invariants and state equation in 331 ms returned []
Starting structural reductions, iteration 1 : 205/212 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2020-06-03 20:42:16] [INFO ] Redundant transitions in 5 ms returned []
[2020-06-03 20:42:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:42:16] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 20:42:16] [INFO ] Dead Transitions using invariants and state equation in 332 ms returned []
Finished structural reductions, in 2 iterations. Remains : 205/212 places, 455/455 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2328 ms. (steps per millisecond=429 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 17252907 steps, run timeout after 30001 ms. (steps per millisecond=575 ) properties seen :[0, 0]
Probabilistic random walk after 17252907 steps, saw 2620416 distinct states, run finished after 30024 ms. (steps per millisecond=574 ) properties seen :[0, 0]
[2020-06-03 20:42:50] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:42:50] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 20:42:51] [INFO ] [Real]Absence check using 58 positive place invariants in 179 ms returned sat
[2020-06-03 20:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:51] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-06-03 20:42:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-03 20:42:51] [INFO ] [Real]Added 56 Read/Feed constraints in 33 ms returned sat
[2020-06-03 20:42:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:42:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 217 ms returned sat
[2020-06-03 20:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:52] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2020-06-03 20:42:52] [INFO ] [Nat]Added 56 Read/Feed constraints in 17 ms returned sat
[2020-06-03 20:42:53] [INFO ] Deduced a trap composed of 9 places in 510 ms
[2020-06-03 20:42:53] [INFO ] Deduced a trap composed of 8 places in 265 ms
[2020-06-03 20:42:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 811 ms
[2020-06-03 20:42:53] [INFO ] Computed and/alt/rep : 448/3626/322 causal constraints in 43 ms.
[2020-06-03 20:42:55] [INFO ] Added : 193 causal constraints over 39 iterations in 2237 ms. Result :sat
[2020-06-03 20:42:55] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2020-06-03 20:42:55] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2020-06-03 20:42:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 20:42:56] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2020-06-03 20:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:56] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-03 20:42:56] [INFO ] [Real]Added 56 Read/Feed constraints in 25 ms returned sat
[2020-06-03 20:42:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:42:56] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2020-06-03 20:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:42:56] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2020-06-03 20:42:56] [INFO ] [Nat]Added 56 Read/Feed constraints in 35 ms returned sat
[2020-06-03 20:42:57] [INFO ] Deduced a trap composed of 19 places in 483 ms
[2020-06-03 20:42:57] [INFO ] Deduced a trap composed of 8 places in 16 ms
[2020-06-03 20:42:57] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2020-06-03 20:42:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 568 ms
[2020-06-03 20:42:57] [INFO ] Computed and/alt/rep : 448/3626/322 causal constraints in 17 ms.
[2020-06-03 20:42:57] [INFO ] Added : 108 causal constraints over 22 iterations in 709 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 26200 steps, including 958 resets, run finished after 60 ms. (steps per millisecond=436 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 54700 steps, including 1000 resets, run finished after 106 ms. (steps per millisecond=516 ) properties seen :[0, 0] could not realise parikh vector
Support contains 28 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2020-06-03 20:42:58] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:42:58] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 20:42:58] [INFO ] Implicit Places using invariants in 400 ms returned []
[2020-06-03 20:42:58] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:42:58] [INFO ] Computed 58 place invariants in 2 ms
[2020-06-03 20:42:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-03 20:42:59] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2020-06-03 20:43:00] [INFO ] Redundant transitions in 5 ms returned []
[2020-06-03 20:43:00] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:43:00] [INFO ] Computed 58 place invariants in 1 ms
[2020-06-03 20:43:00] [INFO ] Dead Transitions using invariants and state equation in 564 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 455/455 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 238 ms. (steps per millisecond=420 ) properties seen :[0, 0]
[2020-06-03 20:43:00] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2020-06-03 20:43:00] [INFO ] Computed 58 place invariants in 2 ms
[2020-06-03 20:43:01] [INFO ] [Real]Absence check using 58 positive place invariants in 189 ms returned sat
[2020-06-03 20:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:01] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2020-06-03 20:43:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-03 20:43:01] [INFO ] [Real]Added 56 Read/Feed constraints in 23 ms returned sat
[2020-06-03 20:43:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:02] [INFO ] [Nat]Absence check using 58 positive place invariants in 188 ms returned sat
[2020-06-03 20:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:02] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2020-06-03 20:43:02] [INFO ] [Nat]Added 56 Read/Feed constraints in 40 ms returned sat
[2020-06-03 20:43:03] [INFO ] Deduced a trap composed of 9 places in 792 ms
[2020-06-03 20:43:04] [INFO ] Deduced a trap composed of 8 places in 378 ms
[2020-06-03 20:43:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1228 ms
[2020-06-03 20:43:04] [INFO ] Computed and/alt/rep : 448/3626/322 causal constraints in 60 ms.
[2020-06-03 20:43:06] [INFO ] Added : 193 causal constraints over 39 iterations in 2668 ms. Result :sat
[2020-06-03 20:43:07] [INFO ] Deduced a trap composed of 8 places in 705 ms
[2020-06-03 20:43:08] [INFO ] Deduced a trap composed of 8 places in 370 ms
[2020-06-03 20:43:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1258 ms
[2020-06-03 20:43:08] [INFO ] [Real]Absence check using 58 positive place invariants in 143 ms returned sat
[2020-06-03 20:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:09] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2020-06-03 20:43:09] [INFO ] [Real]Added 56 Read/Feed constraints in 48 ms returned sat
[2020-06-03 20:43:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:09] [INFO ] [Nat]Absence check using 58 positive place invariants in 276 ms returned sat
[2020-06-03 20:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:10] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2020-06-03 20:43:10] [INFO ] [Nat]Added 56 Read/Feed constraints in 32 ms returned sat
[2020-06-03 20:43:12] [INFO ] Deduced a trap composed of 19 places in 2136 ms
[2020-06-03 20:43:13] [INFO ] Deduced a trap composed of 8 places in 741 ms
[2020-06-03 20:43:13] [INFO ] Deduced a trap composed of 8 places in 284 ms
[2020-06-03 20:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3231 ms
[2020-06-03 20:43:13] [INFO ] Computed and/alt/rep : 448/3626/322 causal constraints in 22 ms.
[2020-06-03 20:43:14] [INFO ] Added : 108 causal constraints over 22 iterations in 1307 ms. Result :sat
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 294 place count 107 transition count 259
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 308 place count 93 transition count 259
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 259
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 252
Applied a total of 322 rules in 62 ms. Remains 93 /205 variables (removed 112) and now considering 252/455 (removed 203) transitions.
// Phase 1: matrix 252 rows 93 cols
[2020-06-03 20:43:14] [INFO ] Computed 16 place invariants in 1 ms
[2020-06-03 20:43:15] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2020-06-03 20:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:15] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2020-06-03 20:43:15] [INFO ] Computed and/alt/rep : 238/1897/238 causal constraints in 23 ms.
[2020-06-03 20:43:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 30 ms returned sat
[2020-06-03 20:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:16] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2020-06-03 20:43:16] [INFO ] Computed and/alt/rep : 238/1897/238 causal constraints in 31 ms.
[2020-06-03 20:43:17] [INFO ] Added : 171 causal constraints over 35 iterations in 1660 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 20:43:17] [INFO ] [Real]Absence check using 16 positive place invariants in 65 ms returned sat
[2020-06-03 20:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:18] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2020-06-03 20:43:18] [INFO ] Computed and/alt/rep : 238/1897/238 causal constraints in 16 ms.
[2020-06-03 20:43:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:43:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2020-06-03 20:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:43:18] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-06-03 20:43:18] [INFO ] Computed and/alt/rep : 238/1897/238 causal constraints in 16 ms.
[2020-06-03 20:43:19] [INFO ] Added : 179 causal constraints over 36 iterations in 825 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 20:43:19] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 20:43:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2020-06-03 20:43:19] [INFO ] Flatten gal took : 151 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-7 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 158764 kB
After kill :
MemTotal: 16427364 kB
MemFree: 8171984 kB

--------------------
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-7"
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-7, 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-158987928800630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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