Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100071.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is DES-PT-50b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 127K May 5 16:51 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-50b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620513589934

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 22:39:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 22:39:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 22:39:51] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2021-05-08 22:39:51] [INFO ] Transformed 479 places.
[2021-05-08 22:39:51] [INFO ] Transformed 430 transitions.
[2021-05-08 22:39:51] [INFO ] Found NUPN structural information;
[2021-05-08 22:39:51] [INFO ] Parsed PT model containing 479 places and 430 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 90 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0]
FORMULA DES-PT-50b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA DES-PT-50b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 430 rows 479 cols
[2021-05-08 22:39:51] [INFO ] Computed 65 place invariants in 35 ms
[2021-05-08 22:39:52] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2021-05-08 22:39:52] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:52] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2021-05-08 22:39:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 47 ms returned unsat
[2021-05-08 22:39:53] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2021-05-08 22:39:53] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 27 ms returned sat
[2021-05-08 22:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:53] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2021-05-08 22:39:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 90 ms returned sat
[2021-05-08 22:39:54] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 43 ms returned sat
[2021-05-08 22:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:54] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2021-05-08 22:39:55] [INFO ] Deduced a trap composed of 12 places in 186 ms
[2021-05-08 22:39:55] [INFO ] Deduced a trap composed of 41 places in 141 ms
[2021-05-08 22:39:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2021-05-08 22:39:55] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 35 ms.
[2021-05-08 22:39:57] [INFO ] Added : 294 causal constraints over 60 iterations in 2610 ms. Result :sat
[2021-05-08 22:39:58] [INFO ] Deduced a trap composed of 42 places in 148 ms
[2021-05-08 22:39:58] [INFO ] Deduced a trap composed of 55 places in 155 ms
[2021-05-08 22:39:58] [INFO ] Deduced a trap composed of 30 places in 144 ms
[2021-05-08 22:39:58] [INFO ] Deduced a trap composed of 54 places in 150 ms
[2021-05-08 22:39:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 777 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 22:39:58] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned sat
[2021-05-08 22:39:58] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:39:59] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2021-05-08 22:39:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:39:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2021-05-08 22:39:59] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 22:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:00] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2021-05-08 22:40:00] [INFO ] Deduced a trap composed of 21 places in 114 ms
[2021-05-08 22:40:00] [INFO ] Deduced a trap composed of 20 places in 122 ms
[2021-05-08 22:40:00] [INFO ] Deduced a trap composed of 30 places in 113 ms
[2021-05-08 22:40:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2021-05-08 22:40:00] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 29 ms.
[2021-05-08 22:40:04] [INFO ] Added : 370 causal constraints over 74 iterations in 3444 ms. Result :unsat
[2021-05-08 22:40:04] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2021-05-08 22:40:04] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 22:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:05] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2021-05-08 22:40:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 85 ms returned sat
[2021-05-08 22:40:05] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 72 ms returned sat
[2021-05-08 22:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:06] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2021-05-08 22:40:06] [INFO ] Deduced a trap composed of 12 places in 117 ms
[2021-05-08 22:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2021-05-08 22:40:06] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 25 ms.
[2021-05-08 22:40:08] [INFO ] Added : 288 causal constraints over 58 iterations in 2461 ms. Result :sat
[2021-05-08 22:40:08] [INFO ] Deduced a trap composed of 55 places in 148 ms
[2021-05-08 22:40:09] [INFO ] Deduced a trap composed of 67 places in 126 ms
[2021-05-08 22:40:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2021-05-08 22:40:09] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2021-05-08 22:40:09] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 22:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:09] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2021-05-08 22:40:10] [INFO ] Deduced a trap composed of 12 places in 155 ms
[2021-05-08 22:40:10] [INFO ] Deduced a trap composed of 24 places in 134 ms
[2021-05-08 22:40:10] [INFO ] Deduced a trap composed of 8 places in 157 ms
[2021-05-08 22:40:10] [INFO ] Deduced a trap composed of 36 places in 139 ms
[2021-05-08 22:40:10] [INFO ] Deduced a trap composed of 42 places in 136 ms
[2021-05-08 22:40:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 820 ms
[2021-05-08 22:40:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 86 ms returned sat
[2021-05-08 22:40:10] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 22:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:11] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2021-05-08 22:40:11] [INFO ] Deduced a trap composed of 12 places in 147 ms
[2021-05-08 22:40:11] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2021-05-08 22:40:12] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2021-05-08 22:40:12] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2021-05-08 22:40:12] [INFO ] Deduced a trap composed of 58 places in 141 ms
[2021-05-08 22:40:12] [INFO ] Deduced a trap composed of 36 places in 133 ms
[2021-05-08 22:40:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 950 ms
[2021-05-08 22:40:12] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 21 ms.
[2021-05-08 22:40:14] [INFO ] Added : 332 causal constraints over 68 iterations in 2503 ms. Result :sat
[2021-05-08 22:40:15] [INFO ] Deduced a trap composed of 43 places in 106 ms
[2021-05-08 22:40:15] [INFO ] Deduced a trap composed of 52 places in 103 ms
[2021-05-08 22:40:15] [INFO ] Deduced a trap composed of 46 places in 114 ms
[2021-05-08 22:40:15] [INFO ] Deduced a trap composed of 51 places in 104 ms
[2021-05-08 22:40:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 643 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
FORMULA DES-PT-50b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 519100 steps, including 5505 resets, run finished after 1455 ms. (steps per millisecond=356 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 297500 steps, including 3271 resets, run finished after 790 ms. (steps per millisecond=376 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 270800 steps, including 2848 resets, run finished after 744 ms. (steps per millisecond=363 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.14 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 468 transition count 402
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 447 transition count 402
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 447 transition count 393
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 438 transition count 393
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 438 transition count 393
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 120 place count 419 transition count 374
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 419 transition count 373
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 418 transition count 373
Symmetric choice reduction at 2 with 15 rule applications. Total rules 137 place count 418 transition count 373
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 167 place count 403 transition count 358
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 182 place count 403 transition count 343
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 185 place count 401 transition count 342
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 185 place count 401 transition count 339
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 398 transition count 339
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 335 place count 326 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 339 place count 324 transition count 269
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 324 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 323 transition count 268
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 323 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 343 place count 322 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 321 transition count 267
Applied a total of 344 rules in 226 ms. Remains 321 /479 variables (removed 158) and now considering 267/430 (removed 163) transitions.
Finished structural reductions, in 1 iterations. Remains : 321/479 places, 267/430 transitions.
Incomplete random walk after 1000000 steps, including 39465 resets, run finished after 3156 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6558 resets, run finished after 1185 ms. (steps per millisecond=843 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7538 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6862 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 14856364 steps, run timeout after 30001 ms. (steps per millisecond=495 ) properties seen :[0, 0, 0]
Probabilistic random walk after 14856364 steps, saw 1889702 distinct states, run finished after 30001 ms. (steps per millisecond=495 ) properties seen :[0, 0, 0]
// Phase 1: matrix 267 rows 321 cols
[2021-05-08 22:40:55] [INFO ] Computed 60 place invariants in 7 ms
[2021-05-08 22:40:55] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:40:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:55] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2021-05-08 22:40:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:40:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2021-05-08 22:40:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:56] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2021-05-08 22:40:56] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 13 ms.
[2021-05-08 22:40:57] [INFO ] Added : 132 causal constraints over 27 iterations in 1033 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-08 22:40:57] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:40:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:58] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-08 22:40:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:40:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 22:40:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2021-05-08 22:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:40:58] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2021-05-08 22:40:58] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2021-05-08 22:40:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-08 22:40:58] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 16 ms.
[2021-05-08 22:41:00] [INFO ] Added : 171 causal constraints over 35 iterations in 1343 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2021-05-08 22:41:00] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 22:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:00] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-08 22:41:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2021-05-08 22:41:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2021-05-08 22:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:01] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2021-05-08 22:41:01] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-08 22:41:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-08 22:41:01] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 13 ms.
[2021-05-08 22:41:02] [INFO ] Added : 211 causal constraints over 43 iterations in 1049 ms. Result :sat
[2021-05-08 22:41:02] [INFO ] Deduced a trap composed of 66 places in 118 ms
[2021-05-08 22:41:02] [INFO ] Deduced a trap composed of 50 places in 67 ms
[2021-05-08 22:41:02] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2021-05-08 22:41:02] [INFO ] Deduced a trap composed of 10 places in 73 ms
[2021-05-08 22:41:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 481 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 225900 steps, including 13241 resets, run finished after 761 ms. (steps per millisecond=296 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 188100 steps, including 10944 resets, run finished after 626 ms. (steps per millisecond=300 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 86000 steps, including 5022 resets, run finished after 283 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 321/321 places, 267/267 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 267/267 transitions.
Starting structural reductions, iteration 0 : 321/321 places, 267/267 transitions.
Applied a total of 0 rules in 19 ms. Remains 321 /321 variables (removed 0) and now considering 267/267 (removed 0) transitions.
// Phase 1: matrix 267 rows 321 cols
[2021-05-08 22:41:04] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:41:05] [INFO ] Implicit Places using invariants in 786 ms returned []
// Phase 1: matrix 267 rows 321 cols
[2021-05-08 22:41:05] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:41:07] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
[2021-05-08 22:41:07] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 267 rows 321 cols
[2021-05-08 22:41:07] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:41:07] [INFO ] Dead Transitions using invariants and state equation in 551 ms returned []
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 267/267 transitions.
Incomplete random walk after 100000 steps, including 3985 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0]
// Phase 1: matrix 267 rows 321 cols
[2021-05-08 22:41:08] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 22:41:08] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:08] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2021-05-08 22:41:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2021-05-08 22:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:09] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2021-05-08 22:41:09] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 14 ms.
[2021-05-08 22:41:10] [INFO ] Added : 132 causal constraints over 27 iterations in 991 ms. Result :sat
[2021-05-08 22:41:10] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 22:41:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:10] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-08 22:41:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 22:41:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2021-05-08 22:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:11] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2021-05-08 22:41:11] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2021-05-08 22:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-08 22:41:11] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 14 ms.
[2021-05-08 22:41:12] [INFO ] Added : 171 causal constraints over 35 iterations in 1357 ms. Result :sat
[2021-05-08 22:41:12] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 22:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:13] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2021-05-08 22:41:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2021-05-08 22:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:14] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2021-05-08 22:41:14] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2021-05-08 22:41:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-08 22:41:14] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 12 ms.
[2021-05-08 22:41:15] [INFO ] Added : 211 causal constraints over 43 iterations in 1010 ms. Result :sat
[2021-05-08 22:41:15] [INFO ] Deduced a trap composed of 66 places in 107 ms
[2021-05-08 22:41:15] [INFO ] Deduced a trap composed of 50 places in 62 ms
[2021-05-08 22:41:15] [INFO ] Deduced a trap composed of 18 places in 82 ms
[2021-05-08 22:41:15] [INFO ] Deduced a trap composed of 10 places in 73 ms
[2021-05-08 22:41:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 321 transition count 267
Applied a total of 1 rules in 23 ms. Remains 321 /321 variables (removed 0) and now considering 267/267 (removed 0) transitions.
// Phase 1: matrix 267 rows 321 cols
[2021-05-08 22:41:15] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 22:41:15] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 22:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:16] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2021-05-08 22:41:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 22:41:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2021-05-08 22:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:16] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2021-05-08 22:41:16] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 13 ms.
[2021-05-08 22:41:17] [INFO ] Added : 134 causal constraints over 27 iterations in 869 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-08 22:41:17] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 22:41:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 22:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:18] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2021-05-08 22:41:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-08 22:41:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2021-05-08 22:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:18] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2021-05-08 22:41:18] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-08 22:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-08 22:41:18] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 12 ms.
[2021-05-08 22:41:19] [INFO ] Added : 171 causal constraints over 35 iterations in 951 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 22:41:19] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 22:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:20] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-08 22:41:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 22:41:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 22:41:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2021-05-08 22:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 22:41:21] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2021-05-08 22:41:21] [INFO ] Computed and/alt/rep : 263/1044/263 causal constraints in 13 ms.
[2021-05-08 22:41:22] [INFO ] Added : 210 causal constraints over 42 iterations in 1046 ms. Result :sat
[2021-05-08 22:41:22] [INFO ] Deduced a trap composed of 56 places in 39 ms
[2021-05-08 22:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 22:41:22] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2021-05-08 22:41:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-08 22:41:22] [INFO ] Flatten gal took : 74 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-50b @ 3570 seconds

