Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815900494.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 GPPP-PT-C0100N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Apr 4 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 4 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 4 09:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 3 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000010-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591463126110

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 17:05:28] [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-06 17:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 17:05:29] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-06-06 17:05:29] [INFO ] Transformed 33 places.
[2020-06-06 17:05:29] [INFO ] Transformed 22 transitions.
[2020-06-06 17:05:29] [INFO ] Parsed PT model containing 33 places and 22 transitions in 95 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10003 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 17:05:29] [INFO ] Computed 12 place invariants in 6 ms
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-06 17:05:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:05:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:29] [INFO ] [Nat]Absence check using state equation in 65 ms returned unsat
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 17:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:29] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-06 17:05:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:05:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 17:05:30] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 191 ms returned sat
[2020-06-06 17:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:05:34] [INFO ] [Nat]Absence check using state equation in 4789 ms returned unknown
[2020-06-06 17:05:34] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 17:05:34] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2020-06-06 17:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-06 17:05:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:05:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 17:05:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:05:39] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4989 ms returned (error "Failed to check-sat")
[2020-06-06 17:05:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-06-06 17:05:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 17:05:39] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 17:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-06 17:05:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:05:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 17:05:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:05:44] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4986 ms returned unknown
[2020-06-06 17:05:45] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 17:05:45] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 17:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-06 17:05:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:05:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 17:05:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:05:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4994 ms returned unknown
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 17:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-06 17:05:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:05:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-06 17:05:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-06 17:05:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:05:50] [INFO ] [Nat]Absence check using state equation in 145 ms returned unsat
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 13 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 14 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 30 transition count 19
Applied a total of 6 rules in 53 ms. Remains 30 /33 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 30 cols
[2020-06-06 17:05:50] [INFO ] Computed 11 place invariants in 2 ms
[2020-06-06 17:05:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/33 places, 19/22 transitions.
Incomplete random walk after 1000000 steps, including 3310 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 826 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1054 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1159 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 740 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 24066079 steps, run timeout after 30001 ms. (steps per millisecond=802 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 24066079 steps, saw 3450760 distinct states, run finished after 30001 ms. (steps per millisecond=802 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 19 rows 30 cols
[2020-06-06 17:06:24] [INFO ] Computed 11 place invariants in 2 ms
[2020-06-06 17:06:24] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-06 17:06:24] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-06 17:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:06:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-06 17:06:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:06:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-06 17:06:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:06:34] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 9121 ms returned unknown
[2020-06-06 17:06:34] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-06 17:06:34] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 17:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:06:34] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-06 17:06:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:06:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-06 17:06:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:06:43] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 9037 ms returned unknown
[2020-06-06 17:06:43] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-06 17:06:43] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 17:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:06:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-06 17:06:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:06:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-06 17:06:46] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2805 ms returned sat
[2020-06-06 17:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:06:46] [INFO ] [Nat]Absence check using state equation in 168 ms returned unsat
[2020-06-06 17:06:46] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-06 17:06:46] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-06 17:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:06:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-06 17:06:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:06:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-06 17:06:46] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 17:06:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:06:46] [INFO ] [Nat]Absence check using state equation in 47 ms returned unsat
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 19/19 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 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 28 transition count 17
Applied a total of 4 rules in 6 ms. Remains 28 /30 variables (removed 2) and now considering 17/19 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 17/19 transitions.
Incomplete random walk after 1000000 steps, including 3421 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 856 resets, run finished after 1156 ms. (steps per millisecond=865 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1089 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 27450107 steps, run timeout after 30001 ms. (steps per millisecond=914 ) properties seen :[0, 0]
Probabilistic random walk after 27450107 steps, saw 3961443 distinct states, run finished after 30001 ms. (steps per millisecond=914 ) properties seen :[0, 0]
// Phase 1: matrix 17 rows 28 cols
[2020-06-06 17:07:18] [INFO ] Computed 11 place invariants in 2 ms
[2020-06-06 17:07:18] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-06 17:07:18] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 17:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:07:19] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-06 17:07:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:07:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-06 17:07:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:07:25] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 6109 ms returned unknown
[2020-06-06 17:07:25] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-06 17:07:25] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 17:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:07:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-06 17:07:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:07:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-06 17:07:25] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 9 ms returned sat
[2020-06-06 17:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:07:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:07:34] [INFO ] [Nat]Absence check using state equation in 9028 ms returned unknown
Support contains 10 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 17/17 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 28 cols
[2020-06-06 17:07:34] [INFO ] Computed 11 place invariants in 1 ms
[2020-06-06 17:07:34] [INFO ] Implicit Places using invariants in 42 ms returned [3, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
[2020-06-06 17:07:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2020-06-06 17:07:34] [INFO ] Computed 9 place invariants in 1 ms
[2020-06-06 17:07:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 26/28 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2020-06-06 17:07:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2020-06-06 17:07:34] [INFO ] Computed 9 place invariants in 1 ms
[2020-06-06 17:07:34] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 26/28 places, 17/17 transitions.
Incomplete random walk after 1000021 steps, including 3425 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 856 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1094 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 28398029 steps, run timeout after 30001 ms. (steps per millisecond=946 ) properties seen :[0, 0]
Probabilistic random walk after 28398029 steps, saw 4094631 distinct states, run finished after 30001 ms. (steps per millisecond=946 ) properties seen :[0, 0]
// Phase 1: matrix 17 rows 26 cols
[2020-06-06 17:08:06] [INFO ] Computed 9 place invariants in 2 ms
[2020-06-06 17:08:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-06 17:08:06] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-06 17:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:08:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-06 17:08:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:08:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-06 17:08:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:08:12] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 6084 ms returned unknown
[2020-06-06 17:08:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-06 17:08:12] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-06 17:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:08:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-06 17:08:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:08:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-06 17:08:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:08:18] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 6034 ms returned unknown
Support contains 10 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 17/17 transitions.
Starting structural reductions, iteration 0 : 26/26 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 26 cols
[2020-06-06 17:08:18] [INFO ] Computed 9 place invariants in 1 ms
[2020-06-06 17:08:18] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2020-06-06 17:08:18] [INFO ] Computed 9 place invariants in 0 ms
[2020-06-06 17:08:18] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [0, 2, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 149 ms to find 3 implicit places.
[2020-06-06 17:08:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:08:18] [INFO ] Computed 6 place invariants in 0 ms
[2020-06-06 17:08:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 17/17 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2020-06-06 17:08:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:08:19] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-06 17:08:19] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 17/17 transitions.
Incomplete random walk after 1000014 steps, including 3408 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 856 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1094 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 30709981 steps, run timeout after 30001 ms. (steps per millisecond=1023 ) properties seen :[0, 0]
Probabilistic random walk after 30709981 steps, saw 4419914 distinct states, run finished after 30001 ms. (steps per millisecond=1023 ) properties seen :[0, 0]
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:08:51] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-06 17:08:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-06 17:08:51] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-06 17:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:08:51] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-06 17:08:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:08:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-06 17:08:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:08:57] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6060 ms returned unknown
[2020-06-06 17:08:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-06 17:08:57] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-06 17:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:08:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-06 17:08:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:08:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-06 17:09:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:01] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3947 ms returned sat
[2020-06-06 17:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:10] [INFO ] [Nat]Absence check using state equation in 9155 ms returned unknown
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 17/17 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:09:10] [INFO ] Computed 6 place invariants in 0 ms
[2020-06-06 17:09:10] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:09:10] [INFO ] Computed 6 place invariants in 0 ms
[2020-06-06 17:09:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2020-06-06 17:09:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:09:10] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-06 17:09:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 17/17 transitions.
Incomplete random walk after 100000 steps, including 339 resets, run finished after 98 ms. (steps per millisecond=1020 ) properties seen :[0, 0]
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:09:10] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-06 17:09:11] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-06 17:09:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-06 17:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-06 17:09:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:09:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-06 17:09:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6127 ms returned unknown
[2020-06-06 17:09:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-06 17:09:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-06 17:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-06 17:09:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:09:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-06 17:09:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4118 ms returned sat
[2020-06-06 17:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:30] [INFO ] [Nat]Absence check using state equation in 9396 ms returned unknown
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 23 cols
[2020-06-06 17:09:30] [INFO ] Computed 6 place invariants in 0 ms
[2020-06-06 17:09:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-06 17:09:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-06 17:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-06 17:09:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:09:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-06 17:09:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6022 ms returned unknown
[2020-06-06 17:09:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-06 17:09:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-06 17:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-06 17:09:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:09:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-06 17:09:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3915 ms returned sat
[2020-06-06 17:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:09:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 17:09:49] [INFO ] [Nat]Absence check using state equation in 9092 ms returned unknown
[2020-06-06 17:09:49] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-06 17:09:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2020-06-06 17:09:50] [INFO ] Flatten gal took : 29 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ GPPP-PT-C0100N0000000010 @ 3570 seconds

FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3174
rslt: Output for ReachabilityCardinality @ GPPP-PT-C0100N0000000010

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 17:09:51 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p7 <= p17)))",
"processed_size": 19,
"rewrites": 2
},
"result":
{
"edges": 25613086,
"markings": 8925900,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": "E (F (((p9 <= p16) AND (p2 <= p13) AND (p20 <= p10) AND ((p21 <= p7) OR (3 <= p15)))))",
"processed_size": 87,
"rewrites": 1
},
"result":
{
"edges": 393329510,
"markings": 147788857,
"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": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 16832,
"runtime": 396.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 57,
"conflict_clusters": 11,
"places": 23,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 17
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 40/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 17 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F (((p9 <= p16) AND (p2 <= p13) AND (p20 <= p10) AND ((p21 <= p7) OR (3 <= p15))))) : A (G ((p7 <= p17)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p7 <= p17)))
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 ((p7 <= p17)))
lola: processed formula length: 19
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: (p17 + 1 <= p7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: error: :139: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 2324148 markings, 6648761 edges, 464830 markings/sec, 0 secs
lola: sara is running 5 secs || 4596298 markings, 13205400 edges, 454430 markings/sec, 5 secs
lola: sara is running 10 secs || 6894414 markings, 19822014 edges, 459623 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8925900 markings, 25613086 edges
lola: ========================================
lola: subprocess 1 will run for 3543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9 <= p16) AND (p2 <= p13) AND (p20 <= p10) AND ((p21 <= p7) OR (3 <= p15)))))
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 (((p9 <= p16) AND (p2 <= p13) AND (p20 <= p10) AND ((p21 <= p7) OR (3 <= p15)))))
lola: processed formula length: 87
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: ((p9 <= p16) AND (p2 <= p13) AND (p20 <= p10) AND ((p21 <= p7) OR (3 <= p15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: error: :139: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 2378295 markings, 6891328 edges, 475659 markings/sec, 0 secs
lola: sara is running 5 secs || 4858775 markings, 13349153 edges, 496096 markings/sec, 5 secs
lola: sara is running 10 secs || 7314255 markings, 19661586 edges, 491096 markings/sec, 10 secs
lola: sara is running 15 secs || 9834590 markings, 26097923 edges, 504067 markings/sec, 15 secs
lola: sara is running 20 secs || 12374963 markings, 32552947 edges, 508075 markings/sec, 20 secs
lola: sara is running 25 secs || 14748564 markings, 38935123 edges, 474720 markings/sec, 25 secs
lola: sara is running 30 secs || 16970694 markings, 45209284 edges, 444426 markings/sec, 30 secs
lola: sara is running 35 secs || 18983972 markings, 50686075 edges, 402656 markings/sec, 35 secs
lola: sara is running 40 secs || 20988473 markings, 55983714 edges, 400900 markings/sec, 40 secs
lola: sara is running 45 secs || 23170977 markings, 61677101 edges, 436501 markings/sec, 45 secs
lola: sara is running 50 secs || 25089434 markings, 66796463 edges, 383691 markings/sec, 50 secs
lola: sara is running 55 secs || 27073324 markings, 72114873 edges, 396778 markings/sec, 55 secs
lola: sara is running 60 secs || 29016352 markings, 77321924 edges, 388606 markings/sec, 60 secs
lola: sara is running 65 secs || 30972717 markings, 82581424 edges, 391273 markings/sec, 65 secs
lola: sara is running 70 secs || 32923633 markings, 87826775 edges, 390183 markings/sec, 70 secs
lola: sara is running 75 secs || 34869533 markings, 93056890 edges, 389180 markings/sec, 75 secs
lola: sara is running 80 secs || 36798536 markings, 98264523 edges, 385801 markings/sec, 80 secs
lola: sara is running 85 secs || 38749755 markings, 103506547 edges, 390244 markings/sec, 85 secs
lola: sara is running 90 secs || 40726728 markings, 108845178 edges, 395395 markings/sec, 90 secs
lola: sara is running 95 secs || 42736388 markings, 114239684 edges, 401932 markings/sec, 95 secs
lola: sara is running 100 secs || 44970174 markings, 119981236 edges, 446757 markings/sec, 100 secs
lola: sara is running 105 secs || 47152994 markings, 125571228 edges, 436564 markings/sec, 105 secs
lola: sara is running 110 secs || 49297173 markings, 131038871 edges, 428836 markings/sec, 110 secs
lola: sara is running 115 secs || 51421454 markings, 136439865 edges, 424856 markings/sec, 115 secs
lola: sara is running 120 secs || 53547921 markings, 141836189 edges, 425293 markings/sec, 120 secs
lola: sara is running 125 secs || 55700476 markings, 147302622 edges, 430511 markings/sec, 125 secs
lola: sara is running 130 secs || 57835033 markings, 152717227 edges, 426911 markings/sec, 130 secs
lola: sara is running 135 secs || 60002257 markings, 158188959 edges, 433445 markings/sec, 135 secs
lola: sara is running 140 secs || 62164211 markings, 163677720 edges, 432391 markings/sec, 140 secs
lola: sara is running 145 secs || 64328005 markings, 169144370 edges, 432759 markings/sec, 145 secs
lola: sara is running 150 secs || 66554080 markings, 174754322 edges, 445215 markings/sec, 150 secs
lola: sara is running 155 secs || 68785712 markings, 180376110 edges, 446326 markings/sec, 155 secs
lola: sara is running 160 secs || 71031127 markings, 186035885 edges, 449083 markings/sec, 160 secs
lola: sara is running 165 secs || 72861397 markings, 190763089 edges, 366054 markings/sec, 165 secs
lola: sara is running 170 secs || 74499363 markings, 195085934 edges, 327593 markings/sec, 170 secs
lola: sara is running 175 secs || 76108703 markings, 199328956 edges, 321868 markings/sec, 175 secs
lola: sara is running 180 secs || 77718219 markings, 203572969 edges, 321903 markings/sec, 180 secs
lola: sara is running 185 secs || 79341771 markings, 207851073 edges, 324710 markings/sec, 185 secs
lola: sara is running 190 secs || 80972100 markings, 212150552 edges, 326066 markings/sec, 190 secs
lola: sara is running 195 secs || 82602723 markings, 216460885 edges, 326125 markings/sec, 195 secs
lola: sara is running 200 secs || 84243806 markings, 220795274 edges, 328217 markings/sec, 200 secs
lola: sara is running 205 secs || 85896602 markings, 225163498 edges, 330559 markings/sec, 205 secs
lola: sara is running 210 secs || 87565840 markings, 229577525 edges, 333848 markings/sec, 210 secs
lola: sara is running 215 secs || 89257827 markings, 234014230 edges, 338397 markings/sec, 215 secs
lola: sara is running 220 secs || 90945457 markings, 238423325 edges, 337526 markings/sec, 220 secs
lola: sara is running 225 secs || 92762293 markings, 243162502 edges, 363367 markings/sec, 225 secs
lola: sara is running 230 secs || 94764163 markings, 248484856 edges, 400374 markings/sec, 230 secs
lola: sara is running 235 secs || 96785148 markings, 253695076 edges, 404197 markings/sec, 235 secs
lola: sara is running 240 secs || 98618109 markings, 258409794 edges, 366592 markings/sec, 240 secs
lola: sara is running 245 secs || 100445063 markings, 263080135 edges, 365391 markings/sec, 245 secs
lola: sara is running 250 secs || 102493109 markings, 268586601 edges, 409609 markings/sec, 250 secs
lola: sara is running 255 secs || 104543104 markings, 274210681 edges, 409999 markings/sec, 255 secs
lola: sara is running 260 secs || 106553991 markings, 279743074 edges, 402177 markings/sec, 260 secs
lola: sara is running 265 secs || 108524555 markings, 285162138 edges, 394113 markings/sec, 265 secs
lola: sara is running 270 secs || 110489690 markings, 290574504 edges, 393027 markings/sec, 270 secs
lola: sara is running 275 secs || 112419856 markings, 295890748 edges, 386033 markings/sec, 275 secs
lola: sara is running 280 secs || 114414405 markings, 301379484 edges, 398910 markings/sec, 280 secs
lola: sara is running 285 secs || 116414036 markings, 306887851 edges, 399926 markings/sec, 285 secs
lola: sara is running 290 secs || 118402929 markings, 312369111 edges, 397779 markings/sec, 290 secs
lola: sara is running 295 secs || 120392792 markings, 317851932 edges, 397973 markings/sec, 295 secs
lola: sara is running 300 secs || 122405607 markings, 323410993 edges, 402563 markings/sec, 300 secs
lola: sara is running 305 secs || 124422802 markings, 328970799 edges, 403439 markings/sec, 305 secs
lola: sara is running 310 secs || 126388480 markings, 334393217 edges, 393136 markings/sec, 310 secs
lola: sara is running 315 secs || 128381024 markings, 339879734 edges, 398509 markings/sec, 315 secs
lola: sara is running 320 secs || 130357364 markings, 345337764 edges, 395268 markings/sec, 320 secs
lola: sara is running 325 secs || 132354562 markings, 350842777 edges, 399440 markings/sec, 325 secs
lola: sara is running 330 secs || 134375234 markings, 356403881 edges, 404134 markings/sec, 330 secs
lola: sara is running 335 secs || 136379924 markings, 361943477 edges, 400938 markings/sec, 335 secs
lola: sara is running 340 secs || 138380652 markings, 367462800 edges, 400146 markings/sec, 340 secs
lola: sara is running 345 secs || 140403537 markings, 373030535 edges, 404577 markings/sec, 345 secs
lola: sara is running 350 secs || 142394718 markings, 378561105 edges, 398236 markings/sec, 350 secs
lola: sara is running 355 secs || 144458161 markings, 384176339 edges, 412689 markings/sec, 355 secs
lola: sara is running 360 secs || 146425030 markings, 389604129 edges, 393374 markings/sec, 360 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 147788857 markings, 393329510 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: memory consumption: 16832 KB
lola: time consumption: 396 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="GPPP-PT-C0100N0000000010"
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 GPPP-PT-C0100N0000000010, 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 r170-smll-158987815900494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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