Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 91K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591185621980

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:00:25] [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-03 12:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:00:25] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-06-03 12:00:25] [INFO ] Transformed 360 places.
[2020-06-03 12:00:25] [INFO ] Transformed 311 transitions.
[2020-06-03 12:00:25] [INFO ] Found NUPN structural information;
[2020-06-03 12:00:25] [INFO ] Parsed PT model containing 360 places and 311 transitions in 224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 122 ms. (steps per millisecond=81 ) properties seen :[1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1]
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 311 rows 360 cols
[2020-06-03 12:00:26] [INFO ] Computed 65 place invariants in 48 ms
[2020-06-03 12:00:26] [INFO ] [Real]Absence check using 39 positive place invariants in 68 ms returned sat
[2020-06-03 12:00:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2020-06-03 12:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:27] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2020-06-03 12:00:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:00:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 71 ms returned sat
[2020-06-03 12:00:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-03 12:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:28] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2020-06-03 12:00:28] [INFO ] Deduced a trap composed of 17 places in 203 ms
[2020-06-03 12:00:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2020-06-03 12:00:28] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 46 ms.
[2020-06-03 12:00:32] [INFO ] Added : 260 causal constraints over 52 iterations in 3588 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 12:00:32] [INFO ] [Real]Absence check using 39 positive place invariants in 58 ms returned sat
[2020-06-03 12:00:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2020-06-03 12:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:33] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2020-06-03 12:00:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:00:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-06-03 12:00:33] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 12:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:34] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2020-06-03 12:00:34] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 56 ms.
[2020-06-03 12:00:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t293 0) (and (and (> t75 0) (< o75 o293)) (and (> t284 0) (< o284 o293))))") while checking expression at index 1
[2020-06-03 12:00:38] [INFO ] [Real]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-06-03 12:00:38] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 12:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:39] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2020-06-03 12:00:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:00:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-06-03 12:00:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-06-03 12:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:40] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2020-06-03 12:00:41] [INFO ] Deduced a trap composed of 10 places in 498 ms
[2020-06-03 12:00:41] [INFO ] Deduced a trap composed of 49 places in 184 ms
[2020-06-03 12:00:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 837 ms
[2020-06-03 12:00:41] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 45 ms.
[2020-06-03 12:00:44] [INFO ] Added : 230 causal constraints over 46 iterations in 2923 ms. Result :unknown
[2020-06-03 12:00:44] [INFO ] [Real]Absence check using 39 positive place invariants in 51 ms returned sat
[2020-06-03 12:00:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 109 ms returned sat
[2020-06-03 12:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:45] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2020-06-03 12:00:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:00:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 12:00:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2020-06-03 12:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:47] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2020-06-03 12:00:47] [INFO ] Deduced a trap composed of 8 places in 247 ms
[2020-06-03 12:00:47] [INFO ] Deduced a trap composed of 20 places in 193 ms
[2020-06-03 12:00:47] [INFO ] Deduced a trap composed of 37 places in 177 ms
[2020-06-03 12:00:48] [INFO ] Deduced a trap composed of 16 places in 272 ms
[2020-06-03 12:00:48] [INFO ] Deduced a trap composed of 42 places in 311 ms
[2020-06-03 12:00:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1437 ms
[2020-06-03 12:00:48] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 37 ms.
[2020-06-03 12:00:51] [INFO ] Added : 195 causal constraints over 39 iterations in 2385 ms. Result :unknown
[2020-06-03 12:00:51] [INFO ] [Real]Absence check using 39 positive place invariants in 42 ms returned sat
[2020-06-03 12:00:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2020-06-03 12:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:52] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2020-06-03 12:00:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:00:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-06-03 12:00:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-06-03 12:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:53] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2020-06-03 12:00:53] [INFO ] Deduced a trap composed of 22 places in 394 ms
[2020-06-03 12:00:53] [INFO ] Deduced a trap composed of 57 places in 219 ms
[2020-06-03 12:00:53] [INFO ] Deduced a trap composed of 62 places in 173 ms
[2020-06-03 12:00:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 916 ms
[2020-06-03 12:00:54] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 33 ms.
[2020-06-03 12:00:57] [INFO ] Added : 255 causal constraints over 51 iterations in 3167 ms. Result :(error "Failed to check-sat")
[2020-06-03 12:00:57] [INFO ] [Real]Absence check using 39 positive place invariants in 50 ms returned sat
[2020-06-03 12:00:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-06-03 12:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:58] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2020-06-03 12:00:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:00:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-06-03 12:00:58] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-06-03 12:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:00:59] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2020-06-03 12:00:59] [INFO ] Deduced a trap composed of 14 places in 345 ms
[2020-06-03 12:00:59] [INFO ] Deduced a trap composed of 37 places in 149 ms
[2020-06-03 12:00:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 616 ms
[2020-06-03 12:01:00] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 151 ms.
[2020-06-03 12:01:03] [INFO ] Added : 260 causal constraints over 52 iterations in 3262 ms. Result :unknown
Incomplete Parikh walk after 296700 steps, including 3157 resets, run finished after 1462 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA DES-PT-20b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 78600 steps, including 1340 resets, run finished after 341 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 305400 steps, including 3257 resets, run finished after 1259 ms. (steps per millisecond=242 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 741 edges and 360 vertex of which 349 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 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 349 transition count 287
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 332 transition count 287
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 37 place count 332 transition count 281
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 326 transition count 281
Symmetric choice reduction at 2 with 16 rule applications. Total rules 65 place count 326 transition count 281
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 310 transition count 265
Symmetric choice reduction at 2 with 14 rule applications. Total rules 111 place count 310 transition count 265
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 296 transition count 251
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 152 place count 296 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 295 transition count 238
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 153 place count 295 transition count 236
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 293 transition count 236
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 301 place count 221 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 221 transition count 163
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 306 place count 219 transition count 168
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 219 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 308 place count 218 transition count 167
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 310 place count 218 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 311 place count 217 transition count 166
Applied a total of 311 rules in 312 ms. Remains 217 /360 variables (removed 143) and now considering 166/311 (removed 145) transitions.
Finished structural reductions, in 1 iterations. Remains : 217/360 places, 166/311 transitions.
Incomplete random walk after 1000000 steps, including 27422 resets, run finished after 4449 ms. (steps per millisecond=224 ) properties seen :[0, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5353 resets, run finished after 2074 ms. (steps per millisecond=482 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5366 resets, run finished after 2224 ms. (steps per millisecond=449 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5044 resets, run finished after 2019 ms. (steps per millisecond=495 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5510 resets, run finished after 1966 ms. (steps per millisecond=508 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 166 rows 217 cols
[2020-06-03 12:01:19] [INFO ] Computed 61 place invariants in 16 ms
[2020-06-03 12:01:19] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2020-06-03 12:01:19] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2020-06-03 12:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:20] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2020-06-03 12:01:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:01:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 55 ms returned sat
[2020-06-03 12:01:20] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 101 ms returned sat
[2020-06-03 12:01:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:20] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2020-06-03 12:01:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-06-03 12:01:20] [INFO ] [Nat]Added 9 Read/Feed constraints in 53 ms returned sat
[2020-06-03 12:01:20] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 27 ms.
[2020-06-03 12:01:22] [INFO ] Added : 149 causal constraints over 30 iterations in 1621 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 12:01:22] [INFO ] [Real]Absence check using 37 positive place invariants in 32 ms returned sat
[2020-06-03 12:01:22] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-03 12:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:23] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2020-06-03 12:01:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:01:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2020-06-03 12:01:23] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 86 ms returned sat
[2020-06-03 12:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:23] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2020-06-03 12:01:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 37 ms returned sat
[2020-06-03 12:01:23] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 24 ms.
[2020-06-03 12:01:25] [INFO ] Added : 143 causal constraints over 30 iterations in 1442 ms. Result :sat
[2020-06-03 12:01:25] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-06-03 12:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 12:01:25] [INFO ] [Real]Absence check using 37 positive place invariants in 53 ms returned sat
[2020-06-03 12:01:25] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 26 ms returned sat
[2020-06-03 12:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:26] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-06-03 12:01:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:01:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 91 ms returned sat
[2020-06-03 12:01:26] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 155 ms returned sat
[2020-06-03 12:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:27] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2020-06-03 12:01:27] [INFO ] [Nat]Added 9 Read/Feed constraints in 54 ms returned sat
[2020-06-03 12:01:27] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-06-03 12:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2020-06-03 12:01:27] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 17 ms.
[2020-06-03 12:01:27] [INFO ] Added : 40 causal constraints over 8 iterations in 233 ms. Result :unsat
[2020-06-03 12:01:27] [INFO ] [Real]Absence check using 37 positive place invariants in 52 ms returned sat
[2020-06-03 12:01:27] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 12:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:28] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2020-06-03 12:01:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:01:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 37 ms returned sat
[2020-06-03 12:01:28] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 66 ms returned sat
[2020-06-03 12:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:01:28] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2020-06-03 12:01:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2020-06-03 12:01:29] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 37 ms.
[2020-06-03 12:01:30] [INFO ] Added : 136 causal constraints over 28 iterations in 1161 ms. Result :sat
[2020-06-03 12:01:30] [INFO ] Deduced a trap composed of 20 places in 157 ms
[2020-06-03 12:01:30] [INFO ] Deduced a trap composed of 24 places in 140 ms
[2020-06-03 12:01:30] [INFO ] Deduced a trap composed of 24 places in 105 ms
[2020-06-03 12:01:30] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2020-06-03 12:01:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 686 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
FORMULA DES-PT-20b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 97900 steps, including 3290 resets, run finished after 430 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40400 steps, including 1363 resets, run finished after 167 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 129100 steps, including 4334 resets, run finished after 581 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 217 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 217/217 places, 166/166 transitions.
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 217 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 216 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 216 transition count 163
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 214 transition count 163
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 214 transition count 163
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 213 transition count 162
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 2 with 4 rules applied. Total rules applied 13 place count 211 transition count 160
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 211 transition count 160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 210 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 210 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 209 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 208 transition count 155
Applied a total of 23 rules in 149 ms. Remains 208 /217 variables (removed 9) and now considering 155/166 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/217 places, 155/166 transitions.
Incomplete random walk after 1000000 steps, including 34586 resets, run finished after 4245 ms. (steps per millisecond=235 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6818 resets, run finished after 2050 ms. (steps per millisecond=487 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7090 resets, run finished after 2067 ms. (steps per millisecond=483 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7130 resets, run finished after 2004 ms. (steps per millisecond=499 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8863628 steps, run timeout after 30001 ms. (steps per millisecond=295 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8863628 steps, saw 1071190 distinct states, run finished after 30004 ms. (steps per millisecond=295 ) properties seen :[0, 0, 0]
// Phase 1: matrix 155 rows 208 cols
[2020-06-03 12:02:12] [INFO ] Computed 61 place invariants in 12 ms
[2020-06-03 12:02:12] [INFO ] [Real]Absence check using 36 positive place invariants in 59 ms returned sat
[2020-06-03 12:02:12] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 12:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:13] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-03 12:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned sat
[2020-06-03 12:02:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 59 ms returned sat
[2020-06-03 12:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:13] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2020-06-03 12:02:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 12:02:13] [INFO ] [Nat]Added 6 Read/Feed constraints in 26 ms returned sat
[2020-06-03 12:02:13] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 16 ms.
[2020-06-03 12:02:15] [INFO ] Added : 104 causal constraints over 21 iterations in 1137 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-06-03 12:02:15] [INFO ] [Real]Absence check using 36 positive place invariants in 73 ms returned sat
[2020-06-03 12:02:15] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 30 ms returned sat
[2020-06-03 12:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:15] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-06-03 12:02:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-06-03 12:02:15] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 88 ms returned sat
[2020-06-03 12:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:16] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2020-06-03 12:02:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 49 ms returned sat
[2020-06-03 12:02:16] [INFO ] Deduced a trap composed of 3 places in 50 ms
[2020-06-03 12:02:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-06-03 12:02:16] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 21 ms.
[2020-06-03 12:02:17] [INFO ] Added : 101 causal constraints over 21 iterations in 924 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 12:02:17] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-06-03 12:02:17] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 23 ms returned sat
[2020-06-03 12:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:17] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-03 12:02:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-06-03 12:02:17] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 64 ms returned sat
[2020-06-03 12:02:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:18] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2020-06-03 12:02:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2020-06-03 12:02:18] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 27 ms.
[2020-06-03 12:02:19] [INFO ] Added : 126 causal constraints over 26 iterations in 1166 ms. Result :sat
[2020-06-03 12:02:19] [INFO ] Deduced a trap composed of 48 places in 140 ms
[2020-06-03 12:02:20] [INFO ] Deduced a trap composed of 19 places in 127 ms
[2020-06-03 12:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 79300 steps, including 3312 resets, run finished after 405 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 48300 steps, including 2003 resets, run finished after 220 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 52700 steps, including 2091 resets, run finished after 228 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 208 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 208/208 places, 155/155 transitions.
Applied a total of 0 rules in 29 ms. Remains 208 /208 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 155/155 transitions.
Starting structural reductions, iteration 0 : 208/208 places, 155/155 transitions.
Applied a total of 0 rules in 29 ms. Remains 208 /208 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 208 cols
[2020-06-03 12:02:21] [INFO ] Computed 61 place invariants in 22 ms
[2020-06-03 12:02:21] [INFO ] Implicit Places using invariants in 764 ms returned []
// Phase 1: matrix 155 rows 208 cols
[2020-06-03 12:02:21] [INFO ] Computed 61 place invariants in 22 ms
[2020-06-03 12:02:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 12:02:23] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2020-06-03 12:02:23] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 155 rows 208 cols
[2020-06-03 12:02:23] [INFO ] Computed 61 place invariants in 5 ms
[2020-06-03 12:02:24] [INFO ] Dead Transitions using invariants and state equation in 498 ms returned []
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 155/155 transitions.
Incomplete random walk after 100000 steps, including 3395 resets, run finished after 461 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0]
// Phase 1: matrix 155 rows 208 cols
[2020-06-03 12:02:24] [INFO ] Computed 61 place invariants in 4 ms
[2020-06-03 12:02:24] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-06-03 12:02:24] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2020-06-03 12:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:24] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2020-06-03 12:02:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 12:02:25] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 67 ms returned sat
[2020-06-03 12:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:25] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2020-06-03 12:02:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 12:02:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 15 ms returned sat
[2020-06-03 12:02:25] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 21 ms.
[2020-06-03 12:02:26] [INFO ] Added : 104 causal constraints over 21 iterations in 897 ms. Result :sat
[2020-06-03 12:02:26] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-06-03 12:02:26] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 24 ms returned sat
[2020-06-03 12:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:26] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2020-06-03 12:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 12:02:27] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 131 ms returned sat
[2020-06-03 12:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:27] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2020-06-03 12:02:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 68 ms returned sat
[2020-06-03 12:02:27] [INFO ] Deduced a trap composed of 3 places in 30 ms
[2020-06-03 12:02:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-06-03 12:02:27] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 23 ms.
[2020-06-03 12:02:28] [INFO ] Added : 101 causal constraints over 21 iterations in 1089 ms. Result :sat
[2020-06-03 12:02:29] [INFO ] [Real]Absence check using 36 positive place invariants in 70 ms returned sat
[2020-06-03 12:02:29] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 12:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:29] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-06-03 12:02:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 12:02:29] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 63 ms returned sat
[2020-06-03 12:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:30] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2020-06-03 12:02:30] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2020-06-03 12:02:30] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 44 ms.
[2020-06-03 12:02:31] [INFO ] Added : 126 causal constraints over 26 iterations in 1320 ms. Result :sat
[2020-06-03 12:02:31] [INFO ] Deduced a trap composed of 48 places in 101 ms
[2020-06-03 12:02:31] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2020-06-03 12:02:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 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 208 transition count 155
Applied a total of 1 rules in 22 ms. Remains 208 /208 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 208 cols
[2020-06-03 12:02:31] [INFO ] Computed 61 place invariants in 4 ms
[2020-06-03 12:02:31] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-06-03 12:02:31] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 62 ms returned sat
[2020-06-03 12:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:32] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2020-06-03 12:02:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 94 ms returned sat
[2020-06-03 12:02:32] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 94 ms returned sat
[2020-06-03 12:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:32] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2020-06-03 12:02:33] [INFO ] Computed and/alt/rep : 151/774/151 causal constraints in 20 ms.
[2020-06-03 12:02:34] [INFO ] Added : 136 causal constraints over 28 iterations in 1254 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 12:02:34] [INFO ] [Real]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-06-03 12:02:34] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 12:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:34] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2020-06-03 12:02:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 71 ms returned sat
[2020-06-03 12:02:35] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 121 ms returned sat
[2020-06-03 12:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:35] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2020-06-03 12:02:35] [INFO ] Deduced a trap composed of 3 places in 27 ms
[2020-06-03 12:02:35] [INFO ] Deduced a trap composed of 5 places in 35 ms
[2020-06-03 12:02:35] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-03 12:02:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 165 ms
[2020-06-03 12:02:35] [INFO ] Computed and/alt/rep : 151/774/151 causal constraints in 17 ms.
[2020-06-03 12:02:36] [INFO ] Added : 102 causal constraints over 21 iterations in 1111 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 12:02:37] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 12:02:37] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 29 ms returned sat
[2020-06-03 12:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:37] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2020-06-03 12:02:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:02:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 48 ms returned sat
[2020-06-03 12:02:37] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 67 ms returned sat
[2020-06-03 12:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:02:38] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2020-06-03 12:02:38] [INFO ] Computed and/alt/rep : 151/774/151 causal constraints in 16 ms.
[2020-06-03 12:02:39] [INFO ] Added : 128 causal constraints over 26 iterations in 1631 ms. Result :sat
[2020-06-03 12:02:39] [INFO ] Deduced a trap composed of 19 places in 178 ms
[2020-06-03 12:02:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 12:02:40] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 12:02:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
[2020-06-03 12:02:40] [INFO ] Flatten gal took : 152 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-20b @ 3570 seconds

