About the Execution of ITS-LoLa for Peterson-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.210 | 3600000.00 | 533855.00 | 276.00 | TTTTFTTTT?TTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600679.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600679
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 44K Apr 27 15:14 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 Peterson-COL-4-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591162736334
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:38:58] [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 05:38:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:38:59] [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 05:38:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 789 ms
[2020-06-03 05:38:59] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,
[2020-06-03 05:38:59] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 20 ms.
[2020-06-03 05:38:59] [INFO ] Computed order based on color domains.
[2020-06-03 05:39:00] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 155 ms.
[2020-06-03 05:39:00] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 20 places in 16 ms
Reduce places removed 20 places and 40 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 292 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 268 ms. (steps per millisecond=37 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0]
FORMULA Peterson-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 127 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 227 ms. (steps per millisecond=44 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 260 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Peterson-COL-4-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 163 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 166 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 149 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:39:01] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-06-03 05:39:01] [INFO ] Computed 19 place invariants in 41 ms
[2020-06-03 05:39:02] [INFO ] [Real]Absence check using 14 positive place invariants in 90 ms returned sat
[2020-06-03 05:39:02] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2020-06-03 05:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:03] [INFO ] [Real]Absence check using state equation in 1451 ms returned sat
[2020-06-03 05:39:04] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:39:04] [INFO ] [Real]Added 132 Read/Feed constraints in 52 ms returned sat
[2020-06-03 05:39:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 92 ms returned sat
[2020-06-03 05:39:04] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 19 ms returned sat
[2020-06-03 05:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:06] [INFO ] [Nat]Absence check using state equation in 1692 ms returned sat
[2020-06-03 05:39:06] [INFO ] [Nat]Added 132 Read/Feed constraints in 69 ms returned sat
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 10 places in 857 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 58 places in 861 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 54 places in 433 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 18 places in 408 ms
[2020-06-03 05:39:09] [INFO ] Deduced a trap composed of 18 places in 417 ms
[2020-06-03 05:39:09] [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 (> (+ s5 s15 s35 s36 s37 s39 s45 s46 s47 s48 s67 s73 s135 s165 s260 s290 s348 s372) 0)") while checking expression at index 0
[2020-06-03 05:39:09] [INFO ] [Real]Absence check using 14 positive place invariants in 44 ms returned sat
[2020-06-03 05:39:09] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 14 ms returned sat
[2020-06-03 05:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:11] [INFO ] [Real]Absence check using state equation in 1555 ms returned sat
[2020-06-03 05:39:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 98 ms returned sat
[2020-06-03 05:39:11] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 27 ms returned sat
[2020-06-03 05:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:14] [INFO ] [Nat]Absence check using state equation in 2748 ms returned sat
[2020-06-03 05:39:14] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-06-03 05:39:14] [INFO ] Deduced a trap composed of 98 places in 658 ms
[2020-06-03 05:39:15] [INFO ] Deduced a trap composed of 45 places in 351 ms
[2020-06-03 05:39:15] [INFO ] Deduced a trap composed of 43 places in 411 ms
[2020-06-03 05:39:16] [INFO ] Deduced a trap composed of 25 places in 455 ms
[2020-06-03 05:39:16] [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 (> (+ s13 s31 s35 s36 s37 s39 s67 s135 s136 s137 s138 s139 s260 s261 s262 s263 s264 s348 s349 s350 s351 s440 s441 s442 s443) 0)") while checking expression at index 1
[2020-06-03 05:39:16] [INFO ] [Real]Absence check using 14 positive place invariants in 62 ms returned sat
[2020-06-03 05:39:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 25 ms returned sat
[2020-06-03 05:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:17] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2020-06-03 05:39:17] [INFO ] [Real]Added 132 Read/Feed constraints in 48 ms returned sat
[2020-06-03 05:39:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 50 ms returned sat
[2020-06-03 05:39:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 65 ms returned sat
[2020-06-03 05:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:20] [INFO ] [Nat]Absence check using state equation in 2547 ms returned sat
[2020-06-03 05:39:20] [INFO ] [Nat]Added 132 Read/Feed constraints in 41 ms returned sat
[2020-06-03 05:39:21] [INFO ] Deduced a trap composed of 62 places in 1120 ms
[2020-06-03 05:39:24] [INFO ] Deduced a trap composed of 18 places in 2319 ms
[2020-06-03 05:39:24] [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 (> (+ s7 s9 s19 s23 s35 s36 s38 s39 s63 s115 s116 s186 s197 s240 s241 s332 s333 s420) 0)") while checking expression at index 2
[2020-06-03 05:39:24] [INFO ] [Real]Absence check using 14 positive place invariants in 38 ms returned sat
[2020-06-03 05:39:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 46 ms returned sat
[2020-06-03 05:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:26] [INFO ] [Real]Absence check using state equation in 1924 ms returned sat
[2020-06-03 05:39:26] [INFO ] [Real]Added 132 Read/Feed constraints in 49 ms returned sat
[2020-06-03 05:39:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 42 ms returned sat
[2020-06-03 05:39:26] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 14 ms returned sat
[2020-06-03 05:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:27] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2020-06-03 05:39:27] [INFO ] [Nat]Added 132 Read/Feed constraints in 34 ms returned sat
[2020-06-03 05:39:31] [INFO ] Deduced a trap composed of 49 places in 3517 ms
[2020-06-03 05:39:31] [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: Broken pipe (> (+ s5 s15 s20 s21 s22 s24 s25 s26 s35 s38 s39 s50 s51 s52 s54 s59 s60 s61 s63 s64 s65 s70 s95 s100 s105 s115 s120 s125 s150 s179 s180 s181 s183 s184 s185 s220 s225 s230 s240 s245 s250 s275 s316 s320 s324 s332 s336 s340 s360) 0)") while checking expression at index 3
[2020-06-03 05:39:31] [INFO ] [Real]Absence check using 14 positive place invariants in 118 ms returned sat
[2020-06-03 05:39:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 70 ms returned sat
[2020-06-03 05:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:35] [INFO ] [Real]Absence check using state equation in 3713 ms returned sat
[2020-06-03 05:39:35] [INFO ] [Real]Added 132 Read/Feed constraints in 57 ms returned sat
[2020-06-03 05:39:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 86 ms returned sat
[2020-06-03 05:39:35] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 42 ms returned sat
[2020-06-03 05:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:37] [INFO ] [Nat]Absence check using state equation in 1822 ms returned sat
[2020-06-03 05:39:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-06-03 05:39:40] [INFO ] Deduced a trap composed of 54 places in 2813 ms
[2020-06-03 05:39:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:39:42] [INFO ] Deduced a trap composed of 2 places in 2147 ms
[2020-06-03 05:39:42] [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 s8) 0)") while checking expression at index 4
[2020-06-03 05:39:43] [INFO ] [Real]Absence check using 14 positive place invariants in 109 ms returned sat
[2020-06-03 05:39:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 51 ms returned sat
[2020-06-03 05:39:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:46] [INFO ] [Real]Absence check using state equation in 3574 ms returned sat
[2020-06-03 05:39:46] [INFO ] [Real]Added 132 Read/Feed constraints in 102 ms returned sat
[2020-06-03 05:39:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 156 ms returned sat
[2020-06-03 05:39:47] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 45 ms returned sat
[2020-06-03 05:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:49] [INFO ] [Nat]Absence check using state equation in 2344 ms returned sat
[2020-06-03 05:39:49] [INFO ] [Nat]Added 132 Read/Feed constraints in 97 ms returned sat
[2020-06-03 05:39:52] [INFO ] Deduced a trap composed of 25 places in 2582 ms
[2020-06-03 05:39:52] [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 (> (+ s13 s31 s35 s36 s38 s39 s63 s115 s116 s117 s118 s119 s240 s241 s242 s243 s244 s332 s333 s334 s335 s420 s421 s422 s423) 0)") while checking expression at index 5
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 14 positive place invariants in 49 ms returned unsat
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2020-06-03 05:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:53] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2020-06-03 05:39:53] [INFO ] [Real]Added 132 Read/Feed constraints in 32 ms returned sat
[2020-06-03 05:39:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 126 ms returned sat
[2020-06-03 05:39:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 45 ms returned sat
[2020-06-03 05:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:57] [INFO ] [Nat]Absence check using state equation in 3498 ms returned sat
[2020-06-03 05:39:57] [INFO ] [Nat]Added 132 Read/Feed constraints in 79 ms returned sat
[2020-06-03 05:40:02] [INFO ] Deduced a trap composed of 27 places in 5085 ms
[2020-06-03 05:40:02] [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 (> (+ s5 s7 s15 s16 s19 s20 s40 s41 s42 s44 s55 s59 s68 s75 s76 s95 s140 s175 s179 s200 s201 s220 s265 s300 s316 s352 s380) 0)") while checking expression at index 7
FORMULA Peterson-COL-4-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 460 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 110 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8795 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 762120 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 386400 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2946 ms. (steps per millisecond=339 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 856098 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 303372 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 769458 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 10491852 steps, run timeout after 30001 ms. (steps per millisecond=349 ) properties seen :[1, 1, 1, 0, 0, 1, 0]
Probabilistic random walk after 10491852 steps, saw 1748643 distinct states, run finished after 30001 ms. (steps per millisecond=349 ) properties seen :[1, 1, 1, 0, 0, 1, 0]
FORMULA Peterson-COL-4-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-06-03 05:41:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-06-03 05:41:11] [INFO ] Computed 19 place invariants in 17 ms
[2020-06-03 05:41:11] [INFO ] [Real]Absence check using 14 positive place invariants in 34 ms returned sat
[2020-06-03 05:41:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 15 ms returned sat
[2020-06-03 05:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:41:12] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2020-06-03 05:41:13] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:41:13] [INFO ] [Real]Added 132 Read/Feed constraints in 121 ms returned sat
[2020-06-03 05:41:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:41:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 42 ms returned sat
[2020-06-03 05:41:13] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 29 ms returned sat
[2020-06-03 05:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:41:15] [INFO ] [Nat]Absence check using state equation in 2496 ms returned sat
[2020-06-03 05:41:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 64 ms returned sat
[2020-06-03 05:41:17] [INFO ] Deduced a trap composed of 49 places in 1175 ms
[2020-06-03 05:41:18] [INFO ] Deduced a trap composed of 18 places in 1562 ms
[2020-06-03 05:41:20] [INFO ] Deduced a trap composed of 54 places in 1365 ms
[2020-06-03 05:41:21] [INFO ] Deduced a trap composed of 18 places in 846 ms
[2020-06-03 05:41:21] [INFO ] Deduced a trap composed of 99 places in 597 ms
[2020-06-03 05:41:25] [INFO ] Deduced a trap composed of 98 places in 3336 ms
[2020-06-03 05:41:26] [INFO ] Deduced a trap composed of 39 places in 1046 ms
[2020-06-03 05:41:27] [INFO ] Deduced a trap composed of 79 places in 754 ms
[2020-06-03 05:41:27] [INFO ] Deduced a trap composed of 47 places in 335 ms
[2020-06-03 05:41:28] [INFO ] Deduced a trap composed of 54 places in 748 ms
[2020-06-03 05:41:28] [INFO ] Deduced a trap composed of 32 places in 641 ms
[2020-06-03 05:41:29] [INFO ] Deduced a trap composed of 59 places in 414 ms
[2020-06-03 05:41:30] [INFO ] Deduced a trap composed of 65 places in 982 ms
[2020-06-03 05:41:31] [INFO ] Deduced a trap composed of 40 places in 660 ms
[2020-06-03 05:41:31] [INFO ] Deduced a trap composed of 103 places in 392 ms
[2020-06-03 05:41:32] [INFO ] Deduced a trap composed of 94 places in 316 ms
[2020-06-03 05:41:32] [INFO ] Deduced a trap composed of 18 places in 296 ms
[2020-06-03 05:41:32] [INFO ] Deduced a trap composed of 61 places in 476 ms
[2020-06-03 05:41:33] [INFO ] Deduced a trap composed of 10 places in 666 ms
[2020-06-03 05:41:34] [INFO ] Deduced a trap composed of 19 places in 596 ms
[2020-06-03 05:41:35] [INFO ] Deduced a trap composed of 17 places in 945 ms
[2020-06-03 05:41:35] [INFO ] Deduced a trap composed of 10 places in 361 ms
[2020-06-03 05:41:36] [INFO ] Deduced a trap composed of 15 places in 368 ms
[2020-06-03 05:41:37] [INFO ] Deduced a trap composed of 18 places in 804 ms
[2020-06-03 05:41:37] [INFO ] Deduced a trap composed of 38 places in 708 ms
[2020-06-03 05:41:38] [INFO ] Deduced a trap composed of 15 places in 400 ms
[2020-06-03 05:41:38] [INFO ] Deduced a trap composed of 14 places in 317 ms
[2020-06-03 05:41:39] [INFO ] Deduced a trap composed of 60 places in 785 ms
[2020-06-03 05:41:40] [INFO ] Deduced a trap composed of 60 places in 592 ms
[2020-06-03 05:41:40] [INFO ] Deduced a trap composed of 76 places in 329 ms
[2020-06-03 05:41:41] [INFO ] Deduced a trap composed of 32 places in 511 ms
[2020-06-03 05:41:41] [INFO ] Deduced a trap composed of 54 places in 244 ms
[2020-06-03 05:41:41] [INFO ] Deduced a trap composed of 30 places in 368 ms
[2020-06-03 05:41:42] [INFO ] Deduced a trap composed of 47 places in 471 ms
[2020-06-03 05:41:42] [INFO ] Deduced a trap composed of 32 places in 318 ms
[2020-06-03 05:41:44] [INFO ] Deduced a trap composed of 72 places in 1638 ms
[2020-06-03 05:41:46] [INFO ] Deduced a trap composed of 76 places in 1534 ms
[2020-06-03 05:41:46] [INFO ] Deduced a trap composed of 32 places in 836 ms
[2020-06-03 05:41:47] [INFO ] Deduced a trap composed of 76 places in 815 ms
[2020-06-03 05:41:49] [INFO ] Deduced a trap composed of 62 places in 1337 ms
[2020-06-03 05:41:50] [INFO ] Deduced a trap composed of 38 places in 1345 ms
[2020-06-03 05:41:52] [INFO ] Deduced a trap composed of 40 places in 1313 ms
[2020-06-03 05:41:53] [INFO ] Deduced a trap composed of 78 places in 1398 ms
[2020-06-03 05:41:54] [INFO ] Deduced a trap composed of 62 places in 573 ms
[2020-06-03 05:41:55] [INFO ] Deduced a trap composed of 36 places in 620 ms
[2020-06-03 05:41:55] [INFO ] Deduced a trap composed of 36 places in 574 ms
[2020-06-03 05:41:56] [INFO ] Deduced a trap composed of 80 places in 228 ms
[2020-06-03 05:41:56] [INFO ] Deduced a trap composed of 88 places in 550 ms
[2020-06-03 05:41:58] [INFO ] Deduced a trap composed of 27 places in 1227 ms
[2020-06-03 05:41:58] [INFO ] Deduced a trap composed of 88 places in 419 ms
[2020-06-03 05:41: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 (> (+ s7 s19 s20 s22 s29 s40 s41 s42 s44 s45 s47 s48 s49 s50 s51 s52 s53 s59 s61 s68 s74 s95 s96 s97 s98 s99 s105 s106 s107 s108 s109 s140 s141 s142 s143 s144 s170 s171 s179 s181 s188 s220 s221 s222 s223 s224 s230 s231 s232 s233 s234 s265 s266 s267 s268 s269 s295 s296 s316 s317 s318 s319 s324 s325 s326 s327 s352 s353 s354 s355 s376 s377 s400 s401 s402 s403 s404 s410 s411 s412 s413 s414 s445 s446 s447 s448 s449 s475) 0)") while checking expression at index 0
[2020-06-03 05:41:58] [INFO ] [Real]Absence check using 14 positive place invariants in 40 ms returned sat
[2020-06-03 05:41:58] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2020-06-03 05:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:42:00] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2020-06-03 05:42:00] [INFO ] [Real]Added 132 Read/Feed constraints in 59 ms returned sat
[2020-06-03 05:42:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:42:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 61 ms returned sat
[2020-06-03 05:42:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 79 ms returned sat
[2020-06-03 05:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:42:02] [INFO ] [Nat]Absence check using state equation in 1985 ms returned sat
[2020-06-03 05:42:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-06-03 05:42:03] [INFO ] Deduced a trap composed of 54 places in 920 ms
[2020-06-03 05:42:04] [INFO ] Deduced a trap composed of 10 places in 763 ms
[2020-06-03 05:42:05] [INFO ] Deduced a trap composed of 18 places in 584 ms
[2020-06-03 05:42:05] [INFO ] Deduced a trap composed of 32 places in 671 ms
[2020-06-03 05:42:06] [INFO ] Deduced a trap composed of 10 places in 409 ms
[2020-06-03 05:42:07] [INFO ] Deduced a trap composed of 10 places in 1420 ms
[2020-06-03 05:42:08] [INFO ] Deduced a trap composed of 21 places in 753 ms
[2020-06-03 05:42:09] [INFO ] Deduced a trap composed of 21 places in 583 ms
[2020-06-03 05:42:10] [INFO ] Deduced a trap composed of 54 places in 896 ms
[2020-06-03 05:42:10] [INFO ] Deduced a trap composed of 76 places in 399 ms
[2020-06-03 05:42:12] [INFO ] Deduced a trap composed of 76 places in 1521 ms
[2020-06-03 05:42:13] [INFO ] Deduced a trap composed of 80 places in 1375 ms
[2020-06-03 05:42:14] [INFO ] Deduced a trap composed of 69 places in 561 ms
[2020-06-03 05:42:14] [INFO ] Deduced a trap composed of 54 places in 532 ms
[2020-06-03 05:42:16] [INFO ] Deduced a trap composed of 43 places in 1219 ms
[2020-06-03 05:42:19] [INFO ] Deduced a trap composed of 76 places in 3051 ms
[2020-06-03 05:42:19] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 16609 ms
[2020-06-03 05:42:19] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 124 ms.
[2020-06-03 05:42:31] [INFO ] Added : 622 causal constraints over 125 iterations in 12138 ms. Result :sat
[2020-06-03 05:42:32] [INFO ] Deduced a trap composed of 33 places in 592 ms
[2020-06-03 05:42:32] [INFO ] Deduced a trap composed of 79 places in 760 ms
[2020-06-03 05:42:33] [INFO ] Deduced a trap composed of 54 places in 535 ms
[2020-06-03 05:42:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2300 ms
Attempting to minimize the solution found.
Minimization took 100 ms.
[2020-06-03 05:42:34] [INFO ] [Real]Absence check using 14 positive place invariants in 98 ms returned sat
[2020-06-03 05:42:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2020-06-03 05:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:42:36] [INFO ] [Real]Absence check using state equation in 2122 ms returned sat
[2020-06-03 05:42:36] [INFO ] [Real]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-06-03 05:42:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:42:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 50 ms returned sat
[2020-06-03 05:42:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 64 ms returned sat
[2020-06-03 05:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:42:37] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2020-06-03 05:42:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 76 ms returned sat
[2020-06-03 05:42:40] [INFO ] Deduced a trap composed of 27 places in 3000 ms
[2020-06-03 05:42:41] [INFO ] Deduced a trap composed of 10 places in 896 ms
[2020-06-03 05:42:43] [INFO ] Deduced a trap composed of 95 places in 1112 ms
[2020-06-03 05:42:43] [INFO ] Deduced a trap composed of 14 places in 435 ms
[2020-06-03 05:42:44] [INFO ] Deduced a trap composed of 18 places in 662 ms
[2020-06-03 05:42:44] [INFO ] Deduced a trap composed of 54 places in 451 ms
[2020-06-03 05:42:46] [INFO ] Deduced a trap composed of 22 places in 1570 ms
[2020-06-03 05:42:47] [INFO ] Deduced a trap composed of 64 places in 1432 ms
[2020-06-03 05:42:49] [INFO ] Deduced a trap composed of 25 places in 1006 ms
[2020-06-03 05:42:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 11158 ms
[2020-06-03 05:42:49] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 94 ms.
[2020-06-03 05:42:56] [INFO ] Added : 458 causal constraints over 92 iterations in 7656 ms. Result :sat
[2020-06-03 05:42:58] [INFO ] Deduced a trap composed of 98 places in 2090 ms
[2020-06-03 05:42:59] [INFO ] Deduced a trap composed of 101 places in 892 ms
[2020-06-03 05:43:00] [INFO ] Deduced a trap composed of 98 places in 816 ms
[2020-06-03 05:43:01] [INFO ] Deduced a trap composed of 56 places in 911 ms
[2020-06-03 05:43:02] [INFO ] Deduced a trap composed of 82 places in 789 ms
[2020-06-03 05:43:03] [INFO ] Deduced a trap composed of 82 places in 507 ms
[2020-06-03 05:43:04] [INFO ] Deduced a trap composed of 70 places in 810 ms
[2020-06-03 05:43:05] [INFO ] Deduced a trap composed of 32 places in 1025 ms
[2020-06-03 05:43:06] [INFO ] Deduced a trap composed of 39 places in 623 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 45 places in 1487 ms
[2020-06-03 05:43:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 11182 ms
Attempting to minimize the solution found.
Minimization took 44 ms.
Incomplete Parikh walk after 103200 steps, including 1000 resets, run finished after 357 ms. (steps per millisecond=289 ) properties seen :[0, 1, 1] could not realise parikh vector
FORMULA Peterson-COL-4-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 170400 steps, including 1000 resets, run finished after 412 ms. (steps per millisecond=413 ) properties seen :[0] could not realise parikh vector
Support contains 35 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 384 place count 288 transition count 399
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 582 place count 189 transition count 399
Applied a total of 582 rules in 91 ms. Remains 189 /480 variables (removed 291) and now considering 399/690 (removed 291) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/480 places, 399/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1301 ms. (steps per millisecond=768 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties seen :[0]
Interrupted probabilistic random walk after 15421260 steps, run timeout after 30001 ms. (steps per millisecond=514 ) properties seen :[0]
Probabilistic random walk after 15421260 steps, saw 2570211 distinct states, run finished after 30005 ms. (steps per millisecond=513 ) properties seen :[0]
[2020-06-03 05:43:41] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-06-03 05:43:41] [INFO ] Computed 19 place invariants in 1 ms
[2020-06-03 05:43:41] [INFO ] [Real]Absence check using 14 positive place invariants in 64 ms returned sat
[2020-06-03 05:43:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2020-06-03 05:43:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:42] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2020-06-03 05:43:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:43:42] [INFO ] [Real]Added 132 Read/Feed constraints in 26 ms returned sat
[2020-06-03 05:43:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:43:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 47 ms returned sat
[2020-06-03 05:43:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 28 ms returned sat
[2020-06-03 05:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:43] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2020-06-03 05:43:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2020-06-03 05:43:43] [INFO ] Deduced a trap composed of 10 places in 125 ms
[2020-06-03 05:43:43] [INFO ] Deduced a trap composed of 10 places in 105 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 21 places in 376 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 24 places in 168 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 8 places in 640 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 9 places in 299 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 11 places in 776 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 17 places in 496 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 15 places in 167 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 22 places in 160 ms
[2020-06-03 05:43:47] [INFO ] Deduced a trap composed of 27 places in 129 ms
[2020-06-03 05:43:48] [INFO ] Deduced a trap composed of 22 places in 880 ms
[2020-06-03 05:43:48] [INFO ] Deduced a trap composed of 15 places in 190 ms
[2020-06-03 05:43:48] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-06-03 05:43:48] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2020-06-03 05:43:48] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-06-03 05:43:48] [INFO ] Deduced a trap composed of 24 places in 173 ms
[2020-06-03 05:43:49] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2020-06-03 05:43:49] [INFO ] Deduced a trap composed of 29 places in 144 ms
[2020-06-03 05:43:49] [INFO ] Deduced a trap composed of 16 places in 398 ms
[2020-06-03 05:43:50] [INFO ] Deduced a trap composed of 24 places in 493 ms
[2020-06-03 05:43:50] [INFO ] Deduced a trap composed of 35 places in 568 ms
[2020-06-03 05:43:50] [INFO ] Deduced a trap composed of 35 places in 88 ms
[2020-06-03 05:43:51] [INFO ] Deduced a trap composed of 22 places in 118 ms
[2020-06-03 05:43:51] [INFO ] Deduced a trap composed of 52 places in 163 ms
[2020-06-03 05:43:52] [INFO ] Deduced a trap composed of 52 places in 1069 ms
[2020-06-03 05:43:52] [INFO ] Deduced a trap composed of 23 places in 637 ms
[2020-06-03 05:43:53] [INFO ] Deduced a trap composed of 21 places in 970 ms
[2020-06-03 05:43:55] [INFO ] Deduced a trap composed of 17 places in 1389 ms
[2020-06-03 05:43:55] [INFO ] Deduced a trap composed of 26 places in 163 ms
[2020-06-03 05:43:55] [INFO ] Deduced a trap composed of 20 places in 140 ms
[2020-06-03 05:43:56] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-06-03 05:43:56] [INFO ] Deduced a trap composed of 24 places in 920 ms
[2020-06-03 05:43:57] [INFO ] Deduced a trap composed of 11 places in 121 ms
[2020-06-03 05:43:57] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2020-06-03 05:43:58] [INFO ] Deduced a trap composed of 19 places in 719 ms
[2020-06-03 05:43:58] [INFO ] Deduced a trap composed of 29 places in 212 ms
[2020-06-03 05:43:58] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2020-06-03 05:43:58] [INFO ] Deduced a trap composed of 28 places in 140 ms
[2020-06-03 05:43:58] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-06-03 05:43:59] [INFO ] Deduced a trap composed of 22 places in 160 ms
[2020-06-03 05:43:59] [INFO ] Deduced a trap composed of 16 places in 319 ms
[2020-06-03 05:43:59] [INFO ] Deduced a trap composed of 10 places in 208 ms
[2020-06-03 05:44:00] [INFO ] Deduced a trap composed of 22 places in 541 ms
[2020-06-03 05:44:01] [INFO ] Deduced a trap composed of 29 places in 1234 ms
[2020-06-03 05:44:02] [INFO ] Deduced a trap composed of 18 places in 1256 ms
[2020-06-03 05:44:03] [INFO ] Deduced a trap composed of 25 places in 99 ms
[2020-06-03 05:44:03] [INFO ] Deduced a trap composed of 28 places in 417 ms
[2020-06-03 05:44:03] [INFO ] Deduced a trap composed of 50 places in 260 ms
[2020-06-03 05:44:04] [INFO ] Deduced a trap composed of 31 places in 176 ms
[2020-06-03 05:44:04] [INFO ] Deduced a trap composed of 40 places in 339 ms
[2020-06-03 05:44:05] [INFO ] Deduced a trap composed of 26 places in 510 ms
[2020-06-03 05:44:05] [INFO ] Deduced a trap composed of 43 places in 265 ms
[2020-06-03 05:44:05] [INFO ] Deduced a trap composed of 36 places in 231 ms
[2020-06-03 05:44:07] [INFO ] Deduced a trap composed of 62 places in 1523 ms
[2020-06-03 05:44:08] [INFO ] Deduced a trap composed of 16 places in 1039 ms
[2020-06-03 05:44:08] [INFO ] Deduced a trap composed of 11 places in 348 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 35 places in 111 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 27 places in 355 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 27 places in 246 ms
[2020-06-03 05:44:11] [INFO ] Deduced a trap composed of 27 places in 1536 ms
[2020-06-03 05:44:12] [INFO ] Deduced a trap composed of 51 places in 1094 ms
[2020-06-03 05:44:12] [INFO ] Deduced a trap composed of 19 places in 266 ms
[2020-06-03 05:44:12] [INFO ] Deduced a trap composed of 26 places in 240 ms
[2020-06-03 05:44:13] [INFO ] Deduced a trap composed of 26 places in 265 ms
[2020-06-03 05:44:13] [INFO ] Deduced a trap composed of 34 places in 124 ms
[2020-06-03 05:44:13] [INFO ] Deduced a trap composed of 18 places in 240 ms
[2020-06-03 05:44:14] [INFO ] Deduced a trap composed of 11 places in 302 ms
[2020-06-03 05:44:14] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2020-06-03 05:44:14] [INFO ] Deduced a trap composed of 42 places in 96 ms
[2020-06-03 05:44:14] [INFO ] Deduced a trap composed of 31 places in 172 ms
[2020-06-03 05:44:15] [INFO ] Deduced a trap composed of 44 places in 747 ms
[2020-06-03 05:44:15] [INFO ] Deduced a trap composed of 44 places in 170 ms
[2020-06-03 05:44:15] [INFO ] Deduced a trap composed of 40 places in 224 ms
[2020-06-03 05:44:16] [INFO ] Deduced a trap composed of 48 places in 363 ms
[2020-06-03 05:44:16] [INFO ] Deduced a trap composed of 19 places in 279 ms
[2020-06-03 05:44:16] [INFO ] Deduced a trap composed of 22 places in 248 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 49 places in 139 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 37 places in 197 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 20 places in 216 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2020-06-03 05:44:18] [INFO ] Deduced a trap composed of 41 places in 226 ms
[2020-06-03 05:44:18] [INFO ] Deduced a trap composed of 32 places in 822 ms
[2020-06-03 05:44:19] [INFO ] Deduced a trap composed of 34 places in 837 ms
[2020-06-03 05:44:20] [INFO ] Deduced a trap composed of 17 places in 515 ms
[2020-06-03 05:44:21] [INFO ] Deduced a trap composed of 14 places in 1217 ms
[2020-06-03 05:44:21] [INFO ] Deduced a trap composed of 41 places in 136 ms
[2020-06-03 05:44:22] [INFO ] Deduced a trap composed of 42 places in 203 ms
[2020-06-03 05:44:22] [INFO ] Deduced a trap composed of 8 places in 193 ms
[2020-06-03 05:44:23] [INFO ] Deduced a trap composed of 35 places in 922 ms
[2020-06-03 05:44:24] [INFO ] Deduced a trap composed of 31 places in 252 ms
[2020-06-03 05:44:24] [INFO ] Deduced a trap composed of 35 places in 384 ms
[2020-06-03 05:44:25] [INFO ] Deduced a trap composed of 44 places in 1383 ms
[2020-06-03 05:44:26] [INFO ] Deduced a trap composed of 34 places in 255 ms
[2020-06-03 05:44:26] [INFO ] Deduced a trap composed of 24 places in 124 ms
[2020-06-03 05:44:27] [INFO ] Deduced a trap composed of 16 places in 842 ms
[2020-06-03 05:44:27] [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 s17 s25 s27 s28 s29 s45 s48 s65 s68 s88 s125 s137 s138 s139 s140) 0)") while checking expression at index 0
Support contains 35 out of 189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 189/189 places, 399/399 transitions.
Applied a total of 0 rules in 46 ms. Remains 189 /189 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 399/399 transitions.
Starting structural reductions, iteration 0 : 189/189 places, 399/399 transitions.
Applied a total of 0 rules in 33 ms. Remains 189 /189 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2020-06-03 05:44:27] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-06-03 05:44:27] [INFO ] Computed 19 place invariants in 12 ms
[2020-06-03 05:44:28] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2020-06-03 05:44:28] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-06-03 05:44:28] [INFO ] Computed 19 place invariants in 3 ms
[2020-06-03 05:44:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:44:31] [INFO ] Implicit Places using invariants and state equation in 2605 ms returned []
Implicit Place search using SMT with State Equation took 3726 ms to find 0 implicit places.
[2020-06-03 05:44:31] [INFO ] Redundant transitions in 31 ms returned []
[2020-06-03 05:44:31] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-06-03 05:44:31] [INFO ] Computed 19 place invariants in 3 ms
[2020-06-03 05:44:31] [INFO ] Dead Transitions using invariants and state equation in 802 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 399/399 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 234 ms. (steps per millisecond=427 ) properties seen :[0]
[2020-06-03 05:44:32] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-06-03 05:44:32] [INFO ] Computed 19 place invariants in 6 ms
[2020-06-03 05:44:32] [INFO ] [Real]Absence check using 14 positive place invariants in 34 ms returned sat
[2020-06-03 05:44:32] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2020-06-03 05:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:44:33] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-06-03 05:44:33] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:44:33] [INFO ] [Real]Added 132 Read/Feed constraints in 31 ms returned sat
[2020-06-03 05:44:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:44:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 83 ms returned sat
[2020-06-03 05:44:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2020-06-03 05:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:44:33] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-06-03 05:44:33] [INFO ] [Nat]Added 132 Read/Feed constraints in 41 ms returned sat
[2020-06-03 05:44:34] [INFO ] Deduced a trap composed of 10 places in 900 ms
[2020-06-03 05:44:35] [INFO ] Deduced a trap composed of 10 places in 1031 ms
[2020-06-03 05:44:37] [INFO ] Deduced a trap composed of 21 places in 1526 ms
[2020-06-03 05:44:38] [INFO ] Deduced a trap composed of 24 places in 1678 ms
[2020-06-03 05:44:39] [INFO ] Deduced a trap composed of 8 places in 721 ms
[2020-06-03 05:44:41] [INFO ] Deduced a trap composed of 9 places in 1623 ms
[2020-06-03 05:44:43] [INFO ] Deduced a trap composed of 11 places in 1856 ms
[2020-06-03 05:44:43] [INFO ] Deduced a trap composed of 17 places in 781 ms
[2020-06-03 05:44:44] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-06-03 05:44:44] [INFO ] Deduced a trap composed of 22 places in 813 ms
[2020-06-03 05:44:45] [INFO ] Deduced a trap composed of 27 places in 410 ms
[2020-06-03 05:44:46] [INFO ] Deduced a trap composed of 22 places in 761 ms
[2020-06-03 05:44:47] [INFO ] Deduced a trap composed of 15 places in 1568 ms
[2020-06-03 05:44:48] [INFO ] Deduced a trap composed of 16 places in 961 ms
[2020-06-03 05:44:49] [INFO ] Deduced a trap composed of 15 places in 522 ms
[2020-06-03 05:44:49] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2020-06-03 05:44:49] [INFO ] Deduced a trap composed of 24 places in 244 ms
[2020-06-03 05:44:49] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-06-03 05:44:50] [INFO ] Deduced a trap composed of 29 places in 904 ms
[2020-06-03 05:44:51] [INFO ] Deduced a trap composed of 16 places in 323 ms
[2020-06-03 05:44:51] [INFO ] Deduced a trap composed of 24 places in 285 ms
[2020-06-03 05:44:51] [INFO ] Deduced a trap composed of 35 places in 125 ms
[2020-06-03 05:44:51] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-06-03 05:44:51] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2020-06-03 05:44:52] [INFO ] Deduced a trap composed of 52 places in 1038 ms
[2020-06-03 05:44:53] [INFO ] Deduced a trap composed of 52 places in 153 ms
[2020-06-03 05:44:53] [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 s5 s15 s16 s35 s36 s37 s39 s40 s41 s42 s44 s45 s46 s55 s60 s61 s62 s64 s65 s66 s75 s80 s81 s82 s84 s85 s86 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132) 0)") while checking expression at index 0
Graph (trivial) has 244 edges and 189 vertex of which 100 / 189 are part of one of the 20 SCC in 26 ms
Free SCC test removed 80 places
Drop transitions removed 160 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 0 with 220 rules applied. Total rules applied 221 place count 109 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 227 place count 106 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 228 place count 106 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 229 place count 105 transition count 187
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 232 place count 105 transition count 187
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 105 transition count 187
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 256 place count 105 transition count 168
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 269 place count 105 transition count 168
Applied a total of 269 rules in 106 ms. Remains 105 /189 variables (removed 84) and now considering 168/399 (removed 231) transitions.
// Phase 1: matrix 168 rows 105 cols
[2020-06-03 05:44:53] [INFO ] Computed 19 place invariants in 1 ms
[2020-06-03 05:44:53] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-06-03 05:44:53] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 16 ms returned sat
[2020-06-03 05:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:44:53] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-03 05:44:53] [INFO ] Computed and/alt/rep : 158/689/158 causal constraints in 9 ms.
[2020-06-03 05:44:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:44:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2020-06-03 05:44:53] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-06-03 05:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:44:53] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 05:44:53] [INFO ] Computed and/alt/rep : 158/689/158 causal constraints in 19 ms.
[2020-06-03 05:44:54] [INFO ] Added : 152 causal constraints over 31 iterations in 984 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 05:44:54] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2020-06-03 05:44:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
[2020-06-03 05:44:55] [INFO ] Flatten gal took : 358 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Peterson-COL-4 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ Peterson-COL-4
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:44:56 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 25280,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 35,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p13))) AND ((1 <= p148) OR (1 <= p173) OR (1 <= p120) OR (1 <= p144) OR (1 <= p183) OR (1 <= p128) OR (1 <= p152) OR (1 <= p124) OR (1 <= p178) OR (1 <= p136) OR (1 <= p108) OR (1 <= p160) OR (1 <= p132) OR (1 <= p188) OR (1 <= p156) OR (1 <= p116) OR (1 <= p168) OR (1 <= p140) OR (1 <= p164) OR (1 <= p112)) AND ((1 <= p83) OR (1 <= p99) OR (1 <= p87) OR (1 <= p91) OR (1 <= p95)))))",
"processed_size": 558,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1538,
"conflict_clusters": 38,
"places": 189,
"places_significant": 170,
"singleton_clusters": 0,
"transitions": 399
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2000,
"problems": 500
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 588/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 189
lola: finding significant places
lola: 189 places, 399 transitions, 170 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p13))) AND ((1 <= p148) OR (1 <= p173) OR (1 <= p120) OR (1 <= p144) OR (1 <= p183) OR (1 <= p128) OR (1 <= p152) OR (1 <= p124) OR (1 <= p178) OR (1 <= p136) OR (1 <= p108) OR (1 <= p160) OR (1 <= p132) OR (1 <= p188) OR (1 <= p156) OR (1 <= p116) OR (1 <= p168) OR (1 <= p140) OR (1 <= p164) OR (1 <= p112)) AND ((1 <= p83) OR (1 <= p99) OR (1 <= p87) OR (1 <= p91) OR (1 <= p95)))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p13))) AND ((1 <= p148) OR (1 <= p173) OR (1 <= p120) OR (1 <= p144) OR (1 <= p183) OR (1 <= p128) OR (1 <= p152) OR (1 <= p124) OR (1 <= p178) OR (1 <= p136) OR (1 <= p108) OR (1 <= p160) OR (1 <= p132) OR (1 <= p188) OR (1 <= p156) OR... (shortened)
lola: processed formula length: 558
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p3) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p1) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p13))) AND ((1 <= p148) OR (1 <= p173) OR (1 <= p120) OR (1 <= p144) OR (1 <= p183) OR (1 <= p128) OR (1 <= p152) OR (1 <= p124) OR (1 <= p178) OR (1 <= p136) OR (1 <= p108) OR (1 <= p160) OR (1 <= p132) OR (1 <= p188) OR (1 <= p156) OR (1 <= p116) OR (1 <= p168) OR (1 <= p140) OR (1 <= p164) OR (1 <= p112)) AND ((1 <= p83) OR (1 <= p99) OR (1 <= p87) OR (1 <= p91) OR (1 <= p95)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2000 literals and 500 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 25280 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
sara: try reading problem file ReachabilityFireability-0.sara.
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-4"
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 Peterson-COL-4, 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 r174-csrt-158987853600679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 '
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 ;