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-158987900000310.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-50a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 2.7K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:20 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 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K 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.3K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:18 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 97K 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-50a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591196372422

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 14:59:35] [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 14:59:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 14:59:35] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2020-06-03 14:59:35] [INFO ] Transformed 314 places.
[2020-06-03 14:59:35] [INFO ] Transformed 271 transitions.
[2020-06-03 14:59:35] [INFO ] Found NUPN structural information;
[2020-06-03 14:59:35] [INFO ] Parsed PT model containing 314 places and 271 transitions in 260 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 224 resets, run finished after 143 ms. (steps per millisecond=69 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 257 rows 314 cols
[2020-06-03 14:59:36] [INFO ] Computed 59 place invariants in 55 ms
[2020-06-03 14:59:36] [INFO ] [Real]Absence check using 34 positive place invariants in 60 ms returned sat
[2020-06-03 14:59:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2020-06-03 14:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:37] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2020-06-03 14:59:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:59:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 54 ms returned sat
[2020-06-03 14:59:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 107 ms returned sat
[2020-06-03 14:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:38] [INFO ] [Nat]Absence check using state equation in 214 ms returned unsat
[2020-06-03 14:59:38] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-06-03 14:59:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2020-06-03 14:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:38] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2020-06-03 14:59:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:59:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 14:59:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 225 ms returned sat
[2020-06-03 14:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:40] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2020-06-03 14:59:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 14:59:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-03 14:59:40] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 122 ms.
[2020-06-03 14:59:43] [INFO ] Added : 225 causal constraints over 45 iterations in 3331 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 14:59:43] [INFO ] [Real]Absence check using 34 positive place invariants in 67 ms returned sat
[2020-06-03 14:59:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 14:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:44] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2020-06-03 14:59:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:59:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-06-03 14:59:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 169 ms returned sat
[2020-06-03 14:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:45] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2020-06-03 14:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 14:59:46] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 55 ms.
[2020-06-03 14:59:48] [INFO ] Added : 202 causal constraints over 41 iterations in 2305 ms. Result :sat
[2020-06-03 14:59:48] [INFO ] Deduced a trap composed of 13 places in 127 ms
[2020-06-03 14:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 14:59:48] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 14:59:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-06-03 14:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:49] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2020-06-03 14:59:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:59:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 14:59:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 140 ms returned sat
[2020-06-03 14:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:50] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2020-06-03 14:59:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-06-03 14:59:50] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 34 ms.
[2020-06-03 14:59:54] [INFO ] Added : 162 causal constraints over 33 iterations in 3163 ms. Result :sat
[2020-06-03 14:59:54] [INFO ] Deduced a trap composed of 17 places in 119 ms
[2020-06-03 14:59:54] [INFO ] Deduced a trap composed of 17 places in 94 ms
[2020-06-03 14:59:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 494 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 14:59:54] [INFO ] [Real]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-06-03 14:59:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 67 ms returned sat
[2020-06-03 14:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:56] [INFO ] [Real]Absence check using state equation in 2043 ms returned sat
[2020-06-03 14:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:59:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 14:59:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 138 ms returned sat
[2020-06-03 14:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:59:58] [INFO ] [Nat]Absence check using state equation in 1539 ms returned sat
[2020-06-03 14:59:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2020-06-03 14:59:58] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 39 ms.
[2020-06-03 15:00:01] [INFO ] Added : 197 causal constraints over 40 iterations in 2511 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 15:00:01] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 15:00:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 15:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:00:02] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2020-06-03 15:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:00:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 15:00:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 177 ms returned sat
[2020-06-03 15:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:00:03] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2020-06-03 15:00:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-06-03 15:00:03] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 41 ms.
[2020-06-03 15:00:06] [INFO ] Added : 231 causal constraints over 47 iterations in 3177 ms. Result :sat
[2020-06-03 15:00:06] [INFO ] Deduced a trap composed of 13 places in 105 ms
[2020-06-03 15:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 15:00:07] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 15:00:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2020-06-03 15:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:00:08] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2020-06-03 15:00:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:00:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:00:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 128 ms returned sat
[2020-06-03 15:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:00:08] [INFO ] [Nat]Absence check using state equation in 124 ms returned unsat
FORMULA DES-PT-50a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 223300 steps, including 5292 resets, run finished after 1192 ms. (steps per millisecond=187 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 187100 steps, including 4673 resets, run finished after 891 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 187700 steps, including 4746 resets, run finished after 903 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 97400 steps, including 2102 resets, run finished after 454 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 199700 steps, including 5177 resets, run finished after 909 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 314 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 314 transition count 256
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 314 transition count 256
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 313 transition count 255
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 313 transition count 255
Applied a total of 9 rules in 191 ms. Remains 313 /314 variables (removed 1) and now considering 255/257 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/314 places, 255/257 transitions.
Incomplete random walk after 1000000 steps, including 16468 resets, run finished after 4692 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2919 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2932 resets, run finished after 2058 ms. (steps per millisecond=485 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3645 resets, run finished after 2002 ms. (steps per millisecond=499 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4226 resets, run finished after 2598 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2939 resets, run finished after 1937 ms. (steps per millisecond=516 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8591280 steps, run timeout after 30001 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 8591280 steps, saw 1036264 distinct states, run finished after 30001 ms. (steps per millisecond=286 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 313 cols
[2020-06-03 15:00:58] [INFO ] Computed 60 place invariants in 29 ms
[2020-06-03 15:00:58] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:00:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 15:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:00:59] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2020-06-03 15:00:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:00:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:00:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 38 ms returned sat
[2020-06-03 15:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:00] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2020-06-03 15:01:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 15:01:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 10 ms returned sat
[2020-06-03 15:01:00] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 29 ms.
[2020-06-03 15:01:03] [INFO ] Added : 226 causal constraints over 46 iterations in 2909 ms. Result :sat
[2020-06-03 15:01:03] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-06-03 15:01:03] [INFO ] Deduced a trap composed of 11 places in 93 ms
[2020-06-03 15:01:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 15:01:03] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 15:01:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2020-06-03 15:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:04] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2020-06-03 15:01:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:01:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 15:01:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 76 ms returned sat
[2020-06-03 15:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:05] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2020-06-03 15:01:05] [INFO ] [Nat]Added 4 Read/Feed constraints in 17 ms returned sat
[2020-06-03 15:01:05] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 30 ms.
[2020-06-03 15:01:10] [INFO ] Added : 228 causal constraints over 46 iterations in 4581 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 15:01:10] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 15:01:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 15:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:11] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2020-06-03 15:01:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:01:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:01:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 85 ms returned sat
[2020-06-03 15:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:12] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2020-06-03 15:01:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-06-03 15:01:12] [INFO ] Deduced a trap composed of 51 places in 121 ms
[2020-06-03 15:01:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-06-03 15:01:12] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 33 ms.
[2020-06-03 15:01:14] [INFO ] Added : 205 causal constraints over 41 iterations in 2335 ms. Result :sat
[2020-06-03 15:01:14] [INFO ] Deduced a trap composed of 9 places in 174 ms
[2020-06-03 15:01:15] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2020-06-03 15:01:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 869 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 15:01:15] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 15:01:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2020-06-03 15:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:17] [INFO ] [Real]Absence check using state equation in 2115 ms returned sat
[2020-06-03 15:01:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:01:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:01:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2020-06-03 15:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:19] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2020-06-03 15:01:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 17 ms returned sat
[2020-06-03 15:01:19] [INFO ] Deduced a trap composed of 51 places in 67 ms
[2020-06-03 15:01:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2020-06-03 15:01:19] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 31 ms.
[2020-06-03 15:01:22] [INFO ] Added : 210 causal constraints over 42 iterations in 2753 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
[2020-06-03 15:01:22] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:01:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 15:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:23] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2020-06-03 15:01:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:01:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 15:01:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 87 ms returned sat
[2020-06-03 15:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:01:24] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2020-06-03 15:01:24] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-06-03 15:01:24] [INFO ] Deduced a trap composed of 51 places in 167 ms
[2020-06-03 15:01:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2020-06-03 15:01:24] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 25 ms.
[2020-06-03 15:01:26] [INFO ] Added : 193 causal constraints over 39 iterations in 2205 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 210600 steps, including 4854 resets, run finished after 1023 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 250800 steps, including 5877 resets, run finished after 1212 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 173400 steps, including 4329 resets, run finished after 866 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 106000 steps, including 2250 resets, run finished after 523 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 117500 steps, including 2488 resets, run finished after 582 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 27 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 26 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 313 cols
[2020-06-03 15:01:31] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 15:01:32] [INFO ] Implicit Places using invariants in 1404 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1409 ms to find 1 implicit places.
[2020-06-03 15:01:32] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:01:32] [INFO ] Computed 59 place invariants in 11 ms
[2020-06-03 15:01:33] [INFO ] Dead Transitions using invariants and state equation in 1104 ms returned []
Starting structural reductions, iteration 1 : 312/313 places, 255/255 transitions.
Applied a total of 0 rules in 46 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2020-06-03 15:01:33] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:01:33] [INFO ] Computed 59 place invariants in 16 ms
[2020-06-03 15:01:35] [INFO ] Dead Transitions using invariants and state equation in 1231 ms returned []
Finished structural reductions, in 2 iterations. Remains : 312/313 places, 255/255 transitions.
Incomplete random walk after 1000000 steps, including 16485 resets, run finished after 4587 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3033 resets, run finished after 1989 ms. (steps per millisecond=502 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3059 resets, run finished after 1919 ms. (steps per millisecond=521 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3604 resets, run finished after 1955 ms. (steps per millisecond=511 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4229 resets, run finished after 2378 ms. (steps per millisecond=420 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2937 resets, run finished after 1903 ms. (steps per millisecond=525 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8817574 steps, run timeout after 30001 ms. (steps per millisecond=293 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 8817574 steps, saw 1064377 distinct states, run finished after 30001 ms. (steps per millisecond=293 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:02:19] [INFO ] Computed 59 place invariants in 20 ms
[2020-06-03 15:02:20] [INFO ] [Real]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-06-03 15:02:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2020-06-03 15:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:20] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2020-06-03 15:02:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:02:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 15:02:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 110 ms returned sat
[2020-06-03 15:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:21] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2020-06-03 15:02:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 15:02:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 19 ms returned sat
[2020-06-03 15:02:21] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 28 ms.
[2020-06-03 15:02:25] [INFO ] Added : 233 causal constraints over 47 iterations in 3443 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 15:02:25] [INFO ] [Real]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:02:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 15:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:26] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2020-06-03 15:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:02:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 15:02:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 110 ms returned sat
[2020-06-03 15:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:27] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2020-06-03 15:02:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 158 ms returned sat
[2020-06-03 15:02:27] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 25 ms.
[2020-06-03 15:02:30] [INFO ] Added : 225 causal constraints over 45 iterations in 2802 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-06-03 15:02:30] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 15:02:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 15:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:31] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2020-06-03 15:02:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:02:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 15:02:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 107 ms returned sat
[2020-06-03 15:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:32] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2020-06-03 15:02:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2020-06-03 15:02:32] [INFO ] Deduced a trap composed of 51 places in 151 ms
[2020-06-03 15:02:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2020-06-03 15:02:33] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 34 ms.
[2020-06-03 15:02:35] [INFO ] Added : 202 causal constraints over 41 iterations in 2461 ms. Result :sat
[2020-06-03 15:02:35] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2020-06-03 15:02:35] [INFO ] Deduced a trap composed of 19 places in 104 ms
[2020-06-03 15:02:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 740 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 15:02:36] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 15:02:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:38] [INFO ] [Real]Absence check using state equation in 1865 ms returned sat
[2020-06-03 15:02:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:02:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 15:02:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 86 ms returned sat
[2020-06-03 15:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:39] [INFO ] [Nat]Absence check using state equation in 1269 ms returned sat
[2020-06-03 15:02:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2020-06-03 15:02:39] [INFO ] Deduced a trap composed of 51 places in 55 ms
[2020-06-03 15:02:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2020-06-03 15:02:39] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 28 ms.
[2020-06-03 15:02:42] [INFO ] Added : 251 causal constraints over 51 iterations in 3083 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
[2020-06-03 15:02:43] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 15:02:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 15:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:43] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2020-06-03 15:02:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:02:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-06-03 15:02:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2020-06-03 15:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:02:44] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2020-06-03 15:02:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 21 ms returned sat
[2020-06-03 15:02:45] [INFO ] Deduced a trap composed of 51 places in 51 ms
[2020-06-03 15:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2020-06-03 15:02:45] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 28 ms.
[2020-06-03 15:02:47] [INFO ] Added : 235 causal constraints over 47 iterations in 2404 ms. Result :sat
[2020-06-03 15:02:47] [INFO ] Deduced a trap composed of 10 places in 99 ms
[2020-06-03 15:02:47] [INFO ] Deduced a trap composed of 12 places in 96 ms
[2020-06-03 15:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 229800 steps, including 5305 resets, run finished after 1125 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 234800 steps, including 5535 resets, run finished after 1143 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 173500 steps, including 3996 resets, run finished after 930 ms. (steps per millisecond=186 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 209700 steps, including 4819 resets, run finished after 1117 ms. (steps per millisecond=187 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 151100 steps, including 3534 resets, run finished after 815 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 41 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 255/255 transitions.
Starting structural reductions, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 35 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:02:53] [INFO ] Computed 59 place invariants in 11 ms
[2020-06-03 15:02:54] [INFO ] Implicit Places using invariants in 1409 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:02:54] [INFO ] Computed 59 place invariants in 13 ms
[2020-06-03 15:02:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 15:03:01] [INFO ] Implicit Places using invariants and state equation in 6822 ms returned []
Implicit Place search using SMT with State Equation took 8234 ms to find 0 implicit places.
[2020-06-03 15:03:01] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:03:01] [INFO ] Computed 59 place invariants in 16 ms
[2020-06-03 15:03:02] [INFO ] Dead Transitions using invariants and state equation in 1151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 255/255 transitions.
Incomplete random walk after 100000 steps, including 1597 resets, run finished after 448 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:03:02] [INFO ] Computed 59 place invariants in 6 ms
[2020-06-03 15:03:03] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-06-03 15:03:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 15:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:03] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2020-06-03 15:03:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 15:03:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 121 ms returned sat
[2020-06-03 15:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:04] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2020-06-03 15:03:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-03 15:03:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2020-06-03 15:03:04] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 34 ms.
[2020-06-03 15:03:08] [INFO ] Added : 233 causal constraints over 47 iterations in 3500 ms. Result :sat
[2020-06-03 15:03:08] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-06-03 15:03:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 15:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:09] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2020-06-03 15:03:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-06-03 15:03:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 111 ms returned sat
[2020-06-03 15:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:10] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2020-06-03 15:03:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 150 ms returned sat
[2020-06-03 15:03:10] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 24 ms.
[2020-06-03 15:03:13] [INFO ] Added : 225 causal constraints over 45 iterations in 2801 ms. Result :sat
[2020-06-03 15:03:13] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 15:03:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:14] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-06-03 15:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 15:03:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 107 ms returned sat
[2020-06-03 15:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:15] [INFO ] [Nat]Absence check using state equation in 941 ms returned sat
[2020-06-03 15:03:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2020-06-03 15:03:15] [INFO ] Deduced a trap composed of 51 places in 206 ms
[2020-06-03 15:03:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2020-06-03 15:03:15] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 30 ms.
[2020-06-03 15:03:18] [INFO ] Added : 202 causal constraints over 41 iterations in 2582 ms. Result :sat
[2020-06-03 15:03:18] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-06-03 15:03:18] [INFO ] Deduced a trap composed of 19 places in 113 ms
[2020-06-03 15:03:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 836 ms
[2020-06-03 15:03:19] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-06-03 15:03:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:21] [INFO ] [Real]Absence check using state equation in 1819 ms returned sat
[2020-06-03 15:03:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:03:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 15:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:22] [INFO ] [Nat]Absence check using state equation in 1247 ms returned sat
[2020-06-03 15:03:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2020-06-03 15:03:22] [INFO ] Deduced a trap composed of 51 places in 58 ms
[2020-06-03 15:03:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2020-06-03 15:03:22] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 28 ms.
[2020-06-03 15:03:25] [INFO ] Added : 251 causal constraints over 51 iterations in 2970 ms. Result :sat
[2020-06-03 15:03:25] [INFO ] [Real]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:03:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 15:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:26] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2020-06-03 15:03:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 15:03:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2020-06-03 15:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:27] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2020-06-03 15:03:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 14 ms returned sat
[2020-06-03 15:03:27] [INFO ] Deduced a trap composed of 51 places in 62 ms
[2020-06-03 15:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2020-06-03 15:03:27] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 28 ms.
[2020-06-03 15:03:30] [INFO ] Added : 235 causal constraints over 47 iterations in 2462 ms. Result :sat
[2020-06-03 15:03:30] [INFO ] Deduced a trap composed of 10 places in 96 ms
[2020-06-03 15:03:30] [INFO ] Deduced a trap composed of 12 places in 91 ms
[2020-06-03 15:03:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 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 312 transition count 255
Applied a total of 1 rules in 52 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 312 cols
[2020-06-03 15:03:30] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 15:03:30] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-06-03 15:03:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 15:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:31] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2020-06-03 15:03:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-06-03 15:03:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 163 ms returned sat
[2020-06-03 15:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:32] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2020-06-03 15:03:32] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 29 ms.
[2020-06-03 15:03:35] [INFO ] Added : 233 causal constraints over 47 iterations in 3289 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 15:03:36] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 15:03:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2020-06-03 15:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:36] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2020-06-03 15:03:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 15:03:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 122 ms returned sat
[2020-06-03 15:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:37] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2020-06-03 15:03:38] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 27 ms.
[2020-06-03 15:03:41] [INFO ] Added : 204 causal constraints over 41 iterations in 3055 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-06-03 15:03:41] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 15:03:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 43 ms returned sat
[2020-06-03 15:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:41] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2020-06-03 15:03:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 15:03:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 118 ms returned sat
[2020-06-03 15:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:43] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2020-06-03 15:03:43] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 29 ms.
[2020-06-03 15:03:45] [INFO ] Added : 208 causal constraints over 42 iterations in 2305 ms. Result :sat
[2020-06-03 15:03:45] [INFO ] Deduced a trap composed of 18 places in 118 ms
[2020-06-03 15:03:45] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-06-03 15:03:46] [INFO ] Deduced a trap composed of 56 places in 84 ms
[2020-06-03 15:03:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 667 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 15:03:46] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-06-03 15:03:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2020-06-03 15:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:48] [INFO ] [Real]Absence check using state equation in 2018 ms returned sat
[2020-06-03 15:03:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-06-03 15:03:48] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 84 ms returned sat
[2020-06-03 15:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:50] [INFO ] [Nat]Absence check using state equation in 1282 ms returned sat
[2020-06-03 15:03:50] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 33 ms.
[2020-06-03 15:03:53] [INFO ] Added : 251 causal constraints over 51 iterations in 3302 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 15:03:53] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-06-03 15:03:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 15:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:54] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2020-06-03 15:03:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:03:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 15:03:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 98 ms returned sat
[2020-06-03 15:03:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:03:55] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2020-06-03 15:03:55] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 30 ms.
[2020-06-03 15:03:57] [INFO ] Added : 235 causal constraints over 47 iterations in 2514 ms. Result :sat
[2020-06-03 15:03:57] [INFO ] Deduced a trap composed of 56 places in 56 ms
[2020-06-03 15:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 15:03:58] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 15:03:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
[2020-06-03 15:03:58] [INFO ] Flatten gal took : 181 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-50a @ 3570 seconds

