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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K 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 2.7K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.2K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 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 44K 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-8-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591217869105

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:57:51] [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:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:57:52] [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:57:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2020-06-03 20:57:52] [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:57:52] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 63 ms.
[2020-06-03 20:57:52] [INFO ] Computed order based on color domains.
[2020-06-03 20:57:52] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions in 36 ms.
[2020-06-03 20:57:52] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 82 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 102 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0]
[2020-06-03 20:57:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 20:57:52] [INFO ] Computed 82 place invariants in 15 ms
[2020-06-03 20:57:53] [INFO ] [Real]Absence check using 82 positive place invariants in 55 ms returned sat
[2020-06-03 20:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:53] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-03 20:57:53] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 20:57:53] [INFO ] [Real]Added 128 Read/Feed constraints in 41 ms returned sat
[2020-06-03 20:57:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:57:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 29 ms returned sat
[2020-06-03 20:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:53] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2020-06-03 20:57:53] [INFO ] [Nat]Added 128 Read/Feed constraints in 51 ms returned sat
[2020-06-03 20:57:54] [INFO ] Deduced a trap composed of 51 places in 603 ms
[2020-06-03 20:57:55] [INFO ] Deduced a trap composed of 45 places in 1008 ms
[2020-06-03 20:57:55] [INFO ] Deduced a trap composed of 52 places in 157 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 52 places in 137 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 48 places in 208 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 52 places in 112 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 52 places in 132 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 48 places in 96 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 48 places in 180 ms
[2020-06-03 20:57:56] [INFO ] Deduced a trap composed of 48 places in 95 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 44 places in 90 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 54 places in 85 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 55 places in 102 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 50 places in 87 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 53 places in 86 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 54 places in 96 ms
[2020-06-03 20:57:57] [INFO ] Deduced a trap composed of 66 places in 69 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 62 places in 89 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 55 places in 79 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 52 places in 78 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 51 places in 106 ms
[2020-06-03 20:57:58] [INFO ] Deduced a trap composed of 52 places in 204 ms
[2020-06-03 20:57:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s6 s18 s19 s20 s21 s22 s23 s24 s25 s31 s34 s36 s40 s42 s43 s45 s46 s47 s48 s49 s55 s58 s59 s61 s62 s63 s64 s65 s66 s67 s69 s70 s71 s72 s73 s92 s118 s190 s236 s244 s258 s259 s260 s261 s262 s263 s264 s265) 0)") while checking expression at index 0
[2020-06-03 20:57:58] [INFO ] [Real]Absence check using 82 positive place invariants in 25 ms returned sat
[2020-06-03 20:57:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:58] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-06-03 20:57:58] [INFO ] [Real]Added 128 Read/Feed constraints in 21 ms returned sat
[2020-06-03 20:57:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:57:59] [INFO ] [Nat]Absence check using 82 positive place invariants in 63 ms returned sat
[2020-06-03 20:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:57:59] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2020-06-03 20:57:59] [INFO ] [Nat]Added 128 Read/Feed constraints in 32 ms returned sat
[2020-06-03 20:57:59] [INFO ] Deduced a trap composed of 14 places in 107 ms
[2020-06-03 20:57:59] [INFO ] Deduced a trap composed of 30 places in 84 ms
[2020-06-03 20:57:59] [INFO ] Deduced a trap composed of 46 places in 93 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 49 places in 695 ms
[2020-06-03 20:58:00] [INFO ] Deduced a trap composed of 17 places in 178 ms
[2020-06-03 20:58:01] [INFO ] Deduced a trap composed of 24 places in 399 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 16 places in 1181 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-06-03 20:58:02] [INFO ] Deduced a trap composed of 24 places in 194 ms
[2020-06-03 20:58:05] [INFO ] Deduced a trap composed of 50 places in 2918 ms
[2020-06-03 20:58:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s2 s4 s6 s7 s18 s19 s20 s21 s22 s23 s24 s25 s26 s28 s32 s36 s39 s42 s43 s44 s45 s46 s47 s49 s58 s59 s60 s61 s62 s63 s65 s66 s67 s68 s69 s70 s71 s72 s73 s96 s149 s248 s258 s259 s260 s261 s262 s263 s264 s265) 0)") while checking expression at index 1
[2020-06-03 20:58:05] [INFO ] [Real]Absence check using 82 positive place invariants in 53 ms returned sat
[2020-06-03 20:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:06] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2020-06-03 20:58:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:58:06] [INFO ] [Nat]Absence check using 82 positive place invariants in 27 ms returned sat
[2020-06-03 20:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:06] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2020-06-03 20:58:06] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-06-03 20:58:06] [INFO ] Deduced a trap composed of 56 places in 192 ms
[2020-06-03 20:58:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2020-06-03 20:58:06] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 28 ms.
[2020-06-03 20:58:07] [INFO ] Added : 175 causal constraints over 36 iterations in 1220 ms. Result :sat
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 10 places in 99 ms
[2020-06-03 20:58:08] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-06-03 20:58:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 20:58:08] [INFO ] [Real]Absence check using 82 positive place invariants in 2 ms returned unsat
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 31600 steps, including 897 resets, run finished after 122 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 48 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 46 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2472 ms. (steps per millisecond=404 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1212 ms. (steps per millisecond=825 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 14710082 steps, run timeout after 30001 ms. (steps per millisecond=490 ) properties seen :[0, 0, 0]
Probabilistic random walk after 14710082 steps, saw 1860590 distinct states, run finished after 30001 ms. (steps per millisecond=490 ) properties seen :[0, 0, 0]
[2020-06-03 20:58:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 20:58:43] [INFO ] Computed 82 place invariants in 4 ms
[2020-06-03 20:58:43] [INFO ] [Real]Absence check using 82 positive place invariants in 40 ms returned sat
[2020-06-03 20:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:43] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2020-06-03 20:58:44] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 20:58:44] [INFO ] [Real]Added 128 Read/Feed constraints in 47 ms returned sat
[2020-06-03 20:58:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:58:44] [INFO ] [Nat]Absence check using 82 positive place invariants in 57 ms returned sat
[2020-06-03 20:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:44] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-06-03 20:58:44] [INFO ] [Nat]Added 128 Read/Feed constraints in 34 ms returned sat
[2020-06-03 20:58:44] [INFO ] Deduced a trap composed of 51 places in 100 ms
[2020-06-03 20:58:44] [INFO ] Deduced a trap composed of 45 places in 134 ms
[2020-06-03 20:58:44] [INFO ] Deduced a trap composed of 52 places in 78 ms
[2020-06-03 20:58:44] [INFO ] Deduced a trap composed of 52 places in 87 ms
[2020-06-03 20:58:44] [INFO ] Deduced a trap composed of 48 places in 84 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 52 places in 114 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 48 places in 89 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 48 places in 87 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 48 places in 86 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 44 places in 93 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 54 places in 103 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 55 places in 85 ms
[2020-06-03 20:58:45] [INFO ] Deduced a trap composed of 50 places in 80 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 53 places in 103 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 54 places in 81 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 66 places in 79 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 62 places in 96 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 55 places in 84 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 52 places in 84 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-06-03 20:58:46] [INFO ] Deduced a trap composed of 51 places in 81 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 52 places in 97 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 53 places in 135 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 56 places in 81 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 49 places in 78 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 60 places in 80 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 17 places in 77 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 54 places in 79 ms
[2020-06-03 20:58:47] [INFO ] Deduced a trap composed of 52 places in 87 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 54 places in 129 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 55 places in 123 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 46 places in 74 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 49 places in 84 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 57 places in 78 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 49 places in 72 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 55 places in 96 ms
[2020-06-03 20:58:48] [INFO ] Deduced a trap composed of 50 places in 87 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 57 places in 84 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 51 places in 92 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 62 places in 169 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 59 places in 109 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 48 places in 85 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 49 places in 86 ms
[2020-06-03 20:58:49] [INFO ] Deduced a trap composed of 43 places in 82 ms
[2020-06-03 20:58:50] [INFO ] Deduced a trap composed of 14 places in 82 ms
[2020-06-03 20:58:50] [INFO ] Deduced a trap composed of 33 places in 77 ms
[2020-06-03 20:58:50] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2020-06-03 20:58:50] [INFO ] Deduced a trap composed of 10 places in 74 ms
[2020-06-03 20:58:50] [INFO ] Deduced a trap composed of 62 places in 80 ms
[2020-06-03 20:58:50] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 6023 ms
[2020-06-03 20:58:50] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 26 ms.
[2020-06-03 20:58:54] [INFO ] Added : 371 causal constraints over 75 iterations in 3975 ms. Result :sat
[2020-06-03 20:58:54] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-06-03 20:58:54] [INFO ] Deduced a trap composed of 36 places in 87 ms
[2020-06-03 20:58:54] [INFO ] Deduced a trap composed of 32 places in 98 ms
[2020-06-03 20:58:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 548 ms
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-06-03 20:58:55] [INFO ] [Real]Absence check using 82 positive place invariants in 21 ms returned sat
[2020-06-03 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:55] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-06-03 20:58:55] [INFO ] [Real]Added 128 Read/Feed constraints in 31 ms returned sat
[2020-06-03 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:58:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2020-06-03 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:55] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-06-03 20:58:55] [INFO ] [Nat]Added 128 Read/Feed constraints in 16 ms returned sat
[2020-06-03 20:58:55] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 20:58:55] [INFO ] Deduced a trap composed of 30 places in 74 ms
[2020-06-03 20:58:55] [INFO ] Deduced a trap composed of 46 places in 92 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 49 places in 108 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 17 places in 68 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 16 places in 98 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 50 places in 91 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 48 places in 103 ms
[2020-06-03 20:58:56] [INFO ] Deduced a trap composed of 49 places in 97 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 49 places in 107 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 9 places in 81 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 42 places in 85 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 17 places in 71 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-06-03 20:58:57] [INFO ] Deduced a trap composed of 44 places in 83 ms
[2020-06-03 20:58:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 2270 ms
[2020-06-03 20:58:57] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-06-03 20:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:58] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-06-03 20:58:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:58:58] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2020-06-03 20:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:58:58] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-06-03 20:58:58] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-06-03 20:58:58] [INFO ] Deduced a trap composed of 56 places in 78 ms
[2020-06-03 20:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2020-06-03 20:58:58] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 21 ms.
[2020-06-03 20:58:59] [INFO ] Added : 175 causal constraints over 36 iterations in 1082 ms. Result :sat
[2020-06-03 20:58:59] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2020-06-03 20:58:59] [INFO ] Deduced a trap composed of 10 places in 31 ms
[2020-06-03 20:58:59] [INFO ] Deduced a trap composed of 9 places in 20 ms
[2020-06-03 20:58:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 239 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 31600 steps, including 910 resets, run finished after 83 ms. (steps per millisecond=380 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 143800 steps, including 1000 resets, run finished after 356 ms. (steps per millisecond=403 ) properties seen :[0, 0] could not realise parikh vector
Support contains 40 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 26 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2139 ms. (steps per millisecond=467 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 15412010 steps, run timeout after 30001 ms. (steps per millisecond=513 ) properties seen :[0, 0]
Probabilistic random walk after 15412010 steps, saw 1962234 distinct states, run finished after 30003 ms. (steps per millisecond=513 ) properties seen :[0, 0]
[2020-06-03 20:59:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 20:59:34] [INFO ] Computed 82 place invariants in 2 ms
[2020-06-03 20:59:34] [INFO ] [Real]Absence check using 82 positive place invariants in 42 ms returned sat
[2020-06-03 20:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:34] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-06-03 20:59:34] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 20:59:34] [INFO ] [Real]Added 128 Read/Feed constraints in 37 ms returned sat
[2020-06-03 20:59:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:34] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-06-03 20:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:34] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-06-03 20:59:34] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2020-06-03 20:59:34] [INFO ] Deduced a trap composed of 51 places in 77 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 45 places in 77 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 52 places in 103 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 52 places in 79 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 48 places in 90 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 52 places in 74 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 52 places in 71 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 48 places in 71 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 48 places in 88 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 48 places in 83 ms
[2020-06-03 20:59:35] [INFO ] Deduced a trap composed of 44 places in 77 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 54 places in 83 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 55 places in 78 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 50 places in 82 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 53 places in 100 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 54 places in 83 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 66 places in 104 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 62 places in 79 ms
[2020-06-03 20:59:36] [INFO ] Deduced a trap composed of 55 places in 119 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 52 places in 90 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 51 places in 98 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 52 places in 79 ms
[2020-06-03 20:59:37] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 53 places in 1024 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 56 places in 94 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 49 places in 78 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2020-06-03 20:59:38] [INFO ] Deduced a trap composed of 60 places in 107 ms
[2020-06-03 20:59:39] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-06-03 20:59:40] [INFO ] Deduced a trap composed of 54 places in 1434 ms
[2020-06-03 20:59:41] [INFO ] Deduced a trap composed of 52 places in 1421 ms
[2020-06-03 20:59:44] [INFO ] Deduced a trap composed of 54 places in 2349 ms
[2020-06-03 20:59:44] [INFO ] Deduced a trap composed of 55 places in 71 ms
[2020-06-03 20:59:44] [INFO ] Deduced a trap composed of 46 places in 73 ms
[2020-06-03 20:59:44] [INFO ] Deduced a trap composed of 53 places in 71 ms
[2020-06-03 20:59:44] [INFO ] Deduced a trap composed of 52 places in 74 ms
[2020-06-03 20:59:44] [INFO ] Deduced a trap composed of 49 places in 83 ms
[2020-06-03 20:59:47] [INFO ] Deduced a trap composed of 57 places in 2848 ms
[2020-06-03 20:59:47] [INFO ] Deduced a trap composed of 49 places in 81 ms
[2020-06-03 20:59:49] [INFO ] Deduced a trap composed of 55 places in 1340 ms
[2020-06-03 20:59:49] [INFO ] Deduced a trap composed of 50 places in 92 ms
[2020-06-03 20:59:49] [INFO ] Deduced a trap composed of 57 places in 77 ms
[2020-06-03 20:59:49] [INFO ] Deduced a trap composed of 51 places in 77 ms
[2020-06-03 20:59:49] [INFO ] Deduced a trap composed of 9 places in 81 ms
[2020-06-03 20:59:50] [INFO ] Deduced a trap composed of 62 places in 1143 ms
[2020-06-03 20:59:50] [INFO ] Deduced a trap composed of 59 places in 98 ms
[2020-06-03 20:59:50] [INFO ] Deduced a trap composed of 48 places in 116 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 49 places in 119 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 43 places in 107 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 10 places in 84 ms
[2020-06-03 20:59:51] [INFO ] Deduced a trap composed of 62 places in 83 ms
[2020-06-03 20:59:51] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 16946 ms
[2020-06-03 20:59:51] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 29 ms.
[2020-06-03 20:59:55] [INFO ] Added : 371 causal constraints over 75 iterations in 3526 ms. Result :sat
[2020-06-03 20:59:55] [INFO ] Deduced a trap composed of 9 places in 140 ms
[2020-06-03 20:59:55] [INFO ] Deduced a trap composed of 36 places in 89 ms
[2020-06-03 20:59:55] [INFO ] Deduced a trap composed of 32 places in 85 ms
[2020-06-03 20:59:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 580 ms
Attempting to minimize the solution found.
Minimization took 60 ms.
[2020-06-03 20:59:56] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2020-06-03 20:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:56] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-03 20:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:59:56] [INFO ] [Nat]Absence check using 82 positive place invariants in 38 ms returned sat
[2020-06-03 20:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:59:56] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-06-03 20:59:56] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-06-03 20:59:56] [INFO ] Deduced a trap composed of 56 places in 144 ms
[2020-06-03 20:59:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2020-06-03 20:59:56] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 20 ms.
[2020-06-03 20:59:57] [INFO ] Added : 175 causal constraints over 36 iterations in 1158 ms. Result :sat
[2020-06-03 20:59:58] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2020-06-03 20:59:58] [INFO ] Deduced a trap composed of 10 places in 32 ms
[2020-06-03 20:59:58] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-03 20:59:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 31600 steps, including 895 resets, run finished after 79 ms. (steps per millisecond=400 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 143800 steps, including 1000 resets, run finished after 297 ms. (steps per millisecond=484 ) properties seen :[0, 0] could not realise parikh vector
Support contains 40 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 22 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 9 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2020-06-03 20:59:58] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 20:59:58] [INFO ] Computed 82 place invariants in 2 ms
[2020-06-03 20:59:58] [INFO ] Implicit Places using invariants in 250 ms returned []
[2020-06-03 20:59:58] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 20:59:58] [INFO ] Computed 82 place invariants in 3 ms
[2020-06-03 20:59:59] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:00:00] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2020-06-03 21:00:00] [INFO ] Redundant transitions in 26 ms returned []
[2020-06-03 21:00:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:00:00] [INFO ] Computed 82 place invariants in 1 ms
[2020-06-03 21:00:00] [INFO ] Dead Transitions using invariants and state equation in 505 ms returned []
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 213 ms. (steps per millisecond=469 ) properties seen :[0, 0]
[2020-06-03 21:00:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:00:00] [INFO ] Computed 82 place invariants in 1 ms
[2020-06-03 21:00:00] [INFO ] [Real]Absence check using 82 positive place invariants in 44 ms returned sat
[2020-06-03 21:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:01] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-03 21:00:01] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:00:01] [INFO ] [Real]Added 128 Read/Feed constraints in 34 ms returned sat
[2020-06-03 21:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:01] [INFO ] [Nat]Absence check using 82 positive place invariants in 28 ms returned sat
[2020-06-03 21:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:01] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2020-06-03 21:00:01] [INFO ] [Nat]Added 128 Read/Feed constraints in 16 ms returned sat
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 51 places in 318 ms
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 45 places in 98 ms
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 52 places in 122 ms
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 52 places in 161 ms
[2020-06-03 21:00:02] [INFO ] Deduced a trap composed of 48 places in 223 ms
[2020-06-03 21:00:03] [INFO ] Deduced a trap composed of 52 places in 1004 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 52 places in 915 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 48 places in 101 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 48 places in 182 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 48 places in 188 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 44 places in 108 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 54 places in 471 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 55 places in 97 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 50 places in 106 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 53 places in 80 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 54 places in 89 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 66 places in 117 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 62 places in 78 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 55 places in 75 ms
[2020-06-03 21:00:06] [INFO ] Deduced a trap composed of 52 places in 75 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 51 places in 95 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 52 places in 92 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 53 places in 117 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 56 places in 84 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 49 places in 131 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-06-03 21:00:07] [INFO ] Deduced a trap composed of 60 places in 92 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 54 places in 81 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 52 places in 80 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 54 places in 76 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 55 places in 83 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 46 places in 111 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 53 places in 98 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-06-03 21:00:08] [INFO ] Deduced a trap composed of 49 places in 102 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 57 places in 82 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 49 places in 83 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 55 places in 88 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 50 places in 101 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 57 places in 110 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 51 places in 106 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 62 places in 94 ms
[2020-06-03 21:00:09] [INFO ] Deduced a trap composed of 59 places in 95 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 48 places in 84 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 49 places in 99 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 43 places in 95 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 14 places in 100 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 33 places in 89 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 33 places in 107 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 10 places in 106 ms
[2020-06-03 21:00:10] [INFO ] Deduced a trap composed of 62 places in 79 ms
[2020-06-03 21:00:10] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 9132 ms
[2020-06-03 21:00:10] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 40 ms.
[2020-06-03 21:00:16] [INFO ] Added : 371 causal constraints over 75 iterations in 5467 ms. Result :sat
[2020-06-03 21:00:17] [INFO ] Deduced a trap composed of 9 places in 1435 ms
[2020-06-03 21:00:20] [INFO ] Deduced a trap composed of 36 places in 2103 ms
[2020-06-03 21:00:20] [INFO ] Deduced a trap composed of 32 places in 734 ms
[2020-06-03 21:00:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4595 ms
[2020-06-03 21:00:21] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-06-03 21:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:21] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-03 21:00:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:21] [INFO ] [Nat]Absence check using 82 positive place invariants in 34 ms returned sat
[2020-06-03 21:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:21] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2020-06-03 21:00:21] [INFO ] [Nat]Added 128 Read/Feed constraints in 37 ms returned sat
[2020-06-03 21:00:22] [INFO ] Deduced a trap composed of 56 places in 1215 ms
[2020-06-03 21:00:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1232 ms
[2020-06-03 21:00:22] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 17 ms.
[2020-06-03 21:00:25] [INFO ] Added : 175 causal constraints over 36 iterations in 2360 ms. Result :sat
[2020-06-03 21:00:26] [INFO ] Deduced a trap composed of 20 places in 1697 ms
[2020-06-03 21:00:27] [INFO ] Deduced a trap composed of 10 places in 441 ms
[2020-06-03 21:00:27] [INFO ] Deduced a trap composed of 9 places in 66 ms
[2020-06-03 21:00:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2358 ms
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 266 transition count 416
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 266 transition count 352
Deduced a syphon composed of 64 places in 13 ms
Ensure Unique test removed 64 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 1 with 192 rules applied. Total rules applied 360 place count 138 transition count 352
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 376 place count 130 transition count 408
Applied a total of 376 rules in 70 ms. Remains 130 /266 variables (removed 136) and now considering 408/584 (removed 176) transitions.
// Phase 1: matrix 408 rows 130 cols
[2020-06-03 21:00:27] [INFO ] Computed 18 place invariants in 1 ms
[2020-06-03 21:00:27] [INFO ] [Real]Absence check using 18 positive place invariants in 69 ms returned sat
[2020-06-03 21:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:27] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-03 21:00:28] [INFO ] Computed and/alt/rep : 392/4368/392 causal constraints in 33 ms.
[2020-06-03 21:00:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2020-06-03 21:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:28] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-03 21:00:28] [INFO ] Computed and/alt/rep : 392/4368/392 causal constraints in 59 ms.
[2020-06-03 21:00:32] [INFO ] Added : 330 causal constraints over 69 iterations in 4562 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
[2020-06-03 21:00:32] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2020-06-03 21:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:33] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-06-03 21:00:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 123 ms returned sat
[2020-06-03 21:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:34] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2020-06-03 21:00:34] [INFO ] Computed and/alt/rep : 392/4368/392 causal constraints in 31 ms.
[2020-06-03 21:00:38] [INFO ] Added : 336 causal constraints over 69 iterations in 4562 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-06-03 21:00:38] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2020-06-03 21:00:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
[2020-06-03 21:00:39] [INFO ] Flatten gal took : 126 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-8 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 2346692 kB
After kill :
MemTotal: 16427332 kB
MemFree: 2336704 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-8"
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-8, 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-158987928800638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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