FORMULA DES-PT-50b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3556
rslt: Output for ReachabilityCardinality @ DES-PT-50b

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 22:41:23 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p170))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 339172,
"markings": 296350,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 <= p79)) AND ((p235 <= 0)))))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"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": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p242 <= 0)) OR ((1 <= p266)) OR ((p132 <= 0)) OR ((1 <= p42)) OR ((p82 <= 0)) OR ((1 <= p177)))))",
"processed_size": 111,
"rewrites": 2
},
"result":
{
"edges": 2898610,
"markings": 2585872,
"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": 6,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 20836,
"runtime": 14.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1299,
"conflict_clusters": 52,
"places": 321,
"places_significant": 261,
"singleton_clusters": 0,
"transitions": 267
},
"result":
{
"preliminary_value": "no yes yes ",
"value": "no yes 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: 588/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 321
lola: finding significant places
lola: 321 places, 267 transitions, 261 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: A (G ((((p242 <= 0)) OR ((1 <= p266)) OR ((p132 <= 0)) OR ((1 <= p42)) OR ((p82 <= 0)) OR ((1 <= p177))))) : E (F ((((1 <= p79)) AND ((p235 <= 0))))) : E (F (((1 <= p170))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p170))))
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 <= p170))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p170))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 296350 markings, 339172 edges
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p79)) AND ((p235 <= 0)))))
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 <= p79)) AND ((p235 <= 0)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p79)) AND ((p235 <= 0)))
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 ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p242 <= 0)) OR ((1 <= p266)) OR ((p132 <= 0)) OR ((1 <= p42)) OR ((p82 <= 0)) OR ((1 <= p177)))))
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 ((((p242 <= 0)) OR ((1 <= p266)) OR ((p132 <= 0)) OR ((1 <= p42)) OR ((p82 <= 0)) OR ((1 <= p177)))))
lola: processed formula length: 111
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p242)) AND ((p266 <= 0)) AND ((1 <= p132)) AND ((p42 <= 0)) AND ((1 <= p82)) AND ((p177 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1483806 markings, 1655978 edges, 296761 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2585872 markings, 2898610 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes
lola:
preliminary result: no yes yes
lola: memory consumption: 20836 KB
lola: time consumption: 14 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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-50b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is DES-PT-50b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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