Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900100335.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-60b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900100335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 139K Mar 24 05:37 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 DES-PT-60b-ReachabilityFireability-00
FORMULA_NAME DES-PT-60b-ReachabilityFireability-01
FORMULA_NAME DES-PT-60b-ReachabilityFireability-02
FORMULA_NAME DES-PT-60b-ReachabilityFireability-03
FORMULA_NAME DES-PT-60b-ReachabilityFireability-04
FORMULA_NAME DES-PT-60b-ReachabilityFireability-05
FORMULA_NAME DES-PT-60b-ReachabilityFireability-06
FORMULA_NAME DES-PT-60b-ReachabilityFireability-07
FORMULA_NAME DES-PT-60b-ReachabilityFireability-08
FORMULA_NAME DES-PT-60b-ReachabilityFireability-09
FORMULA_NAME DES-PT-60b-ReachabilityFireability-10
FORMULA_NAME DES-PT-60b-ReachabilityFireability-11
FORMULA_NAME DES-PT-60b-ReachabilityFireability-12
FORMULA_NAME DES-PT-60b-ReachabilityFireability-13
FORMULA_NAME DES-PT-60b-ReachabilityFireability-14
FORMULA_NAME DES-PT-60b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591203302774

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:55:05] [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 16:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:55:06] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2020-06-03 16:55:06] [INFO ] Transformed 519 places.
[2020-06-03 16:55:06] [INFO ] Transformed 470 transitions.
[2020-06-03 16:55:06] [INFO ] Found NUPN structural information;
[2020-06-03 16:55:06] [INFO ] Parsed PT model containing 519 places and 470 transitions in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 73 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 125 ms. (steps per millisecond=80 ) properties seen :[0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0]
FORMULA DES-PT-60b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 470 rows 519 cols
[2020-06-03 16:55:06] [INFO ] Computed 65 place invariants in 71 ms
[2020-06-03 16:55:07] [INFO ] [Real]Absence check using 39 positive place invariants in 79 ms returned unsat
[2020-06-03 16:55:07] [INFO ] [Real]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-06-03 16:55:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 16:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:08] [INFO ] [Real]Absence check using state equation in 1451 ms returned sat
[2020-06-03 16:55:09] [INFO ] Deduced a trap composed of 8 places in 356 ms
[2020-06-03 16:55:09] [INFO ] Deduced a trap composed of 21 places in 191 ms
[2020-06-03 16:55:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 715 ms
[2020-06-03 16:55:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 84 ms returned sat
[2020-06-03 16:55:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 92 ms returned sat
[2020-06-03 16:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:11] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2020-06-03 16:55:12] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2020-06-03 16:55:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2020-06-03 16:55:12] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 58 ms.
[2020-06-03 16:55:14] [INFO ] Added : 80 causal constraints over 16 iterations in 2423 ms. Result :(error "Failed to check-sat")
[2020-06-03 16:55:14] [INFO ] [Real]Absence check using 39 positive place invariants in 68 ms returned sat
[2020-06-03 16:55:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:16] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2020-06-03 16:55:16] [INFO ] Deduced a trap composed of 27 places in 340 ms
[2020-06-03 16:55:17] [INFO ] Deduced a trap composed of 12 places in 384 ms
[2020-06-03 16:55:17] [INFO ] Deduced a trap composed of 55 places in 287 ms
[2020-06-03 16:55:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1192 ms
[2020-06-03 16:55:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:55:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 80 ms returned sat
[2020-06-03 16:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:19] [INFO ] [Nat]Absence check using state equation in 1840 ms returned sat
[2020-06-03 16:55:20] [INFO ] Deduced a trap composed of 33 places in 373 ms
[2020-06-03 16:55:20] [INFO ] Deduced a trap composed of 12 places in 158 ms
[2020-06-03 16:55:20] [INFO ] Deduced a trap composed of 42 places in 163 ms
[2020-06-03 16:55:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 870 ms
[2020-06-03 16:55:20] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 51 ms.
[2020-06-03 16:55:22] [INFO ] Added : 80 causal constraints over 16 iterations in 2062 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 16:55:22] [INFO ] [Real]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 16:55:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 136 ms returned sat
[2020-06-03 16:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:55:27] [INFO ] [Real]Absence check using state equation in 4697 ms returned unknown
[2020-06-03 16:55:27] [INFO ] [Real]Absence check using 39 positive place invariants in 34 ms returned unsat
[2020-06-03 16:55:28] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 16:55:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 72 ms returned sat
[2020-06-03 16:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:30] [INFO ] [Real]Absence check using state equation in 2583 ms returned sat
[2020-06-03 16:55:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 92 ms returned sat
[2020-06-03 16:55:31] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 168 ms returned sat
[2020-06-03 16:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:33] [INFO ] [Nat]Absence check using state equation in 2215 ms returned sat
[2020-06-03 16:55:33] [INFO ] Deduced a trap composed of 44 places in 352 ms
[2020-06-03 16:55:34] [INFO ] Deduced a trap composed of 8 places in 352 ms
[2020-06-03 16:55:34] [INFO ] Deduced a trap composed of 29 places in 205 ms
[2020-06-03 16:55:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1129 ms
[2020-06-03 16:55:34] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 54 ms.
[2020-06-03 16:55:35] [INFO ] Added : 15 causal constraints over 3 iterations in 1275 ms. Result :(error "Failed to check-sat")
[2020-06-03 16:55:35] [INFO ] [Real]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 16:55:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 62 ms returned sat
[2020-06-03 16:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:37] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2020-06-03 16:55:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 78 ms returned sat
[2020-06-03 16:55:37] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 112 ms returned sat
[2020-06-03 16:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:41] [INFO ] [Nat]Absence check using state equation in 3382 ms returned sat
[2020-06-03 16:55:41] [INFO ] Deduced a trap composed of 12 places in 316 ms
[2020-06-03 16:55:41] [INFO ] Deduced a trap composed of 14 places in 198 ms
[2020-06-03 16:55:42] [INFO ] Deduced a trap composed of 40 places in 271 ms
[2020-06-03 16:55:42] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2020-06-03 16:55:42] [INFO ] Deduced a trap composed of 18 places in 167 ms
[2020-06-03 16:55: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 (> (+ s0 s248 s366 s367 s375 s376 s377 s385 s386 s387 s388 s391 s392 s393 s405 s432 s433 s434) 0)") while checking expression at index 6
[2020-06-03 16:55:42] [INFO ] [Real]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:55:42] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 16:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:45] [INFO ] [Real]Absence check using state equation in 2558 ms returned sat
[2020-06-03 16:55:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 92 ms returned sat
[2020-06-03 16:55:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 166 ms returned sat
[2020-06-03 16:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:55:50] [INFO ] [Nat]Absence check using state equation in 4631 ms returned (error "Failed to check-sat")
FORMULA DES-PT-60b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-60b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 34 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 1218 edges and 519 vertex of which 514 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.24 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 514 transition count 450
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 497 transition count 450
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 36 place count 497 transition count 442
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 489 transition count 442
Symmetric choice reduction at 2 with 17 rule applications. Total rules 69 place count 489 transition count 442
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 103 place count 472 transition count 425
Symmetric choice reduction at 2 with 9 rule applications. Total rules 112 place count 472 transition count 425
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 130 place count 463 transition count 416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 463 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 463 transition count 407
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 462 transition count 407
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 262 place count 401 transition count 346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 399 transition count 348
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 270 place count 399 transition count 344
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 274 place count 395 transition count 344
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 395 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 394 transition count 343
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 280 place count 394 transition count 343
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 393 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 392 transition count 342
Applied a total of 282 rules in 533 ms. Remains 392 /519 variables (removed 127) and now considering 342/470 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 392/519 places, 342/470 transitions.
Incomplete random walk after 1000000 steps, including 25612 resets, run finished after 4424 ms. (steps per millisecond=226 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA DES-PT-60b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4536 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4676 resets, run finished after 2482 ms. (steps per millisecond=402 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3968 resets, run finished after 2326 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4607 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4519 resets, run finished after 2229 ms. (steps per millisecond=448 ) properties seen :[0, 0, 0, 0, 1]
FORMULA DES-PT-60b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 342 rows 392 cols
[2020-06-03 16:56:06] [INFO ] Computed 62 place invariants in 53 ms
[2020-06-03 16:56:06] [INFO ] [Real]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-06-03 16:56:06] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 64 ms returned sat
[2020-06-03 16:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:07] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2020-06-03 16:56:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 49 ms returned sat
[2020-06-03 16:56:07] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 137 ms returned sat
[2020-06-03 16:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:09] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2020-06-03 16:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 16:56:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 16:56:09] [INFO ] Deduced a trap composed of 5 places in 242 ms
[2020-06-03 16:56:09] [INFO ] Deduced a trap composed of 20 places in 198 ms
[2020-06-03 16:56:09] [INFO ] Deduced a trap composed of 20 places in 177 ms
[2020-06-03 16:56:10] [INFO ] Deduced a trap composed of 19 places in 123 ms
[2020-06-03 16:56:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 980 ms
[2020-06-03 16:56:10] [INFO ] Computed and/alt/rep : 338/1137/338 causal constraints in 39 ms.
[2020-06-03 16:56:15] [INFO ] Added : 289 causal constraints over 58 iterations in 5583 ms. Result :sat
[2020-06-03 16:56:15] [INFO ] Deduced a trap composed of 13 places in 164 ms
[2020-06-03 16:56:16] [INFO ] Deduced a trap composed of 18 places in 155 ms
[2020-06-03 16:56:16] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-06-03 16:56:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 627 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:56:16] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 16:56:16] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 90 ms returned sat
[2020-06-03 16:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:17] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2020-06-03 16:56:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 16:56:18] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 158 ms returned sat
[2020-06-03 16:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:19] [INFO ] [Nat]Absence check using state equation in 1554 ms returned sat
[2020-06-03 16:56:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 16:56:19] [INFO ] Computed and/alt/rep : 338/1137/338 causal constraints in 58 ms.
[2020-06-03 16:56:25] [INFO ] Added : 294 causal constraints over 59 iterations in 5552 ms. Result :sat
[2020-06-03 16:56:25] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-06-03 16:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 16:56:25] [INFO ] [Real]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-06-03 16:56:25] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 84 ms returned sat
[2020-06-03 16:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:27] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2020-06-03 16:56:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 16:56:27] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 93 ms returned sat
[2020-06-03 16:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:28] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2020-06-03 16:56:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2020-06-03 16:56:28] [INFO ] Computed and/alt/rep : 338/1137/338 causal constraints in 46 ms.
[2020-06-03 16:56:32] [INFO ] Added : 207 causal constraints over 42 iterations in 4051 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 16:56:33] [INFO ] [Real]Absence check using 34 positive place invariants in 56 ms returned sat
[2020-06-03 16:56:33] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 69 ms returned sat
[2020-06-03 16:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:34] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2020-06-03 16:56:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 52 ms returned sat
[2020-06-03 16:56:34] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 152 ms returned sat
[2020-06-03 16:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:35] [INFO ] [Nat]Absence check using state equation in 1064 ms returned sat
[2020-06-03 16:56:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 16:56:35] [INFO ] Computed and/alt/rep : 338/1137/338 causal constraints in 36 ms.
[2020-06-03 16:56:38] [INFO ] Added : 138 causal constraints over 28 iterations in 3048 ms. Result :sat
[2020-06-03 16:56:38] [INFO ] Deduced a trap composed of 12 places in 135 ms
[2020-06-03 16:56:38] [INFO ] Deduced a trap composed of 18 places in 163 ms
[2020-06-03 16:56:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
Incomplete Parikh walk after 87700 steps, including 2667 resets, run finished after 489 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 335000 steps, including 10590 resets, run finished after 1570 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 405400 steps, including 12907 resets, run finished after 1856 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 398100 steps, including 12729 resets, run finished after 1871 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 392 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 392/392 places, 342/342 transitions.
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 1204 edges and 392 vertex of which 390 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 390 transition count 339
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 389 transition count 339
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 389 transition count 339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 388 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 388 transition count 337
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 388 transition count 336
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 387 transition count 336
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 23 place count 380 transition count 329
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 380 transition count 328
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 379 transition count 325
Applied a total of 28 rules in 210 ms. Remains 379 /392 variables (removed 13) and now considering 325/342 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 379/392 places, 325/342 transitions.
Incomplete random walk after 1000000 steps, including 29868 resets, run finished after 4387 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5392 resets, run finished after 1864 ms. (steps per millisecond=536 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5709 resets, run finished after 2459 ms. (steps per millisecond=406 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4830 resets, run finished after 2371 ms. (steps per millisecond=421 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5297 resets, run finished after 1814 ms. (steps per millisecond=551 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 7318394 steps, run timeout after 30001 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 7318394 steps, saw 949106 distinct states, run finished after 30001 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 325 rows 379 cols
[2020-06-03 16:57:27] [INFO ] Computed 62 place invariants in 20 ms
[2020-06-03 16:57:28] [INFO ] [Real]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-06-03 16:57:28] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 58 ms returned sat
[2020-06-03 16:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:29] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2020-06-03 16:57:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:57:29] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 75 ms returned sat
[2020-06-03 16:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:30] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2020-06-03 16:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 16:57:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 16:57:30] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 64 ms.
[2020-06-03 16:57:35] [INFO ] Added : 272 causal constraints over 55 iterations in 4402 ms. Result :sat
[2020-06-03 16:57:35] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-06-03 16:57:35] [INFO ] Deduced a trap composed of 21 places in 200 ms
[2020-06-03 16:57:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 16:57:35] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:57:35] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 83 ms returned sat
[2020-06-03 16:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:37] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2020-06-03 16:57:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 52 ms returned sat
[2020-06-03 16:57:37] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 164 ms returned sat
[2020-06-03 16:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:39] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2020-06-03 16:57:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 16:57:39] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 37 ms.
[2020-06-03 16:57:43] [INFO ] Added : 279 causal constraints over 56 iterations in 4798 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:57:44] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 16:57:44] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 84 ms returned sat
[2020-06-03 16:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:45] [INFO ] [Real]Absence check using state equation in 1597 ms returned sat
[2020-06-03 16:57:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:57:46] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 167 ms returned sat
[2020-06-03 16:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:47] [INFO ] [Nat]Absence check using state equation in 1304 ms returned sat
[2020-06-03 16:57:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 67 ms returned sat
[2020-06-03 16:57:47] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 30 ms.
[2020-06-03 16:57:51] [INFO ] Added : 193 causal constraints over 39 iterations in 3754 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 16:57:51] [INFO ] [Real]Absence check using 34 positive place invariants in 49 ms returned sat
[2020-06-03 16:57:51] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 60 ms returned sat
[2020-06-03 16:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:52] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2020-06-03 16:57:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:57:52] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 102 ms returned sat
[2020-06-03 16:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:53] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2020-06-03 16:57:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 16:57:54] [INFO ] Deduced a trap composed of 18 places in 220 ms
[2020-06-03 16:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2020-06-03 16:57:54] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 33 ms.
[2020-06-03 16:57:57] [INFO ] Added : 165 causal constraints over 33 iterations in 3423 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 271700 steps, including 10844 resets, run finished after 1224 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 291600 steps, including 11768 resets, run finished after 1313 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 101200 steps, including 4114 resets, run finished after 455 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 274600 steps, including 11096 resets, run finished after 1246 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 24 out of 379 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 379/379 places, 325/325 transitions.
Applied a total of 0 rules in 27 ms. Remains 379 /379 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 379/379 places, 325/325 transitions.
Starting structural reductions, iteration 0 : 379/379 places, 325/325 transitions.
Applied a total of 0 rules in 27 ms. Remains 379 /379 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 379 cols
[2020-06-03 16:58:02] [INFO ] Computed 62 place invariants in 12 ms
[2020-06-03 16:58:04] [INFO ] Implicit Places using invariants in 2121 ms returned []
// Phase 1: matrix 325 rows 379 cols
[2020-06-03 16:58:04] [INFO ] Computed 62 place invariants in 19 ms
[2020-06-03 16:58:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 16:58:10] [INFO ] Implicit Places using invariants and state equation in 6321 ms returned []
Implicit Place search using SMT with State Equation took 8446 ms to find 0 implicit places.
[2020-06-03 16:58:10] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 325 rows 379 cols
[2020-06-03 16:58:10] [INFO ] Computed 62 place invariants in 23 ms
[2020-06-03 16:58:12] [INFO ] Dead Transitions using invariants and state equation in 1781 ms returned []
Finished structural reductions, in 1 iterations. Remains : 379/379 places, 325/325 transitions.
Incomplete random walk after 100000 steps, including 3014 resets, run finished after 444 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 325 rows 379 cols
[2020-06-03 16:58:12] [INFO ] Computed 62 place invariants in 12 ms
[2020-06-03 16:58:12] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 16:58:13] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 55 ms returned sat
[2020-06-03 16:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:13] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2020-06-03 16:58:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-06-03 16:58:14] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 82 ms returned sat
[2020-06-03 16:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:15] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2020-06-03 16:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 16:58:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2020-06-03 16:58:15] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 37 ms.
[2020-06-03 16:58:19] [INFO ] Added : 272 causal constraints over 55 iterations in 4045 ms. Result :sat
[2020-06-03 16:58:19] [INFO ] Deduced a trap composed of 13 places in 169 ms
[2020-06-03 16:58:19] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-03 16:58:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
[2020-06-03 16:58:20] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:58:20] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 82 ms returned sat
[2020-06-03 16:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:21] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2020-06-03 16:58:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:58:21] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 120 ms returned sat
[2020-06-03 16:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:23] [INFO ] [Nat]Absence check using state equation in 1302 ms returned sat
[2020-06-03 16:58:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-06-03 16:58:23] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 26 ms.
[2020-06-03 16:58:28] [INFO ] Added : 279 causal constraints over 56 iterations in 4945 ms. Result :sat
[2020-06-03 16:58:28] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:58:28] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 82 ms returned sat
[2020-06-03 16:58:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:29] [INFO ] [Real]Absence check using state equation in 1547 ms returned sat
[2020-06-03 16:58:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 16:58:30] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 208 ms returned sat
[2020-06-03 16:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:31] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2020-06-03 16:58:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 66 ms returned sat
[2020-06-03 16:58:31] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 36 ms.
[2020-06-03 16:58:35] [INFO ] Added : 193 causal constraints over 39 iterations in 3832 ms. Result :sat
[2020-06-03 16:58:35] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 16:58:35] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 56 ms returned sat
[2020-06-03 16:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:36] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2020-06-03 16:58:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 49 ms returned sat
[2020-06-03 16:58:36] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 109 ms returned sat
[2020-06-03 16:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:37] [INFO ] [Nat]Absence check using state equation in 1189 ms returned sat
[2020-06-03 16:58:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 16:58:38] [INFO ] Deduced a trap composed of 18 places in 208 ms
[2020-06-03 16:58:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2020-06-03 16:58:38] [INFO ] Computed and/alt/rep : 321/1100/321 causal constraints in 43 ms.
[2020-06-03 16:58:41] [INFO ] Added : 165 causal constraints over 33 iterations in 3569 ms. Result :sat
Applied a total of 0 rules in 33 ms. Remains 379 /379 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 379 cols
[2020-06-03 16:58:41] [INFO ] Computed 62 place invariants in 18 ms
[2020-06-03 16:58:42] [INFO ] [Real]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-06-03 16:58:42] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 61 ms returned sat
[2020-06-03 16:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:43] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2020-06-03 16:58:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 16:58:43] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 75 ms returned sat
[2020-06-03 16:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:44] [INFO ] [Nat]Absence check using state equation in 1227 ms returned sat
[2020-06-03 16:58:44] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-06-03 16:58:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2020-06-03 16:58:44] [INFO ] Computed and/alt/rep : 321/1098/321 causal constraints in 39 ms.
[2020-06-03 16:58:48] [INFO ] Added : 273 causal constraints over 55 iterations in 3617 ms. Result :sat
[2020-06-03 16:58:48] [INFO ] Deduced a trap composed of 13 places in 123 ms
[2020-06-03 16:58:48] [INFO ] Deduced a trap composed of 17 places in 151 ms
[2020-06-03 16:58:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 16:58:49] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 16:58:49] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 83 ms returned sat
[2020-06-03 16:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:50] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2020-06-03 16:58:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 16:58:50] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 126 ms returned sat
[2020-06-03 16:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:52] [INFO ] [Nat]Absence check using state equation in 1399 ms returned sat
[2020-06-03 16:58:52] [INFO ] Computed and/alt/rep : 321/1098/321 causal constraints in 42 ms.
[2020-06-03 16:58:57] [INFO ] Added : 281 causal constraints over 57 iterations in 5298 ms. Result :sat
[2020-06-03 16:58:57] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-06-03 16:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 16:58:58] [INFO ] [Real]Absence check using 34 positive place invariants in 51 ms returned sat
[2020-06-03 16:58:58] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 84 ms returned sat
[2020-06-03 16:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:59] [INFO ] [Real]Absence check using state equation in 1522 ms returned sat
[2020-06-03 16:58:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 50 ms returned sat
[2020-06-03 16:59:00] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 190 ms returned sat
[2020-06-03 16:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:59:01] [INFO ] [Nat]Absence check using state equation in 1182 ms returned sat
[2020-06-03 16:59:01] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-06-03 16:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2020-06-03 16:59:01] [INFO ] Computed and/alt/rep : 321/1098/321 causal constraints in 66 ms.
[2020-06-03 16:59:04] [INFO ] Added : 185 causal constraints over 37 iterations in 3220 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 16:59:04] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-06-03 16:59:04] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 56 ms returned sat
[2020-06-03 16:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:59:05] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2020-06-03 16:59:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:59:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:59:06] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 101 ms returned sat
[2020-06-03 16:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:59:07] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2020-06-03 16:59:07] [INFO ] Deduced a trap composed of 18 places in 164 ms
[2020-06-03 16:59:07] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-06-03 16:59:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2020-06-03 16:59:07] [INFO ] Computed and/alt/rep : 321/1098/321 causal constraints in 27 ms.
[2020-06-03 16:59:11] [INFO ] Added : 166 causal constraints over 34 iterations in 3492 ms. Result :sat
[2020-06-03 16:59:11] [INFO ] Deduced a trap composed of 19 places in 129 ms
[2020-06-03 16:59:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 16:59:11] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2020-06-03 16:59:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
[2020-06-03 16:59:11] [INFO ] Flatten gal took : 150 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-60b @ 3570 seconds