FORMULA DES-PT-50a-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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 ((((p122 <= 0)) OR ((1 <= p264)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 2355,
"markings": 2246,
"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": 891
},
"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 ((((p169 <= 0)) OR ((1 <= p221)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 1636,
"markings": 1585,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"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 ((((p9 <= 0)) OR ((1 <= p142)))))",
"processed_size": 39,
"rewrites": 2
},
"result":
{
"edges": 1966,
"markings": 1967,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"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": "A (G ((((1 <= p153)) OR ((p119 <= 0)) OR ((1 <= p241)))))",
"processed_size": 59,
"rewrites": 2
},
"result":
{
"edges": 965,
"markings": 966,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 7,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((((1 <= p247)) AND ((p249 <= 0))) OR (((1 <= p258)) AND ((p301 <= 0))) OR ((((1 <= p219)) OR ((p151 <= 0)) OR ((1 <= p263))) AND (((p68 <= 0)) OR ((1 <= p183)))))))",
"processed_size": 176,
"rewrites": 2
},
"result":
{
"edges": 2651,
"markings": 2423,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 36,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 23916,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 1256,
"conflict_clusters": 41,
"places": 312,
"places_significant": 253,
"singleton_clusters": 0,
"transitions": 255
},
"result":
{
"preliminary_value": "no no no no no ",
"value": "no no no 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: 567/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 312
lola: finding significant places
lola: 312 places, 255 transitions, 253 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: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: A (G ((((1 <= p153)) OR ((p119 <= 0)) OR ((1 <= p241))))) : A (G ((((p122 <= 0)) OR ((1 <= p264))))) : A (G ((((p169 <= 0)) OR ((1 <= p221))))) : A (G (((((1 <= p247)) AND ((p249 <= 0))) OR (((1 <= p258)) AND ((p301 <= 0))) OR ((((1 <= p219)) OR ((p151 <= 0)) OR ((1 <= p263))) AND (((p68 <= 0)) OR ((1 <= p183))))))) : A (G ((((p9 <= 0)) OR ((1 <= p142)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p122 <= 0)) OR ((1 <= p264)))))
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 ((((p122 <= 0)) OR ((1 <= p264)))))
lola: processed formula length: 41
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 <= p122)) AND ((p264 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2246 markings, 2355 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p169 <= 0)) OR ((1 <= p221)))))
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 ((((p169 <= 0)) OR ((1 <= p221)))))
lola: processed formula length: 41
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 <= p169)) AND ((p221 <= 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
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1585 markings, 1636 edges
lola: ========================================
lola: subprocess 2 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p9 <= 0)) OR ((1 <= p142)))))
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 ((((p9 <= 0)) OR ((1 <= p142)))))
lola: processed formula length: 39
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 <= p9)) AND ((p142 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1967 markings, 1966 edges
lola: ========================================
lola: subprocess 3 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p153)) OR ((p119 <= 0)) OR ((1 <= p241)))))
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 ((((1 <= p153)) OR ((p119 <= 0)) OR ((1 <= p241)))))
lola: processed formula length: 59
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: (((p153 <= 0)) AND ((1 <= p119)) AND ((p241 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 966 markings, 965 edges
lola: ========================================
lola: subprocess 4 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= p247)) AND ((p249 <= 0))) OR (((1 <= p258)) AND ((p301 <= 0))) OR ((((1 <= p219)) OR ((p151 <= 0)) OR ((1 <= p263))) AND (((p68 <= 0)) OR ((1 <= p183)))))))
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 (((((1 <= p247)) AND ((p249 <= 0))) OR (((1 <= p258)) AND ((p301 <= 0))) OR ((((1 <= p219)) OR ((p151 <= 0)) OR ((1 <= p263))) AND (((p68 <= 0)) OR ((1 <= p183)))))))
lola: processed formula length: 176
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: ((((p247 <= 0)) OR ((1 <= p249))) AND (((p258 <= 0)) OR ((1 <= p301))) AND ((((p219 <= 0)) AND ((1 <= p151)) AND ((p263 <= 0))) OR (((1 <= p68)) AND ((p183 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2423 markings, 2651 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no
lola:
preliminary result: no no no no no
lola: memory consumption: 23916 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-50a"
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-50a, 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-158987900000310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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