FORMULA DES-PT-20b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20b-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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": "Wed Jun 3 12:02:41 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "A (G ((((p71 <= 0)) OR ((1 <= p112)))))",
"processed_size": 40,
"rewrites": 2
},
"result":
{
"edges": 94358,
"markings": 83025,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"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": 3,
"aneg": 0,
"comp": 3,
"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 ((((p153 <= 0)) AND ((1 <= p51)) AND ((p81 <= 0)))))",
"processed_size": 57,
"rewrites": 1
},
"result":
{
"edges": 2703,
"markings": 2646,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p52 <= 0)) OR ((1 <= p125)) OR (((1 <= p102)) AND ((p93 <= 0))))))",
"processed_size": 77,
"rewrites": 2
},
"result":
{
"edges": 2158,
"markings": 2105,
"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": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 20076,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 767,
"conflict_clusters": 56,
"places": 208,
"places_significant": 147,
"singleton_clusters": 0,
"transitions": 155
},
"result":
{
"preliminary_value": "yes no no ",
"value": "yes no no "
},
"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: 363/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 208
lola: finding significant places
lola: 208 places, 155 transitions, 147 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: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: E (F ((((p153 <= 0)) AND ((1 <= p51)) AND ((p81 <= 0))))) : A (G ((((p52 <= 0)) OR ((1 <= p125)) OR (((1 <= p102)) AND ((p93 <= 0)))))) : A (G ((((p71 <= 0)) OR ((1 <= p112)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p71 <= 0)) OR ((1 <= p112)))))
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 ((((p71 <= 0)) OR ((1 <= p112)))))
lola: processed formula length: 40
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 <= p71)) AND ((p112 <= 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 83025 markings, 94358 edges
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p153 <= 0)) AND ((1 <= p51)) AND ((p81 <= 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 ((((p153 <= 0)) AND ((1 <= p51)) AND ((p81 <= 0)))))
lola: processed formula length: 57
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: (((p153 <= 0)) AND ((1 <= p51)) AND ((p81 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2646 markings, 2703 edges
lola: ========================================
lola: subprocess 2 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p52 <= 0)) OR ((1 <= p125)) OR (((1 <= p102)) AND ((p93 <= 0))))))
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 ((((p52 <= 0)) OR ((1 <= p125)) OR (((1 <= p102)) AND ((p93 <= 0))))))
lola: processed formula length: 77
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 <= p52)) AND ((p125 <= 0)) AND (((p102 <= 0)) OR ((1 <= p93))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2105 markings, 2158 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no
lola:
preliminary result: yes no no
lola: memory consumption: 20076 KB
lola: time consumption: 5 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-20b"
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 DES-PT-20b, 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 r180-ebro-158987900000270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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