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.r081-smll-158922978000502.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 itstools
Input is GPPP-PT-C0100N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922978000502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.6K Apr 4 20:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 4 20:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 4 09:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.2K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K 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-C0100N0000000100-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589787584916

[2020-05-18 07:39:47] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 07:39:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:39:48] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-18 07:39:48] [INFO ] Transformed 33 places.
[2020-05-18 07:39:48] [INFO ] Transformed 22 transitions.
[2020-05-18 07:39:48] [INFO ] Parsed PT model containing 33 places and 22 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10076 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=287 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1]
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1]
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 07:39:48] [INFO ] Computed 12 place invariants in 9 ms
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:48] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-18 07:39:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:39:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2020-05-18 07:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:39:53] [INFO ] [Nat]Absence check using state equation in 4959 ms returned unknown
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 07:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 07:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:53] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-18 07:39:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:39:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 07:39:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:39:58] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4970 ms returned (error "Failed to check-sat")
[2020-05-18 07:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:58] [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 5
[2020-05-18 07:39:59] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 07:39:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 07:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:39:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-18 07:39:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:39:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 07:39:59] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 22 ms returned sat
[2020-05-18 07:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 07:40:01] [INFO ] [Nat]Absence check using state equation in 2173 ms returned sat
[2020-05-18 07:40:01] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints in 5 ms.
[2020-05-18 07:40:01] [INFO ] Added : 15 causal constraints over 3 iterations in 47 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 199400 steps, including 99 resets, run finished after 495 ms. (steps per millisecond=402 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 32 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 31 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 28 transition count 17
Applied a total of 10 rules in 25 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2020-05-18 07:40:01] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 07:40:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/33 places, 17/22 transitions.
Incomplete random walk after 1000051 steps, including 481 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 142 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties seen :[1, 0]
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 165 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties seen :[0]
// Phase 1: matrix 17 rows 28 cols
[2020-05-18 07:40:04] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 07:40:04] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-05-18 07:40:04] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2020-05-18 07:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:40:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-18 07:40:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:40:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-18 07:40:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:40:13] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 9079 ms returned unknown
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 17/17 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 28 transition count 16
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 27 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 25 transition count 15
Applied a total of 5 rules in 4 ms. Remains 25 /28 variables (removed 3) and now considering 15/17 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/28 places, 15/17 transitions.
Incomplete random walk after 1000024 steps, including 791 resets, run finished after 318 ms. (steps per millisecond=3144 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 333 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties seen :[0]
Interrupted probabilistic random walk after 26770569 steps, run timeout after 30001 ms. (steps per millisecond=892 ) properties seen :[0]
Probabilistic random walk after 26770569 steps, saw 4293868 distinct states, run finished after 30001 ms. (steps per millisecond=892 ) properties seen :[0]
// Phase 1: matrix 15 rows 25 cols
[2020-05-18 07:40:44] [INFO ] Computed 10 place invariants in 2 ms
[2020-05-18 07:40:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 07:40:44] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 07:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:40:44] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-18 07:40:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:40:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 07:40:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:40:50] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6034 ms returned unknown
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 15/15 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 25 cols
[2020-05-18 07:40:50] [INFO ] Computed 10 place invariants in 1 ms
[2020-05-18 07:40:50] [INFO ] Implicit Places using invariants in 64 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
[2020-05-18 07:40:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2020-05-18 07:40:50] [INFO ] Computed 8 place invariants in 1 ms
[2020-05-18 07:40:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 15/15 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 12
Applied a total of 7 rules in 3 ms. Remains 19 /23 variables (removed 4) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 19 cols
[2020-05-18 07:40:50] [INFO ] Computed 7 place invariants in 0 ms
[2020-05-18 07:40:51] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 12 rows 19 cols
[2020-05-18 07:40:51] [INFO ] Computed 7 place invariants in 0 ms
[2020-05-18 07:40:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 85 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 18/25 places, 12/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2020-05-18 07:40:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:40:51] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-18 07:40:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 3 iterations. Remains : 18/25 places, 12/15 transitions.
Incomplete random walk after 1000344 steps, including 815 resets, run finished after 255 ms. (steps per millisecond=3922 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 349 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties seen :[0]
Interrupted probabilistic random walk after 32088042 steps, run timeout after 30001 ms. (steps per millisecond=1069 ) properties seen :[0]
Probabilistic random walk after 32088042 steps, saw 6500453 distinct states, run finished after 30001 ms. (steps per millisecond=1069 ) properties seen :[0]
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:22] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-18 07:41:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-18 07:41:22] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-18 07:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:41:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-05-18 07:41:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:41:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-18 07:41:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:41:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6031 ms returned unknown
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Starting structural reductions, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:28] [INFO ] Computed 6 place invariants in 2 ms
[2020-05-18 07:41:28] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:28] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-18 07:41:28] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2020-05-18 07:41:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:28] [INFO ] Computed 6 place invariants in 0 ms
[2020-05-18 07:41:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Incomplete random walk after 100096 steps, including 81 resets, run finished after 29 ms. (steps per millisecond=3451 ) properties seen :[0]
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:28] [INFO ] Computed 6 place invariants in 1 ms
[2020-05-18 07:41:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-18 07:41:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-18 07:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:41:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-18 07:41:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:41:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-18 07:41:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:41:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6019 ms returned unknown
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:34] [INFO ] Computed 6 place invariants in 0 ms
[2020-05-18 07:41:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-18 07:41:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-18 07:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 07:41:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-05-18 07:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 07:41:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-18 07:41:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 07:41:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6017 ms returned unknown
[2020-05-18 07:41:40] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 07:41:40] [INFO ] Flatten gal took : 7 ms
[2020-05-18 07:41:40] [INFO ] Applying decomposition
[2020-05-18 07:41:40] [INFO ] Flatten gal took : 10 ms
[2020-05-18 07:41:40] [INFO ] Input system was already deterministic with 12 transitions.
[2020-05-18 07:41:40] [INFO ] Input system was already deterministic with 12 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12545111933979159155.txt, -o, /tmp/graph12545111933979159155.bin, -w, /tmp/graph12545111933979159155.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:41] [INFO ] Computed 6 place invariants in 1 ms
inv : a1 + a2 = 200
inv : Pi + ATP + Ru5P + Xu5P + R5P + S7P + E4P + F6P + G6P + DHAP + 700*start = 1100
inv : 16*ATP + 44*Ru5P + 37*Xu5P + 1444*R5P + 1451*S7P + 37*E4P + 44*F6P + 44*G6P + 30*DHAP + 11200*start + 28*Gluc - 7*a2 + 2*c2 = 17600
inv : c1 + c2 = 700
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P + 151*E4P - 600*F6P - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P - 151*E4P + 600*F6P + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
Total of 6 invariants.
[2020-05-18 07:41:41] [INFO ] Computed 6 place invariants in 2 ms
[2020-05-18 07:41:41] [INFO ] Ran tautology test, simplified 0 / 1 in 155 ms.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12545111933979159155.bin, -l, -1, -v, -w, /tmp/graph12545111933979159155.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=0 took 21 ms
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=1 took 1 ms
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=2 took 2 ms
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=3 took 16 ms
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=4 took 7 ms
[2020-05-18 07:41:41] [INFO ] Decomposing Gal with order
[2020-05-18 07:41:41] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 18 cols
[2020-05-18 07:41:41] [INFO ] Computed 6 place invariants in 1 ms
inv : a1 + a2 = 200
inv : Pi + ATP + Ru5P + Xu5P + R5P + S7P + E4P + F6P + G6P + DHAP + 700*start = 1100
inv : 16*ATP + 44*Ru5P + 37*Xu5P + 1444*R5P + 1451*S7P + 37*E4P + 44*F6P + 44*G6P + 30*DHAP + 11200*start + 28*Gluc - 7*a2 + 2*c2 = 17600
inv : c1 + c2 = 700
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P + 151*E4P - 600*F6P - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P - 151*E4P + 600*F6P + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
Total of 6 invariants.
[2020-05-18 07:41:41] [INFO ] Computed 6 place invariants in 2 ms
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=5 took 19 ms
[2020-05-18 07:41:41] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=6 took 44 ms
[2020-05-18 07:41:41] [INFO ] Proved 18 variables to be positive in 140 ms
[2020-05-18 07:41:41] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2020-05-18 07:41:41] [INFO ] Computation of disable matrix completed :0/12 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:41:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:41:41] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2020-05-18 07:41:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:41:41] [INFO ] Flatten gal took : 71 ms
[2020-05-18 07:41:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-18 07:41:41] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 3 ms
[2020-05-18 07:41:41] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=7 took 108 ms
[2020-05-18 07:41:41] [INFO ] Proved 18 variables to be positive in 160 ms