FORMULA DES-PT-60b-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3466
rslt: Output for ReachabilityFireability @ DES-PT-60b

{
"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",
"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 16:59:12 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p18) AND (1 <= p284))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 9146928,
"markings": 6519571,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p54) AND (1 <= p284))))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 268524,
"markings": 183398,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1752
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((p259 <= 0) OR (p365 <= 0) OR (p45 <= 0) OR (p284 <= 0) OR ((1 <= p355) AND (((1 <= p317)) OR ((1 <= p152) AND (1 <= p281)) OR ((1 <= p27) AND (1 <= p284)))))))",
"processed_size": 173,
"rewrites": 2
},
"result":
{
"edges": 6647419,
"markings": 4902593,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 19,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p160) AND (1 <= p281) AND (1 <= p253) AND (1 <= p279) AND (1 <= p322) AND (((1 <= p369)) OR ((1 <= p250))) AND ((p1 <= 0) OR (p61 <= 0) OR (p122 <= 0) OR (p183 <= 0) OR ((1 <= p252) AND (1 <= p241) AND (1 <= p248))))))",
"processed_size": 236,
"rewrites": 1
},
"result":
{
"edges": 23989,
"markings": 17348,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 74,
"problems": 10
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28004,
"runtime": 104.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 1453,
"conflict_clusters": 61,
"places": 379,
"places_significant": 317,
"singleton_clusters": 0,
"transitions": 325
},
"result":
{
"preliminary_value": "yes yes no yes ",
"value": "yes yes no yes "
},
"task":
{
"type": "compound"
}
}
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: 704/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 379
lola: finding significant places
lola: 379 places, 325 transitions, 317 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: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p369 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p355 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: E (F (((1 <= p18) AND (1 <= p284)))) : E (F (((1 <= p160) AND (1 <= p281) AND (1 <= p253) AND (1 <= p279) AND (1 <= p322) AND (((1 <= p369)) OR ((1 <= p250))) AND ((p1 <= 0) OR (p61 <= 0) OR (p122 <= 0) OR (p183 <= 0) OR ((1 <= p252) AND (1 <= p241) AND (1 <= p248)))))) : A (G (((p259 <= 0) OR (p365 <= 0) OR (p45 <= 0) OR (p284 <= 0) OR ((1 <= p355) AND (((1 <= p317)) OR ((1 <= p152) AND (1 <= p281)) OR ((1 <= p27) AND (1 <= p284))))))) : E (F (((1 <= p54) AND (1 <= p284))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p18) AND (1 <= p284))))
lola: ========================================
lola: SUBTASK
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 <= p18) AND (1 <= p284))))
lola: processed formula length: 36
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: 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 <= p18) AND (1 <= p284))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :401: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 636421 markings, 905931 edges, 127284 markings/sec, 0 secs
lola: sara is running 5 secs || 1287721 markings, 1817196 edges, 130260 markings/sec, 5 secs
lola: sara is running 10 secs || 1938028 markings, 2731883 edges, 130061 markings/sec, 10 secs
lola: sara is running 15 secs || 2581914 markings, 3629322 edges, 128777 markings/sec, 15 secs
lola: sara is running 20 secs || 3191943 markings, 4483489 edges, 122006 markings/sec, 20 secs
lola: sara is running 25 secs || 3790684 markings, 5323839 edges, 119748 markings/sec, 25 secs
lola: sara is running 30 secs || 4384239 markings, 6154356 edges, 118711 markings/sec, 30 secs
lola: sara is running 35 secs || 4976841 markings, 6984114 edges, 118520 markings/sec, 35 secs
lola: sara is running 40 secs || 5569764 markings, 7815830 edges, 118585 markings/sec, 40 secs
lola: sara is running 45 secs || 6163946 markings, 8646270 edges, 118836 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6519571 markings, 9146928 edges
lola: ========================================
lola: subprocess 1 will run for 1168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p54) AND (1 <= p284))))
lola: ========================================
lola: SUBTASK
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 <= p54) AND (1 <= p284))))
lola: processed formula length: 36
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: 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 <= p54) AND (1 <= p284))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: error: :401: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 183398 markings, 268524 edges
lola: ========================================
lola: subprocess 2 will run for 1752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p259 <= 0) OR (p365 <= 0) OR (p45 <= 0) OR (p284 <= 0) OR ((1 <= p355) AND (((1 <= p317)) OR ((1 <= p152) AND (1 <= p281)) OR ((1 <= p27) AND (1 <= p284)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p259 <= 0) OR (p365 <= 0) OR (p45 <= 0) OR (p284 <= 0) OR ((1 <= p355) AND (((1 <= p317)) OR ((1 <= p152) AND (1 <= p281)) OR ((1 <= p27) AND (1 <= p284)))))))
lola: processed formula length: 173
lola: 2 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p259) AND (1 <= p365) AND (1 <= p45) AND (1 <= p284) AND ((p355 <= 0) OR (((p317 <= 0)) AND ((p152 <= 0) OR (p281 <= 0)) AND ((p27 <= 0) OR (p284 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 19 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: error: :401: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 630520 markings, 879608 edges, 126104 markings/sec, 0 secs
lola: sara is running 5 secs || 1275985 markings, 1757976 edges, 129093 markings/sec, 5 secs
lola: sara is running 10 secs || 1928065 markings, 2651110 edges, 130416 markings/sec, 10 secs
lola: sara is running 15 secs || 2588462 markings, 3528549 edges, 132079 markings/sec, 15 secs
lola: sara is running 20 secs || 3243207 markings, 4410634 edges, 130949 markings/sec, 20 secs
lola: sara is running 25 secs || 3896261 markings, 5297708 edges, 130611 markings/sec, 25 secs
lola: sara is running 30 secs || 4552131 markings, 6164961 edges, 131174 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4902593 markings, 6647419 edges
lola: ========================================
lola: subprocess 3 will run for 3467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p160) AND (1 <= p281) AND (1 <= p253) AND (1 <= p279) AND (1 <= p322) AND (((1 <= p369)) OR ((1 <= p250))) AND ((p1 <= 0) OR (p61 <= 0) OR (p122 <= 0) OR (p183 <= 0) OR ((1 <= p252) AND (1 <= p241) AND (1 <= p248))))))
lola: ========================================
lola: SUBTASK
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 <= p160) AND (1 <= p281) AND (1 <= p253) AND (1 <= p279) AND (1 <= p322) AND (((1 <= p369)) OR ((1 <= p250))) AND ((p1 <= 0) OR (p61 <= 0) OR (p122 <= 0) OR (p183 <= 0) OR ((1 <= p252) AND (1 <= p241) AND (1 <= p248))))))
lola: processed formula length: 236
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: 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 <= p160) AND (1 <= p281) AND (1 <= p253) AND (1 <= p279) AND (1 <= p322) AND (((1 <= p369)) OR ((1 <= p250))) AND ((p1 <= 0) OR (p61 <= 0) OR (p122 <= 0) OR (p183 <= 0) OR ((1 <= p252) AND (1 <= p241) AND (1 <= p248))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 74 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: error: :401: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17348 markings, 23989 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes
lola:
preliminary result: yes yes no yes
lola: memory consumption: 28004 KB
lola: time consumption: 104 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60b"
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 DES-PT-60b, 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 r180-ebro-158987900100335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b 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 ;