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.r178-tajo-158987882900774.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 DoubleExponent-PT-004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 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 67K 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 DoubleExponent-PT-004-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591239530456

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:58:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:58:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:58:52] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-04 02:58:52] [INFO ] Transformed 216 places.
[2020-06-04 02:58:52] [INFO ] Transformed 198 transitions.
[2020-06-04 02:58:52] [INFO ] Parsed PT model containing 216 places and 198 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 334 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 269 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 553820 states, properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1]
Probabilistic random walk after 1107687 steps, saw 553820 distinct states, run finished after 3721 ms. (steps per millisecond=297 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1]
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Interrupted probabilistic random walk after 9238648 steps, run timeout after 30001 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
Exhaustive walk after 9238648 steps, saw 4619020 distinct states, run finished after 30001 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
// Phase 1: matrix 198 rows 216 cols
[2020-06-04 02:59:26] [INFO ] Computed 24 place invariants in 20 ms
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 4 ms returned unsat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned unsat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-04 02:59:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned unsat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 02:59:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-04 02:59:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned unsat
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned unsat
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 2 ms returned unsat
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2020-06-04 02:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:27] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2020-06-04 02:59:27] [INFO ] Deduced a trap composed of 54 places in 125 ms
[2020-06-04 02:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2020-06-04 02:59:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:59:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 02:59:27] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2020-06-04 02:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:59:28] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-04 02:59:28] [INFO ] Deduced a trap composed of 54 places in 80 ms
[2020-06-04 02:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2020-06-04 02:59:28] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 22 ms.
[2020-06-04 02:59:29] [INFO ] Added : 195 causal constraints over 41 iterations in 971 ms. Result :sat
[2020-06-04 02:59:29] [INFO ] Deduced a trap composed of 41 places in 90 ms
[2020-06-04 02:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-04 02:59:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 209800 steps, including 7461 resets, run finished after 196 ms. (steps per millisecond=1070 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 198/198 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 360 edges and 216 vertex of which 211 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 210 transition count 150
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 97 place count 163 transition count 150
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 97 place count 163 transition count 144
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 157 transition count 144
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 189 place count 117 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 111 transition count 104
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 215 place count 111 transition count 90
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 229 place count 97 transition count 90
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 245 place count 97 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 96 transition count 89
Applied a total of 246 rules in 93 ms. Remains 96 /216 variables (removed 120) and now considering 89/198 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/216 places, 89/198 transitions.
Incomplete random walk after 1000000 steps, including 128437 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 84635 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties seen :[0]
Interrupted probabilistic random walk after 13764691 steps, run timeout after 30001 ms. (steps per millisecond=458 ) properties seen :[0]
Probabilistic random walk after 13764691 steps, saw 6879627 distinct states, run finished after 30001 ms. (steps per millisecond=458 ) properties seen :[0]
// Phase 1: matrix 89 rows 96 cols
[2020-06-04 03:00:01] [INFO ] Computed 20 place invariants in 2 ms
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 11 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-04 03:00:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-06-04 03:00:01] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:01] [INFO ] Computed and/alt/rep : 88/495/88 causal constraints in 7 ms.
[2020-06-04 03:00:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 6 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:01] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-06-04 03:00:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:01] [INFO ] Computed and/alt/rep : 88/495/88 causal constraints in 5 ms.
[2020-06-04 03:00:02] [INFO ] Added : 87 causal constraints over 18 iterations in 301 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 164900 steps, including 24947 resets, run finished after 210 ms. (steps per millisecond=785 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 89/89 transitions.
Starting structural reductions, iteration 0 : 96/96 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 96 cols
[2020-06-04 03:00:02] [INFO ] Computed 20 place invariants in 2 ms
[2020-06-04 03:00:02] [INFO ] Implicit Places using invariants in 180 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
[2020-06-04 03:00:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 89 rows 95 cols
[2020-06-04 03:00:02] [INFO ] Computed 19 place invariants in 2 ms
[2020-06-04 03:00:02] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 95/96 places, 89/89 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 94 transition count 88
Applied a total of 3 rules in 7 ms. Remains 94 /95 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 94 cols
[2020-06-04 03:00:02] [INFO ] Computed 19 place invariants in 1 ms
[2020-06-04 03:00:02] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 88 rows 94 cols
[2020-06-04 03:00:02] [INFO ] Computed 19 place invariants in 1 ms
[2020-06-04 03:00:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-06-04 03:00:02] [INFO ] Implicit Places using invariants and state equation in 305 ms returned [20, 26, 62, 67, 85, 91]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 419 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 88/96 places, 88/89 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 88 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 85
Applied a total of 6 rules in 6 ms. Remains 85 /88 variables (removed 3) and now considering 85/88 (removed 3) transitions.
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:02] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-04 03:00:03] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:03] [INFO ] Computed 13 place invariants in 3 ms
[2020-06-04 03:00:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-06-04 03:00:03] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 85/96 places, 85/89 transitions.
Incomplete random walk after 1000000 steps, including 144329 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 91412 resets, run finished after 473 ms. (steps per millisecond=2114 ) properties seen :[0]
Interrupted probabilistic random walk after 15748713 steps, run timeout after 30001 ms. (steps per millisecond=524 ) properties seen :[0]
Probabilistic random walk after 15748713 steps, saw 7870433 distinct states, run finished after 30004 ms. (steps per millisecond=524 ) properties seen :[0]
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:34] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-04 03:00:34] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-04 03:00:34] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2020-06-04 03:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-04 03:00:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-06-04 03:00:34] [INFO ] [Real]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-06-04 03:00:34] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2020-06-04 03:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:34] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-06-04 03:00:34] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:34] [INFO ] Deduced a trap composed of 11 places in 19 ms
[2020-06-04 03:00:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2020-06-04 03:00:34] [INFO ] Computed and/alt/rep : 84/461/84 causal constraints in 4 ms.
[2020-06-04 03:00:35] [INFO ] Added : 83 causal constraints over 17 iterations in 200 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 55200 steps, including 9316 resets, run finished after 65 ms. (steps per millisecond=849 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 85/85 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:35] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-04 03:00:35] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:35] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-04 03:00:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-06-04 03:00:35] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2020-06-04 03:00:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:35] [INFO ] Computed 13 place invariants in 2 ms
[2020-06-04 03:00:35] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 85/85 transitions.
Incomplete random walk after 100000 steps, including 14471 resets, run finished after 96 ms. (steps per millisecond=1041 ) properties seen :[0]
// Phase 1: matrix 85 rows 85 cols
[2020-06-04 03:00:35] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-04 03:00:35] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-06-04 03:00:35] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2020-06-04 03:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:35] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-04 03:00:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2020-06-04 03:00:35] [INFO ] [Real]Added 14 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-04 03:00:35] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2020-06-04 03:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:35] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-06-04 03:00:35] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:35] [INFO ] Deduced a trap composed of 11 places in 24 ms
[2020-06-04 03:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2020-06-04 03:00:35] [INFO ] Computed and/alt/rep : 84/461/84 causal constraints in 5 ms.
[2020-06-04 03:00:35] [INFO ] Added : 83 causal constraints over 17 iterations in 244 ms. Result :sat
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 84 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 78 transition count 78
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 78 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 75 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 75 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 74 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 74 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 73 transition count 73
Applied a total of 27 rules in 10 ms. Remains 73 /85 variables (removed 12) and now considering 73/85 (removed 12) transitions.
// Phase 1: matrix 73 rows 73 cols
[2020-06-04 03:00:36] [INFO ] Computed 13 place invariants in 1 ms
[2020-06-04 03:00:36] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:00:36] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2020-06-04 03:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:36] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-04 03:00:36] [INFO ] Deduced a trap composed of 14 places in 22 ms
[2020-06-04 03:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2020-06-04 03:00:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-04 03:00:36] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2020-06-04 03:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:36] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-04 03:00:36] [INFO ] Deduced a trap composed of 14 places in 21 ms
[2020-06-04 03:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-06-04 03:00:36] [INFO ] Computed and/alt/rep : 72/399/72 causal constraints in 4 ms.
[2020-06-04 03:00:36] [INFO ] Added : 71 causal constraints over 15 iterations in 118 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-04 03:00:36] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-04 03:00:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
[2020-06-04 03:00:36] [INFO ] Flatten gal took : 42 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DoubleExponent-PT-004 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ DoubleExponent-PT-004

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 03:00:36 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 16912,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p52) AND (p68 <= p39))))",
"processed_size": 37,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 416,
"conflict_clusters": 9,
"places": 85,
"places_significant": 72,
"singleton_clusters": 0,
"transitions": 85
},
"task":
{
"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"
}
}
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: 170/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2720
lola: finding significant places
lola: 85 places, 85 transitions, 72 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: E (F (((1 <= p52) AND (p68 <= p39))))
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 <= p52) AND (p68 <= p39))))
lola: processed formula length: 37
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: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: local time limit reached - aborting
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p52) AND (p68 <= p39))
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: error: :130: 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: memory consumption: 16912 KB
lola: time consumption: 3 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="DoubleExponent-PT-004"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-004, 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 r178-tajo-158987882900774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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