[2020-05-18 07:41:41] [INFO ] Computing symmetric co enabling matrix : 12 transitions.
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 with value :((gu0.Pi<=gu0.b2)&&(gi1.gu2.Gluc>=1))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
[2020-05-18 07:41:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=8 took 332 ms
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-18 07:41:41] [INFO ] Computation of Finished co-enabling matrix. took 536 ms. Total solver calls (SAT/UNSAT): 66(63/3)
[2020-05-18 07:41:41] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
SDD proceeding with computation, new max is 4096
[2020-05-18 07:41:42] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=9 took 422 ms
SDD proceeding with computation, new max is 8192
[2020-05-18 07:41:42] [INFO ] Computation of Completed DNA matrix. took 653 ms. Total solver calls (SAT/UNSAT): 22(0/22)
[2020-05-18 07:41:42] [INFO ] Built C files in 1542ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
[2020-05-18 07:41:42] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=10 took 548 ms
Compilation finished in 470 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000000100ReachabilityCardinality11==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000000100ReachabilityCardinality11==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000000100ReachabilityCardinality11==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 07:41:43] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=11 took 838 ms
SDD proceeding with computation, new max is 16384
[2020-05-18 07:41:44] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=12 took 903 ms
[2020-05-18 07:41:45] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=13 took 1488 ms
[2020-05-18 07:41:47] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=14 took 1685 ms
[2020-05-18 07:41:49] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=15 took 2017 ms
[2020-05-18 07:41:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=16 took 1931 ms
[2020-05-18 07:41:53] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=17 took 2405 ms
SDD proceeding with computation, new max is 32768
[2020-05-18 07:41:57] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=18 took 3218 ms
[2020-05-18 07:42:00] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=19 took 2969 ms
[2020-05-18 07:42:04] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=20 took 4214 ms
[2020-05-18 07:42:09] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=21 took 5015 ms
[2020-05-18 07:42:14] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=22 took 4760 ms
[2020-05-18 07:42:19] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=23 took 5299 ms
[2020-05-18 07:42:26] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=24 took 6857 ms
[2020-05-18 07:42:36] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=25 took 10139 ms
[2020-05-18 07:42:46] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=26 took 10258 ms
[2020-05-18 07:42:56] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=27 took 9496 ms
[2020-05-18 07:43:07] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=28 took 11490 ms
SDD proceeding with computation, new max is 65536
[2020-05-18 07:43:17] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=29 took 10029 ms
[2020-05-18 07:43:28] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=30 took 10611 ms
[2020-05-18 07:43:41] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=31 took 13572 ms
[2020-05-18 07:43:56] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=32 took 14974 ms
[2020-05-18 07:44:13] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=33 took 16333 ms
[2020-05-18 07:44:31] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=34 took 18205 ms
[2020-05-18 07:44:52] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=35 took 21351 ms
[2020-05-18 07:45:14] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=36 took 21394 ms
SDD proceeding with computation, new max is 131072
[2020-05-18 07:45:35] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=37 took 21459 ms
[2020-05-18 07:45:59] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=38 took 23829 ms
[2020-05-18 07:46:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesGPPP-PT-C0100N0000000100-ReachabilityCardinality-11
[2020-05-18 07:46:16] [INFO ] KInduction solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(SAT) depth K=0 took 274798 ms
[2020-05-18 07:46:16] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate GPPP-PT-C0100N0000000100-ReachabilityCardinality-11
[2020-05-18 07:46:16] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for GPPP-PT-C0100N0000000100-ReachabilityCardinality-11
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2020-05-18 07:46:16] [INFO ] KInduction solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(FALSE) depth K=1 took 59 ms
[2020-05-18 07:46:24] [INFO ] BMC solution for property GPPP-PT-C0100N0000000100-ReachabilityCardinality-11(UNSAT) depth K=39 took 25241 ms
[2020-05-18 07:46:24] [INFO ] SMT solved all 1 properties. Interrupting other analysis methods.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589787985807

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-C0100N0000000100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPPP-PT-C0100N0000000100, 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 r081-smll-158922978000502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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