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-158987815900478.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-C0010N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 4 20:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:12 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.5K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-C0010N0000000100-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591455637876

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 15:00:40] [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 15:00:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 15:00:40] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-06-06 15:00:40] [INFO ] Transformed 33 places.
[2020-06-06 15:00:40] [INFO ] Transformed 22 transitions.
[2020-06-06 15:00:40] [INFO ] Parsed PT model containing 33 places and 22 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10057 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=193 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1]
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 1, 0]
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 15:00:40] [INFO ] Computed 12 place invariants in 10 ms
[2020-06-06 15:00:40] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2020-06-06 15:00:40] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-06 15:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:40] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-06 15:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:00:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-06-06 15:00:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:00:46] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4959 ms returned unknown
[2020-06-06 15:00:46] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 15:00:46] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 15:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:46] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-06 15:00:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:00:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 15:00:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:00:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4985 ms returned (error "Failed to check-sat")
[2020-06-06 15:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:51] [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 1
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-06 15:00:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:00:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:51] [INFO ] [Nat]Absence check using state equation in 92 ms returned unsat
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 15:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:00:51] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 31 transition count 18
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 7 place count 30 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 9 place count 29 transition count 17
Applied a total of 9 rules in 28 ms. Remains 29 /33 variables (removed 4) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 29 cols
[2020-06-06 15:00:51] [INFO ] Computed 12 place invariants in 2 ms
[2020-06-06 15:00:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/33 places, 17/22 transitions.
Incomplete random walk after 1000016 steps, including 2930 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 674 resets, run finished after 1012 ms. (steps per millisecond=988 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 577 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 24684070 steps, run timeout after 30001 ms. (steps per millisecond=822 ) properties seen :[0, 0]
Probabilistic random walk after 24684070 steps, saw 3435799 distinct states, run finished after 30001 ms. (steps per millisecond=822 ) properties seen :[0, 0]
// Phase 1: matrix 17 rows 29 cols
[2020-06-06 15:01:24] [INFO ] Computed 12 place invariants in 2 ms
[2020-06-06 15:01:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-06 15:01:24] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 15:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:01:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-06 15:01:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:01:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 15:01:24] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 15:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 15:01:24] [INFO ] [Nat]Absence check using state equation in 67 ms returned unsat
[2020-06-06 15:01:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-06 15:01:24] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 15:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:01:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-06 15:01:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:01:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 15:01:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:01:33] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9028 ms returned unknown
FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 17/17 transitions.
Applied a total of 0 rules in 7 ms. Remains 29 /29 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 17/17 transitions.
Incomplete random walk after 1000061 steps, including 2929 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 577 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties seen :[0]
Interrupted probabilistic random walk after 26479773 steps, run timeout after 30001 ms. (steps per millisecond=882 ) properties seen :[0]
Probabilistic random walk after 26479773 steps, saw 3658004 distinct states, run finished after 30001 ms. (steps per millisecond=882 ) properties seen :[0]
// Phase 1: matrix 17 rows 29 cols
[2020-06-06 15:02:04] [INFO ] Computed 12 place invariants in 2 ms
[2020-06-06 15:02:04] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 15:02:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 15:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:02:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-06 15:02:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:02:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 15:02:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:02:13] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9038 ms returned unknown
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 17/17 transitions.
Starting structural reductions, iteration 0 : 29/29 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 29 cols
[2020-06-06 15:02:13] [INFO ] Computed 12 place invariants in 1 ms
[2020-06-06 15:02:13] [INFO ] Implicit Places using invariants in 51 ms returned [2, 3, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
[2020-06-06 15:02:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2020-06-06 15:02:13] [INFO ] Computed 9 place invariants in 2 ms
[2020-06-06 15:02:13] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 26/29 places, 17/17 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 16
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 25 cols
[2020-06-06 15:02:13] [INFO ] Computed 9 place invariants in 1 ms
[2020-06-06 15:02:14] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2020-06-06 15:02:14] [INFO ] Computed 9 place invariants in 1 ms
[2020-06-06 15:02:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [0, 2, 4]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 98 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 22/29 places, 16/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2020-06-06 15:02:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:14] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-06 15:02:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 3 iterations. Remains : 22/29 places, 16/17 transitions.
Incomplete random walk after 1000005 steps, including 3034 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 592 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties seen :[0]
Interrupted probabilistic random walk after 31460389 steps, run timeout after 30001 ms. (steps per millisecond=1048 ) properties seen :[0]
Probabilistic random walk after 31460389 steps, saw 4374894 distinct states, run finished after 30001 ms. (steps per millisecond=1048 ) properties seen :[0]
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:45] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-06 15:02:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-06-06 15:02:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-06 15:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:02:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-06 15:02:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:02:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-06 15:02:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:02:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6017 ms returned unknown
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:51] [INFO ] Computed 6 place invariants in 0 ms
[2020-06-06 15:02:51] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:51] [INFO ] Computed 6 place invariants in 5 ms
[2020-06-06 15:02:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2020-06-06 15:02:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:51] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-06 15:02:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Incomplete random walk after 100017 steps, including 303 resets, run finished after 44 ms. (steps per millisecond=2273 ) properties seen :[0]
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:51] [INFO ] Computed 6 place invariants in 0 ms
[2020-06-06 15:02:51] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-06 15:02:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-06 15:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:02:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-06 15:02:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:02:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-06 15:02:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:02:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6013 ms returned unknown
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2020-06-06 15:02:57] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-06 15:02:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-06 15:02:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-06 15:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 15:02:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-06 15:02:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 15:02:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-06 15:03:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 15:03:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6062 ms returned unknown
[2020-06-06 15:03:03] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-06 15:03:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2020-06-06 15:03:04] [INFO ] Flatten gal took : 29 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ GPPP-PT-C0010N0000000100 @ 3570 seconds

FORMULA GPPP-PT-C0010N0000000100-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityCardinality @ GPPP-PT-C0010N0000000100

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 15:03:05 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 16532,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 3,
"skeleton": "TRUE"
},
"net":
{
"arcs": 55,
"conflict_clusters": 10,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
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: 38/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 16 transitions, 16 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: (p7 <= p21)
lola: LP says that atomic proposition is always true: (3 <= p0)
lola: A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: RESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: memory consumption: 16532 KB
lola: time consumption: 6 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-C0010N0000000100"
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-C0010N0000000100, 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-158987815900478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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