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

About the Execution of ITS-LoLa for LamportFastMutEx-PT-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15780.530 3600000.00 6246640.00 22761.60 TTTTT?TFTTTTFFFT 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-158987928900695.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-PT-8, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928900695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 7.9K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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 18K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 317K 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-PT-8-ReachabilityFireability-00
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-01
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-02
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-03
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-04
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-05
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-06
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-07
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-08
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-09
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-10
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-11
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-12
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-13
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-14
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591219909796

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:31:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:31:52] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2020-06-03 21:31:52] [INFO ] Transformed 315 places.
[2020-06-03 21:31:52] [INFO ] Transformed 666 transitions.
[2020-06-03 21:31:52] [INFO ] Parsed PT model containing 315 places and 666 transitions in 151 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/ReachabilityFireability.xml in 110 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1]
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0]
[2020-06-03 21:31:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:31:52] [INFO ] Computed 82 place invariants in 10 ms
[2020-06-03 21:31:52] [INFO ] [Real]Absence check using 82 positive place invariants in 47 ms returned sat
[2020-06-03 21:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:53] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-06-03 21:31:53] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:31:53] [INFO ] [Real]Added 128 Read/Feed constraints in 19 ms returned sat
[2020-06-03 21:31:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:31:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 54 ms returned sat
[2020-06-03 21:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:53] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2020-06-03 21:31:53] [INFO ] [Nat]Added 128 Read/Feed constraints in 21 ms returned sat
[2020-06-03 21:31:54] [INFO ] Deduced a trap composed of 42 places in 208 ms
[2020-06-03 21:31:54] [INFO ] Deduced a trap composed of 8 places in 230 ms
[2020-06-03 21:31:54] [INFO ] Deduced a trap composed of 34 places in 462 ms
[2020-06-03 21:31:55] [INFO ] Deduced a trap composed of 30 places in 124 ms
[2020-06-03 21:31:55] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2020-06-03 21:31:55] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-06-03 21:31:55] [INFO ] Deduced a trap composed of 19 places in 294 ms
[2020-06-03 21:32:01] [INFO ] Deduced a trap composed of 46 places in 5473 ms
[2020-06-03 21:32:01] [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 (> (+ s3 s9 s10 s12 s14 s15 s17 s18 s21 s22 s23 s25 s26 s33 s42 s52 s54 s57 s60 s62 s65 s75 s76 s80 s83 s84 s88 s91 s92 s93 s96 s109 s114 s146 s165 s181 s235 s237 s243 s244 s245 s246 s249 s251 s252 s255) 0)") while checking expression at index 0
[2020-06-03 21:32:01] [INFO ] [Real]Absence check using 82 positive place invariants in 31 ms returned sat
[2020-06-03 21:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:01] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2020-06-03 21:32:01] [INFO ] [Real]Added 128 Read/Feed constraints in 23 ms returned sat
[2020-06-03 21:32:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:32:01] [INFO ] [Nat]Absence check using 82 positive place invariants in 56 ms returned sat
[2020-06-03 21:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:01] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-06-03 21:32:01] [INFO ] [Nat]Added 128 Read/Feed constraints in 18 ms returned sat
[2020-06-03 21:32:01] [INFO ] Deduced a trap composed of 8 places in 170 ms
[2020-06-03 21:32:02] [INFO ] Deduced a trap composed of 24 places in 94 ms
[2020-06-03 21:32:02] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2020-06-03 21:32:02] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-06-03 21:32:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 607 ms
[2020-06-03 21:32:02] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 71 ms.
[2020-06-03 21:32:04] [INFO ] Added : 238 causal constraints over 48 iterations in 2046 ms. Result :sat
[2020-06-03 21:32:04] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-06-03 21:32:04] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2020-06-03 21:32:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 21:32:04] [INFO ] [Real]Absence check using 82 positive place invariants in 48 ms returned sat
[2020-06-03 21:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:05] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2020-06-03 21:32:05] [INFO ] [Real]Added 128 Read/Feed constraints in 22 ms returned sat
[2020-06-03 21:32:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:32:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 31 ms returned sat
[2020-06-03 21:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:05] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2020-06-03 21:32:05] [INFO ] [Nat]Added 128 Read/Feed constraints in 20 ms returned sat
[2020-06-03 21:32:06] [INFO ] Deduced a trap composed of 8 places in 258 ms
[2020-06-03 21:32:06] [INFO ] Deduced a trap composed of 31 places in 153 ms
[2020-06-03 21:32:11] [INFO ] Deduced a trap composed of 15 places in 5222 ms
[2020-06-03 21:32:11] [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 (> (+ s17 s18 s19 s20 s21 s22 s23 s24 s81 s89 s97 s169 s241 s252 s257) 0)") while checking expression at index 2
[2020-06-03 21:32:11] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2020-06-03 21:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:12] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2020-06-03 21:32:12] [INFO ] [Real]Added 128 Read/Feed constraints in 30 ms returned sat
[2020-06-03 21:32:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:32:13] [INFO ] [Nat]Absence check using 82 positive place invariants in 553 ms returned sat
[2020-06-03 21:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:14] [INFO ] [Nat]Absence check using state equation in 1503 ms returned sat
[2020-06-03 21:32:14] [INFO ] [Nat]Added 128 Read/Feed constraints in 29 ms returned sat
[2020-06-03 21:32:14] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2020-06-03 21:32:15] [INFO ] Deduced a trap composed of 25 places in 90 ms
[2020-06-03 21:32:15] [INFO ] Deduced a trap composed of 9 places in 447 ms
[2020-06-03 21:32:16] [INFO ] Deduced a trap composed of 9 places in 919 ms
[2020-06-03 21:32:18] [INFO ] Deduced a trap composed of 35 places in 1865 ms
[2020-06-03 21:32:18] [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 s9 s11 s13 s14 s15 s16 s17 s18 s19 s21 s22 s24 s25 s26 s31 s42 s51 s53 s59 s61 s76 s79 s84 s87 s92 s95 s119 s138 s191 s236 s243 s244 s245 s252) 0)") while checking expression at index 3
Incomplete Parikh walk after 65000 steps, including 1000 resets, run finished after 534 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 67 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 133 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/266 places, 576/584 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2762 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2792 ms. (steps per millisecond=358 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 14018151 steps, run timeout after 30001 ms. (steps per millisecond=467 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 14018151 steps, saw 1753000 distinct states, run finished after 30014 ms. (steps per millisecond=467 ) properties seen :[0, 0, 0, 0]
[2020-06-03 21:32:56] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2020-06-03 21:32:56] [INFO ] Computed 82 place invariants in 3 ms
[2020-06-03 21:32:57] [INFO ] [Real]Absence check using 82 positive place invariants in 199 ms returned sat
[2020-06-03 21:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:58] [INFO ] [Real]Absence check using state equation in 998 ms returned sat
[2020-06-03 21:32:58] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:32:58] [INFO ] [Real]Added 128 Read/Feed constraints in 52 ms returned sat
[2020-06-03 21:32:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:32:58] [INFO ] [Nat]Absence check using 82 positive place invariants in 284 ms returned sat
[2020-06-03 21:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:32:58] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2020-06-03 21:32:58] [INFO ] [Nat]Added 128 Read/Feed constraints in 19 ms returned sat
[2020-06-03 21:32:59] [INFO ] Deduced a trap composed of 30 places in 307 ms
[2020-06-03 21:32:59] [INFO ] Deduced a trap composed of 27 places in 611 ms
[2020-06-03 21:33:02] [INFO ] Deduced a trap composed of 8 places in 2390 ms
[2020-06-03 21:33:03] [INFO ] Deduced a trap composed of 19 places in 1370 ms
[2020-06-03 21:33:05] [INFO ] Deduced a trap composed of 24 places in 1992 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 7 places in 877 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 38 places in 73 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 34 places in 61 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 30 places in 83 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 21 places in 73 ms
[2020-06-03 21:33:06] [INFO ] Deduced a trap composed of 17 places in 70 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 34 places in 105 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 33 places in 71 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 25 places in 80 ms
[2020-06-03 21:33:07] [INFO ] Deduced a trap composed of 35 places in 92 ms
[2020-06-03 21:33:08] [INFO ] Deduced a trap composed of 7 places in 69 ms
[2020-06-03 21:33:08] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-06-03 21:33:08] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2020-06-03 21:33:08] [INFO ] Deduced a trap composed of 36 places in 141 ms
[2020-06-03 21:33:08] [INFO ] Deduced a trap composed of 34 places in 148 ms
[2020-06-03 21:33:08] [INFO ] Deduced a trap composed of 32 places in 147 ms
[2020-06-03 21:33:09] [INFO ] Deduced a trap composed of 8 places in 1102 ms
[2020-06-03 21:33:09] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 36 places in 68 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 29 places in 91 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 24 places in 88 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2020-06-03 21:33:10] [INFO ] Deduced a trap composed of 19 places in 85 ms
[2020-06-03 21:33:11] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-06-03 21:33:11] [INFO ] Deduced a trap composed of 36 places in 78 ms
[2020-06-03 21:33:11] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2020-06-03 21:33:11] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2020-06-03 21:33:11] [INFO ] Deduced a trap composed of 23 places in 155 ms
[2020-06-03 21:33:11] [INFO ] Deduced a trap composed of 17 places in 210 ms
[2020-06-03 21:33:12] [INFO ] Deduced a trap composed of 30 places in 197 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 23 places in 1179 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 17 places in 99 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 34 places in 73 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 29 places in 72 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 17 places in 72 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 35 places in 91 ms
[2020-06-03 21:33:13] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 20 places in 73 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 23 places in 65 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 29 places in 65 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2020-06-03 21:33:14] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 32 places in 62 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 28 places in 159 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 26 places in 150 ms
[2020-06-03 21:33:15] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 28 places in 69 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 33 places in 63 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 9 places in 68 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 29 places in 81 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 27 places in 80 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-06-03 21:33:16] [INFO ] Deduced a trap composed of 37 places in 90 ms
[2020-06-03 21:33:17] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-06-03 21:33:17] [INFO ] Deduced a trap composed of 34 places in 85 ms
[2020-06-03 21:33:17] [INFO ] Deduced a trap composed of 27 places in 111 ms
[2020-06-03 21:33:17] [INFO ] Deduced a trap composed of 34 places in 202 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 34 places in 454 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 34 places in 196 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 38 places in 126 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 32 places in 87 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 35 places in 106 ms
[2020-06-03 21:33:18] [INFO ] Deduced a trap composed of 30 places in 90 ms
[2020-06-03 21:33:19] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-06-03 21:33:19] [INFO ] Deduced a trap composed of 32 places in 88 ms
[2020-06-03 21:33:19] [INFO ] Deduced a trap composed of 35 places in 256 ms
[2020-06-03 21:33:19] [INFO ] Deduced a trap composed of 25 places in 170 ms
[2020-06-03 21:33:19] [INFO ] Deduced a trap composed of 43 places in 164 ms
[2020-06-03 21:33:20] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-06-03 21:33:20] [INFO ] Deduced a trap composed of 29 places in 167 ms
[2020-06-03 21:33:20] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-06-03 21:33:20] [INFO ] Deduced a trap composed of 22 places in 91 ms
[2020-06-03 21:33:20] [INFO ] Deduced a trap composed of 28 places in 167 ms
[2020-06-03 21:33:20] [INFO ] Deduced a trap composed of 24 places in 166 ms
[2020-06-03 21:33:21] [INFO ] Deduced a trap composed of 34 places in 177 ms
[2020-06-03 21:33:21] [INFO ] Deduced a trap composed of 29 places in 151 ms
[2020-06-03 21:33:21] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-06-03 21:33:21] [INFO ] Deduced a trap composed of 42 places in 163 ms
[2020-06-03 21:33:21] [INFO ] Deduced a trap composed of 33 places in 146 ms
[2020-06-03 21:33:21] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 19 places in 93 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 31 places in 78 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 37 places in 71 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 39 places in 70 ms
[2020-06-03 21:33:22] [INFO ] Deduced a trap composed of 38 places in 70 ms
[2020-06-03 21:33:23] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2020-06-03 21:33:23] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-06-03 21:33:23] [INFO ] Deduced a trap composed of 34 places in 70 ms
[2020-06-03 21:33:23] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2020-06-03 21:33:23] [INFO ] Deduced a trap composed of 41 places in 486 ms
[2020-06-03 21:33:25] [INFO ] Deduced a trap composed of 42 places in 1815 ms
[2020-06-03 21:33:27] [INFO ] Deduced a trap composed of 29 places in 1971 ms
[2020-06-03 21:33:29] [INFO ] Deduced a trap composed of 33 places in 1805 ms
[2020-06-03 21:33:29] [INFO ] Deduced a trap composed of 25 places in 195 ms
[2020-06-03 21:33:29] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-06-03 21:33:30] [INFO ] Deduced a trap composed of 30 places in 84 ms
[2020-06-03 21:33:30] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-06-03 21:33:30] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-06-03 21:33:34] [INFO ] Deduced a trap composed of 29 places in 3598 ms
[2020-06-03 21:33:35] [INFO ] Deduced a trap composed of 23 places in 1811 ms
[2020-06-03 21:33:38] [INFO ] Deduced a trap composed of 18 places in 3051 ms
[2020-06-03 21:33:41] [INFO ] Deduced a trap composed of 32 places in 2351 ms
[2020-06-03 21:33:44] [INFO ] Deduced a trap composed of 34 places in 3325 ms
[2020-06-03 21:33:44] [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 (> (+ s9 s10 s11 s12 s14 s15 s17 s18 s20 s21 s24 s25 s38 s46 s48 s54 s57 s62 s65 s70 s75 s78 s79 s83 s86 s87 s104 s126 s136 s198 s230 s238 s241 s246) 0)") while checking expression at index 0
[2020-06-03 21:33:44] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-06-03 21:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:45] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2020-06-03 21:33:45] [INFO ] [Real]Added 128 Read/Feed constraints in 54 ms returned sat
[2020-06-03 21:33:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:45] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-06-03 21:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:45] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2020-06-03 21:33:45] [INFO ] [Nat]Added 128 Read/Feed constraints in 19 ms returned sat
[2020-06-03 21:33:45] [INFO ] Deduced a trap composed of 20 places in 226 ms
[2020-06-03 21:33:47] [INFO ] Deduced a trap composed of 8 places in 2155 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 8 places in 89 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 25 places in 92 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 21 places in 79 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 33 places in 87 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-06-03 21:33:48] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2020-06-03 21:33:50] [INFO ] Deduced a trap composed of 20 places in 1995 ms
[2020-06-03 21:33:52] [INFO ] Deduced a trap composed of 16 places in 1806 ms
[2020-06-03 21:33:55] [INFO ] Deduced a trap composed of 19 places in 2980 ms
[2020-06-03 21:33:55] [INFO ] Deduced a trap composed of 19 places in 148 ms
[2020-06-03 21:33:56] [INFO ] Deduced a trap composed of 9 places in 172 ms
[2020-06-03 21:33:57] [INFO ] Deduced a trap composed of 21 places in 1653 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 16 places in 306 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 24 places in 111 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 16 places in 81 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 28 places in 89 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-06-03 21:33:58] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 37 places in 102 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 36 places in 254 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 23 places in 69 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 26 places in 53 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 21:33:59] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-06-03 21:34:00] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2020-06-03 21:34:00] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-06-03 21:34:00] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14617 ms
[2020-06-03 21:34:00] [INFO ] Computed and/alt/rep : 568/5368/400 causal constraints in 25 ms.
[2020-06-03 21:34:05] [INFO ] Added : 363 causal constraints over 73 iterations in 4899 ms. Result :sat
[2020-06-03 21:34:05] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-06-03 21:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
Attempting to minimize the solution found.
Minimization took 52 ms.
[2020-06-03 21:34:05] [INFO ] [Real]Absence check using 82 positive place invariants in 41 ms returned sat
[2020-06-03 21:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:34:05] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-03 21:34:05] [INFO ] [Real]Added 128 Read/Feed constraints in 18 ms returned sat
[2020-06-03 21:34:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:34:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 23 ms returned sat
[2020-06-03 21:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:34:06] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2020-06-03 21:34:06] [INFO ] [Nat]Added 128 Read/Feed constraints in 34 ms returned sat
[2020-06-03 21:34:07] [INFO ] Deduced a trap composed of 8 places in 1226 ms
[2020-06-03 21:34:07] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2020-06-03 21:34:07] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2020-06-03 21:34:07] [INFO ] Deduced a trap composed of 7 places in 92 ms
[2020-06-03 21:34:07] [INFO ] Deduced a trap composed of 25 places in 92 ms
[2020-06-03 21:34:07] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-06-03 21:34:08] [INFO ] Deduced a trap composed of 23 places in 98 ms
[2020-06-03 21:34:09] [INFO ] Deduced a trap composed of 20 places in 1572 ms
[2020-06-03 21:34:09] [INFO ] Deduced a trap composed of 32 places in 88 ms
[2020-06-03 21:34:09] [INFO ] Deduced a trap composed of 27 places in 74 ms
[2020-06-03 21:34:09] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 8 places in 101 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 22 places in 94 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2020-06-03 21:34:10] [INFO ] Deduced a trap composed of 29 places in 82 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 21 places in 79 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 10 places in 81 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 10 places in 85 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 14 places in 94 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 29 places in 193 ms
[2020-06-03 21:34:11] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2020-06-03 21:34:14] [INFO ] Deduced a trap composed of 10 places in 2672 ms
[2020-06-03 21:34:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 8635 ms
[2020-06-03 21:34:15] [INFO ] [Real]Absence check using 82 positive place invariants in 305 ms returned sat
[2020-06-03 21:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:34:15] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2020-06-03 21:34:15] [INFO ] [Real]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-06-03 21:34:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:34:16] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2020-06-03 21:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:34:16] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-06-03 21:34:16] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-06-03 21:34:16] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2020-06-03 21:34:16] [INFO ] Deduced a trap composed of 8 places in 103 ms
[2020-06-03 21:34:16] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2020-06-03 21:34:16] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-06-03 21:34:16] [INFO ] Deduced a trap composed of 7 places in 88 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 30 places in 91 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 39 places in 83 ms
[2020-06-03 21:34:17] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 21:34:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1472 ms
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 134200 steps, including 1000 resets, run finished after 318 ms. (steps per millisecond=422 ) properties seen :[0, 0] could not realise parikh vector
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 576/576 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2440 ms. (steps per millisecond=409 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2785 ms. (steps per millisecond=359 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 14971199 steps, run timeout after 30001 ms. (steps per millisecond=499 ) properties seen :[0, 0]
Probabilistic random walk after 14971199 steps, saw 1888331 distinct states, run finished after 30001 ms. (steps per millisecond=499 ) properties seen :[0, 0]
[2020-06-03 21:34:53] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2020-06-03 21:34:53] [INFO ] Computed 82 place invariants in 8 ms
[2020-06-03 21:34:54] [INFO ] [Real]Absence check using 82 positive place invariants in 210 ms returned sat
[2020-06-03 21:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:34:54] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2020-06-03 21:34:54] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:34:54] [INFO ] [Real]Added 128 Read/Feed constraints in 36 ms returned sat
[2020-06-03 21:34:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:34:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 29 ms returned sat
[2020-06-03 21:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:34:55] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-06-03 21:34:55] [INFO ] [Nat]Added 128 Read/Feed constraints in 24 ms returned sat
[2020-06-03 21:34:55] [INFO ] Deduced a trap composed of 30 places in 323 ms
[2020-06-03 21:34:55] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2020-06-03 21:34:57] [INFO ] Deduced a trap composed of 8 places in 1602 ms
[2020-06-03 21:35:00] [INFO ] Deduced a trap composed of 19 places in 2581 ms
[2020-06-03 21:35:01] [INFO ] Deduced a trap composed of 24 places in 899 ms
[2020-06-03 21:35:03] [INFO ] Deduced a trap composed of 7 places in 2670 ms
[2020-06-03 21:35:03] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2020-06-03 21:35:03] [INFO ] Deduced a trap composed of 38 places in 89 ms
[2020-06-03 21:35:04] [INFO ] Deduced a trap composed of 34 places in 370 ms
[2020-06-03 21:35:04] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-06-03 21:35:06] [INFO ] Deduced a trap composed of 24 places in 1922 ms
[2020-06-03 21:35:06] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2020-06-03 21:35:06] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 21:35:06] [INFO ] Deduced a trap composed of 25 places in 166 ms
[2020-06-03 21:35:06] [INFO ] Deduced a trap composed of 34 places in 161 ms
[2020-06-03 21:35:07] [INFO ] Deduced a trap composed of 33 places in 135 ms
[2020-06-03 21:35:07] [INFO ] Deduced a trap composed of 35 places in 157 ms
[2020-06-03 21:35:07] [INFO ] Deduced a trap composed of 35 places in 103 ms
[2020-06-03 21:35:07] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2020-06-03 21:35:07] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2020-06-03 21:35:08] [INFO ] Deduced a trap composed of 31 places in 1355 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 35 places in 74 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 18 places in 61 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 36 places in 73 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 32 places in 59 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 31 places in 79 ms
[2020-06-03 21:35:09] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 31 places in 85 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 24 places in 177 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-06-03 21:35:10] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-06-03 21:35:11] [INFO ] Deduced a trap composed of 31 places in 170 ms
[2020-06-03 21:35:11] [INFO ] Deduced a trap composed of 36 places in 166 ms
[2020-06-03 21:35:11] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-06-03 21:35:11] [INFO ] Deduced a trap composed of 21 places in 169 ms
[2020-06-03 21:35:11] [INFO ] Deduced a trap composed of 23 places in 91 ms
[2020-06-03 21:35:11] [INFO ] Deduced a trap composed of 17 places in 157 ms
[2020-06-03 21:35:12] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2020-06-03 21:35:12] [INFO ] Deduced a trap composed of 23 places in 169 ms
[2020-06-03 21:35:12] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2020-06-03 21:35:12] [INFO ] Deduced a trap composed of 34 places in 192 ms
[2020-06-03 21:35:12] [INFO ] Deduced a trap composed of 29 places in 97 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 17 places in 203 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 35 places in 215 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 26 places in 179 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 25 places in 81 ms
[2020-06-03 21:35:13] [INFO ] Deduced a trap composed of 17 places in 77 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 29 places in 86 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 32 places in 146 ms
[2020-06-03 21:35:14] [INFO ] Deduced a trap composed of 30 places in 86 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 33 places in 85 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 28 places in 77 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 33 places in 66 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 27 places in 64 ms
[2020-06-03 21:35:15] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 29 places in 91 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 27 places in 80 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 26 places in 110 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 32 places in 92 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-06-03 21:35:16] [INFO ] Deduced a trap composed of 27 places in 88 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 34 places in 89 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 38 places in 72 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-06-03 21:35:17] [INFO ] Deduced a trap composed of 35 places in 120 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 32 places in 80 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 25 places in 88 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 29 places in 83 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 29 places in 226 ms
[2020-06-03 21:35:18] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 22 places in 103 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 28 places in 99 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 29 places in 150 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 42 places in 72 ms
[2020-06-03 21:35:19] [INFO ] Deduced a trap composed of 33 places in 91 ms
[2020-06-03 21:35:20] [INFO ] Deduced a trap composed of 27 places in 75 ms
[2020-06-03 21:35:20] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2020-06-03 21:35:20] [INFO ] Deduced a trap composed of 19 places in 698 ms
[2020-06-03 21:35:20] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 31 places in 174 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 37 places in 168 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 24 places in 158 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 21 places in 60 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 32 places in 71 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 39 places in 112 ms
[2020-06-03 21:35:21] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-06-03 21:35:22] [INFO ] Deduced a trap composed of 34 places in 165 ms
[2020-06-03 21:35:22] [INFO ] Deduced a trap composed of 29 places in 168 ms
[2020-06-03 21:35:22] [INFO ] Deduced a trap composed of 34 places in 149 ms
[2020-06-03 21:35:22] [INFO ] Deduced a trap composed of 33 places in 157 ms
[2020-06-03 21:35:22] [INFO ] Deduced a trap composed of 41 places in 192 ms
[2020-06-03 21:35:23] [INFO ] Deduced a trap composed of 42 places in 163 ms
[2020-06-03 21:35:23] [INFO ] Deduced a trap composed of 29 places in 149 ms
[2020-06-03 21:35:23] [INFO ] Deduced a trap composed of 33 places in 154 ms
[2020-06-03 21:35:23] [INFO ] Deduced a trap composed of 25 places in 168 ms
[2020-06-03 21:35:23] [INFO ] Deduced a trap composed of 23 places in 221 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 30 places in 1057 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 34 places in 137 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 18 places in 134 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 29 places in 82 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 18 places in 78 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 32 places in 95 ms
[2020-06-03 21:35:25] [INFO ] Deduced a trap composed of 34 places in 88 ms
[2020-06-03 21:35:26] [INFO ] Deduced a trap composed of 31 places in 91 ms
[2020-06-03 21:35:26] [INFO ] Deduced a trap composed of 30 places in 90 ms
[2020-06-03 21:35:26] [INFO ] Deduced a trap composed of 23 places in 88 ms
[2020-06-03 21:35:26] [INFO ] Deduced a trap composed of 39 places in 92 ms
[2020-06-03 21:35:26] [INFO ] Deduced a trap composed of 37 places in 177 ms
[2020-06-03 21:35:28] [INFO ] Deduced a trap composed of 9 places in 2098 ms
[2020-06-03 21:35:28] [INFO ] Deduced a trap composed of 35 places in 81 ms
[2020-06-03 21:35:28] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 26 places in 81 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 10 places in 75 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 28 places in 77 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 20 places in 73 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 39 places in 83 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 29 places in 79 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 34 places in 85 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 23 places in 80 ms
[2020-06-03 21:35:29] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 32 places in 94 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 20 places in 80 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 33 places in 103 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-06-03 21:35:30] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 27 places in 88 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 24 places in 87 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 27 places in 85 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 23 places in 88 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 37 places in 145 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 19 places in 156 ms
[2020-06-03 21:35:31] [INFO ] Deduced a trap composed of 22 places in 158 ms
[2020-06-03 21:35:32] [INFO ] Deduced a trap composed of 35 places in 92 ms
[2020-06-03 21:35:32] [INFO ] Deduced a trap composed of 30 places in 157 ms
[2020-06-03 21:35:32] [INFO ] Deduced a trap composed of 28 places in 179 ms
[2020-06-03 21:35:32] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2020-06-03 21:35:32] [INFO ] Deduced a trap composed of 36 places in 84 ms
[2020-06-03 21:35:32] [INFO ] Deduced a trap composed of 34 places in 144 ms
[2020-06-03 21:35:34] [INFO ] Deduced a trap composed of 30 places in 1247 ms
[2020-06-03 21:35:34] [INFO ] Deduced a trap composed of 40 places in 90 ms
[2020-06-03 21:35:34] [INFO ] Deduced a trap composed of 35 places in 161 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 33 places in 1680 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 32 places in 96 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 23 places in 105 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 26 places in 88 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 17 places in 109 ms
[2020-06-03 21:35:36] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-06-03 21:35:37] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2020-06-03 21:35:37] [INFO ] Deduced a trap composed of 23 places in 78 ms
[2020-06-03 21:35:37] [INFO ] Deduced a trap composed of 25 places in 94 ms
[2020-06-03 21:35:37] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 38 places in 652 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 27 places in 74 ms
[2020-06-03 21:35:38] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-03 21:35:39] [INFO ] Deduced a trap composed of 27 places in 104 ms
[2020-06-03 21:35:39] [INFO ] Deduced a trap composed of 29 places in 120 ms
[2020-06-03 21:35:39] [INFO ] Deduced a trap composed of 34 places in 94 ms
[2020-06-03 21:35:39] [INFO ] Deduced a trap composed of 22 places in 95 ms
[2020-06-03 21:35:39] [INFO ] Deduced a trap composed of 17 places in 97 ms
[2020-06-03 21:35:41] [INFO ] Deduced a trap composed of 22 places in 1308 ms
[2020-06-03 21:35:41] [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 (> (+ s3 s17 s18 s19 s20 s21 s22 s23 s24 s33 s36 s47 s55 s63 s81 s89 s121 s151 s193 s229 s237 s249) 0)") while checking expression at index 0
[2020-06-03 21:35:41] [INFO ] [Real]Absence check using 82 positive place invariants in 183 ms returned sat
[2020-06-03 21:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:35:42] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2020-06-03 21:35:42] [INFO ] [Real]Added 128 Read/Feed constraints in 94 ms returned sat
[2020-06-03 21:35:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:35:42] [INFO ] [Nat]Absence check using 82 positive place invariants in 152 ms returned sat
[2020-06-03 21:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:35:43] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2020-06-03 21:35:43] [INFO ] [Nat]Added 128 Read/Feed constraints in 21 ms returned sat
[2020-06-03 21:35:44] [INFO ] Deduced a trap composed of 20 places in 1248 ms
[2020-06-03 21:35:45] [INFO ] Deduced a trap composed of 8 places in 1459 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 8 places in 1353 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 21 places in 74 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-06-03 21:35:47] [INFO ] Deduced a trap composed of 25 places in 82 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 25 places in 87 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2020-06-03 21:35:48] [INFO ] Deduced a trap composed of 21 places in 176 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 16 places in 159 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 7 places in 79 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 33 places in 143 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-06-03 21:35:49] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-03 21:35:50] [INFO ] Deduced a trap composed of 37 places in 85 ms
[2020-06-03 21:35:50] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-06-03 21:35:50] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2020-06-03 21:35:52] [INFO ] Deduced a trap composed of 36 places in 2387 ms
[2020-06-03 21:35:53] [INFO ] Deduced a trap composed of 23 places in 1083 ms
[2020-06-03 21:35:53] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-06-03 21:35:53] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2020-06-03 21:35:53] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2020-06-03 21:35:54] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-06-03 21:35:54] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-06-03 21:35:54] [INFO ] Deduced a trap composed of 21 places in 64 ms
[2020-06-03 21:35:54] [INFO ] Deduced a trap composed of 21 places in 57 ms
[2020-06-03 21:35:54] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 11083 ms
[2020-06-03 21:35:54] [INFO ] Computed and/alt/rep : 568/5368/400 causal constraints in 34 ms.
[2020-06-03 21:35:58] [INFO ] Added : 363 causal constraints over 73 iterations in 3723 ms. Result :sat
[2020-06-03 21:35:58] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2020-06-03 21:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
Incomplete Parikh walk after 134200 steps, including 1000 resets, run finished after 340 ms. (steps per millisecond=394 ) properties seen :[0, 0] could not realise parikh vector
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 576/576 transitions.
Starting structural reductions, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2020-06-03 21:35:58] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2020-06-03 21:35:58] [INFO ] Computed 82 place invariants in 3 ms
[2020-06-03 21:35:58] [INFO ] Implicit Places using invariants in 266 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 268 ms to find 8 implicit places.
[2020-06-03 21:35:58] [INFO ] Redundant transitions in 24 ms returned []
[2020-06-03 21:35:58] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:35:58] [INFO ] Computed 74 place invariants in 2 ms
[2020-06-03 21:35:59] [INFO ] Dead Transitions using invariants and state equation in 669 ms returned []
Starting structural reductions, iteration 1 : 250/258 places, 576/576 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2020-06-03 21:35:59] [INFO ] Redundant transitions in 8 ms returned []
[2020-06-03 21:35:59] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:35:59] [INFO ] Computed 74 place invariants in 2 ms
[2020-06-03 21:36:00] [INFO ] Dead Transitions using invariants and state equation in 840 ms returned []
Finished structural reductions, in 2 iterations. Remains : 250/258 places, 576/576 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2326 ms. (steps per millisecond=429 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2702 ms. (steps per millisecond=370 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 14520153 steps, run timeout after 30001 ms. (steps per millisecond=483 ) properties seen :[0, 0]
Probabilistic random walk after 14520153 steps, saw 1808654 distinct states, run finished after 30013 ms. (steps per millisecond=483 ) properties seen :[0, 0]
[2020-06-03 21:36:35] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:36:35] [INFO ] Computed 74 place invariants in 1 ms
[2020-06-03 21:36:36] [INFO ] [Real]Absence check using 74 positive place invariants in 116 ms returned sat
[2020-06-03 21:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:37] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2020-06-03 21:36:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:36:37] [INFO ] [Nat]Absence check using 74 positive place invariants in 213 ms returned sat
[2020-06-03 21:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:38] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2020-06-03 21:36:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2020-06-03 21:36:38] [INFO ] [Nat]Added 64 Read/Feed constraints in 53 ms returned sat
[2020-06-03 21:36:40] [INFO ] Deduced a trap composed of 27 places in 2626 ms
[2020-06-03 21:36:44] [INFO ] Deduced a trap composed of 18 places in 3166 ms
[2020-06-03 21:36:46] [INFO ] Deduced a trap composed of 8 places in 2134 ms
[2020-06-03 21:36:48] [INFO ] Deduced a trap composed of 22 places in 2126 ms
[2020-06-03 21:36:50] [INFO ] Deduced a trap composed of 8 places in 2235 ms
[2020-06-03 21:36:53] [INFO ] Deduced a trap composed of 24 places in 2291 ms
[2020-06-03 21:36:55] [INFO ] Deduced a trap composed of 35 places in 1912 ms
[2020-06-03 21:36:57] [INFO ] Deduced a trap composed of 40 places in 2404 ms
[2020-06-03 21:36:59] [INFO ] Deduced a trap composed of 8 places in 2429 ms
[2020-06-03 21:37:02] [INFO ] Deduced a trap composed of 28 places in 2383 ms
[2020-06-03 21:37:04] [INFO ] Deduced a trap composed of 28 places in 2289 ms
[2020-06-03 21:37:07] [INFO ] Deduced a trap composed of 27 places in 2916 ms
[2020-06-03 21:37:10] [INFO ] Deduced a trap composed of 25 places in 3227 ms
[2020-06-03 21:37:13] [INFO ] Deduced a trap composed of 35 places in 2687 ms
[2020-06-03 21:37:15] [INFO ] Deduced a trap composed of 8 places in 2133 ms
[2020-06-03 21:37:17] [INFO ] Deduced a trap composed of 32 places in 2170 ms
[2020-06-03 21:37:20] [INFO ] Deduced a trap composed of 40 places in 2541 ms
[2020-06-03 21:37:23] [INFO ] Deduced a trap composed of 30 places in 2726 ms
[2020-06-03 21:37:23] [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 (> (+ s1 s17 s20 s21 s23 s24 s25 s30 s43 s44 s51 s52 s59 s60 s67 s74 s75 s78 s82 s83 s86 s92 s98 s124 s162 s219 s227 s234 s235 s238) 0)") while checking expression at index 0
[2020-06-03 21:37:23] [INFO ] [Real]Absence check using 74 positive place invariants in 526 ms returned sat
[2020-06-03 21:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:24] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2020-06-03 21:37:24] [INFO ] [Real]Added 64 Read/Feed constraints in 28 ms returned sat
[2020-06-03 21:37:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:37:24] [INFO ] [Nat]Absence check using 74 positive place invariants in 21 ms returned sat
[2020-06-03 21:37:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:24] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-06-03 21:37:24] [INFO ] [Nat]Added 64 Read/Feed constraints in 12 ms returned sat
[2020-06-03 21:37:25] [INFO ] Deduced a trap composed of 25 places in 562 ms
[2020-06-03 21:37:26] [INFO ] Deduced a trap composed of 17 places in 912 ms
[2020-06-03 21:37:28] [INFO ] Deduced a trap composed of 21 places in 2247 ms
[2020-06-03 21:37:31] [INFO ] Deduced a trap composed of 25 places in 2727 ms
[2020-06-03 21:37:33] [INFO ] Deduced a trap composed of 30 places in 2662 ms
[2020-06-03 21:37:36] [INFO ] Deduced a trap composed of 16 places in 2484 ms
[2020-06-03 21:37:36] [INFO ] Deduced a trap composed of 9 places in 353 ms
[2020-06-03 21:37:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 12143 ms
[2020-06-03 21:37:36] [INFO ] Computed and/alt/rep : 568/5224/400 causal constraints in 69 ms.
[2020-06-03 21:37:44] [INFO ] Added : 391 causal constraints over 79 iterations in 7559 ms. Result :sat
[2020-06-03 21:37:44] [INFO ] Deduced a trap composed of 8 places in 597 ms
[2020-06-03 21:37:45] [INFO ] Deduced a trap composed of 8 places in 450 ms
[2020-06-03 21:37:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1248 ms
Attempting to minimize the solution found.
Minimization took 113 ms.
Incomplete Parikh walk after 133500 steps, including 1000 resets, run finished after 369 ms. (steps per millisecond=361 ) properties seen :[0, 0] could not realise parikh vector
Support contains 65 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 35 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 576/576 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2020-06-03 21:37:46] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:37:46] [INFO ] Computed 74 place invariants in 4 ms
[2020-06-03 21:37:48] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2020-06-03 21:37:48] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:37:48] [INFO ] Computed 74 place invariants in 1 ms
[2020-06-03 21:37:49] [INFO ] State equation strengthened by 64 read => feed constraints.
[2020-06-03 21:37:52] [INFO ] Implicit Places using invariants and state equation in 4136 ms returned []
Implicit Place search using SMT with State Equation took 6258 ms to find 0 implicit places.
[2020-06-03 21:37:52] [INFO ] Redundant transitions in 3 ms returned []
[2020-06-03 21:37:52] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:37:52] [INFO ] Computed 74 place invariants in 0 ms
[2020-06-03 21:37:56] [INFO ] Dead Transitions using invariants and state equation in 4325 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 493 ms. (steps per millisecond=202 ) properties seen :[0, 0]
[2020-06-03 21:37:57] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2020-06-03 21:37:57] [INFO ] Computed 74 place invariants in 1 ms
[2020-06-03 21:37:57] [INFO ] [Real]Absence check using 74 positive place invariants in 145 ms returned sat
[2020-06-03 21:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:58] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2020-06-03 21:37:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:37:58] [INFO ] [Nat]Absence check using 74 positive place invariants in 257 ms returned sat
[2020-06-03 21:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:00] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2020-06-03 21:38:00] [INFO ] State equation strengthened by 64 read => feed constraints.
[2020-06-03 21:38:00] [INFO ] [Nat]Added 64 Read/Feed constraints in 57 ms returned sat
[2020-06-03 21:38:02] [INFO ] Deduced a trap composed of 27 places in 2538 ms
[2020-06-03 21:38:05] [INFO ] Deduced a trap composed of 18 places in 2585 ms
[2020-06-03 21:38:07] [INFO ] Deduced a trap composed of 8 places in 2345 ms
[2020-06-03 21:38:10] [INFO ] Deduced a trap composed of 22 places in 2642 ms
[2020-06-03 21:38:12] [INFO ] Deduced a trap composed of 8 places in 2162 ms
[2020-06-03 21:38:14] [INFO ] Deduced a trap composed of 24 places in 2151 ms
[2020-06-03 21:38:17] [INFO ] Deduced a trap composed of 35 places in 2683 ms
[2020-06-03 21:38:19] [INFO ] Deduced a trap composed of 40 places in 2255 ms
[2020-06-03 21:38:19] [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 (> (+ s1 s9 s10 s11 s12 s15 s16 s17 s19 s21 s23 s25 s29 s30 s44 s54 s55 s62 s63 s74 s76 s78 s80 s82 s84 s86 s88 s92 s105 s128 s140 s169 s192 s219 s222 s227 s230 s231 s238 s241) 0)") while checking expression at index 0
[2020-06-03 21:38:20] [INFO ] [Real]Absence check using 74 positive place invariants in 384 ms returned sat
[2020-06-03 21:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:21] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2020-06-03 21:38:21] [INFO ] [Real]Added 64 Read/Feed constraints in 56 ms returned sat
[2020-06-03 21:38:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:38:21] [INFO ] [Nat]Absence check using 74 positive place invariants in 65 ms returned sat
[2020-06-03 21:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:22] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2020-06-03 21:38:22] [INFO ] [Nat]Added 64 Read/Feed constraints in 37 ms returned sat
[2020-06-03 21:38:24] [INFO ] Deduced a trap composed of 25 places in 1884 ms
[2020-06-03 21:38:26] [INFO ] Deduced a trap composed of 17 places in 2476 ms
[2020-06-03 21:38:29] [INFO ] Deduced a trap composed of 21 places in 3377 ms
[2020-06-03 21:38:32] [INFO ] Deduced a trap composed of 25 places in 2056 ms
[2020-06-03 21:38:34] [INFO ] Deduced a trap composed of 30 places in 1993 ms
[2020-06-03 21:38:36] [INFO ] Deduced a trap composed of 16 places in 2559 ms
[2020-06-03 21:38:37] [INFO ] Deduced a trap composed of 9 places in 414 ms
[2020-06-03 21:38:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 14908 ms
[2020-06-03 21:38:37] [INFO ] Computed and/alt/rep : 568/5224/400 causal constraints in 59 ms.
[2020-06-03 21:38:41] [INFO ] Added : 250 causal constraints over 50 iterations in 4167 ms. Result :(error "Solver has unexpectedly terminated")
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 250 transition count 408
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 250 transition count 344
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 352 place count 130 transition count 344
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 368 place count 122 transition count 336
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 376 place count 122 transition count 328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 384 place count 114 transition count 328
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 114 transition count 328
Applied a total of 392 rules in 44 ms. Remains 114 /250 variables (removed 136) and now considering 328/576 (removed 248) transitions.
// Phase 1: matrix 328 rows 114 cols
[2020-06-03 21:38:41] [INFO ] Computed 18 place invariants in 1 ms
[2020-06-03 21:38:41] [INFO ] [Real]Absence check using 18 positive place invariants in 34 ms returned sat
[2020-06-03 21:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:42] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-06-03 21:38:42] [INFO ] Computed and/alt/rep : 312/2800/312 causal constraints in 42 ms.
[2020-06-03 21:38:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:38:42] [INFO ] [Nat]Absence check using 18 positive place invariants in 98 ms returned sat
[2020-06-03 21:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:42] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2020-06-03 21:38:43] [INFO ] Computed and/alt/rep : 312/2800/312 causal constraints in 38 ms.
[2020-06-03 21:38:46] [INFO ] Added : 266 causal constraints over 54 iterations in 3743 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2020-06-03 21:38:47] [INFO ] [Real]Absence check using 18 positive place invariants in 90 ms returned sat
[2020-06-03 21:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:47] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2020-06-03 21:38:47] [INFO ] Computed and/alt/rep : 312/2800/312 causal constraints in 31 ms.
[2020-06-03 21:38:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:38:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 46 ms returned sat
[2020-06-03 21:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:48] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2020-06-03 21:38:48] [INFO ] Computed and/alt/rep : 312/2800/312 causal constraints in 23 ms.
[2020-06-03 21:38:52] [INFO ] Added : 276 causal constraints over 56 iterations in 4253 ms. Result :sat
[2020-06-03 21:38:52] [INFO ] Deduced a trap composed of 10 places in 439 ms
[2020-06-03 21:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 533 ms
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-03 21:38:53] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2020-06-03 21:38:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
[2020-06-03 21:38:53] [INFO ] Flatten gal took : 282 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ LamportFastMutEx-PT-8 @ 3570 seconds

FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 5313884 kB
After kill :
MemTotal: 16427332 kB
MemFree: 5306440 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-PT-8"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is LamportFastMutEx-PT-8, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928900695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-8.tgz
mv LamportFastMutEx-PT-8 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;