fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r081-smll-158922978000511
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.360 149994.00 256495.00 436.90 TFFFTTFTTTFFTFTT normal

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-158922978000511.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-C0100N0000001000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922978000511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.0K Apr 4 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 4 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 4 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 4 09:14 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 24K 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 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:51 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-C0100N0000001000-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589797808490

[2020-05-18 10:30:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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 10:30:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 10:30:11] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-05-18 10:30:11] [INFO ] Transformed 33 places.
[2020-05-18 10:30:11] [INFO ] Transformed 22 transitions.
[2020-05-18 10:30:11] [INFO ] Parsed PT model containing 33 places and 22 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10347 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=304 ) properties seen :[1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0]
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 1, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 10:30:11] [INFO ] Computed 12 place invariants in 10 ms
[2020-05-18 10:30:11] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2020-05-18 10:30:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned unsat
[2020-05-18 10:30:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 10:30:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 10:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 10:30:11] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2020-05-18 10:30:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-18 10:30:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-05-18 10:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 10:30:12] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-18 10:30:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 10:30:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-18 10:30:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 10:30:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4963 ms returned (error "Failed to check-sat")
[2020-05-18 10:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 10:30:17] [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 2
[2020-05-18 10:30:17] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 12 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 31 transition count 20
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 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Applied a total of 7 rules in 23 ms. Remains 29 /33 variables (removed 4) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 29 cols
[2020-05-18 10:30:17] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 10:30:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/33 places, 19/22 transitions.
Incomplete random walk after 1000180 steps, including 473 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1317 ms. (steps per millisecond=759 ) properties seen :[0]
Interrupted probabilistic random walk after 26547939 steps, run timeout after 30001 ms. (steps per millisecond=884 ) properties seen :[0]
Probabilistic random walk after 26547939 steps, saw 3386876 distinct states, run finished after 30001 ms. (steps per millisecond=884 ) properties seen :[0]
// Phase 1: matrix 19 rows 29 cols
[2020-05-18 10:30:49] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 10:30:49] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-18 10:30:49] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 10:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 10:30:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-18 10:30:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 10:30:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-18 10:30:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 10:30:58] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 9289 ms returned unknown
Support contains 12 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 19/19 transitions.
Starting structural reductions, iteration 0 : 29/29 places, 19/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 19/19 (removed 0) transitions.
// Phase 1: matrix 19 rows 29 cols
[2020-05-18 10:30:58] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 10:30:58] [INFO ] Implicit Places using invariants in 44 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
[2020-05-18 10:30:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2020-05-18 10:30:58] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 10:30:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 27/29 places, 19/19 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 26 transition count 18
Applied a total of 2 rules in 3 ms. Remains 26 /27 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:30:58] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-18 10:30:58] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:30:58] [INFO ] Computed 9 place invariants in 2 ms
[2020-05-18 10:30:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/29 places, 18/19 transitions.
Incomplete random walk after 1000173 steps, including 476 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties seen :[0]
Interrupted probabilistic random walk after 26892251 steps, run timeout after 30001 ms. (steps per millisecond=896 ) properties seen :[0]
Probabilistic random walk after 26892251 steps, saw 3496479 distinct states, run finished after 30001 ms. (steps per millisecond=896 ) properties seen :[0]
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:29] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 10:31:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-18 10:31:29] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-18 10:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 10:31:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-18 10:31:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 10:31:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-18 10:31:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 10:31:36] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 6754 ms returned unknown
Support contains 12 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:36] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 10:31:36] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:36] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 10:31:36] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2020-05-18 10:31:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:36] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-18 10:31:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
Incomplete random walk after 100098 steps, including 47 resets, run finished after 35 ms. (steps per millisecond=2859 ) properties seen :[0]
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:36] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-18 10:31:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-18 10:31:37] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 7 ms returned sat
[2020-05-18 10:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 10:31:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-18 10:31:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 10:31:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 10:31:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 10:31:44] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 6973 ms returned unknown
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:44] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-18 10:31:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-18 10:31:44] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-18 10:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 10:31:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-18 10:31:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 10:31:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 10:31:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 10:31:51] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 6959 ms returned unknown
[2020-05-18 10:31:51] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 10:31:51] [INFO ] Flatten gal took : 7 ms
Built C files in :
/home/mcc/execution
[2020-05-18 10:31:51] [INFO ] Applying decomposition
[2020-05-18 10:31:51] [INFO ] Flatten gal took : 13 ms
[2020-05-18 10:31:51] [INFO ] Input system was already deterministic with 18 transitions.
[2020-05-18 10:31:51] [INFO ] Input system was already deterministic with 18 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:51] [INFO ] Computed 9 place invariants in 1 ms
inv : -Ru5P - Xu5P - R5P - S7P - GAP - E4P - F6P - G6P - 2*FBP - DHAP - _1_3_BPG + ADP + 700*start + Lac = 700
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P + 300*GAP - 151*E4P + 600*F6P + 600*FBP + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
inv : 28*Ru5P + 21*Xu5P + 1428*R5P + 1435*S7P + 14*GAP + 21*E4P + 28*F6P + 28*G6P + 28*FBP + 14*DHAP + 16*_1_3_BPG + 16*_3PG + 11200*start + 16*Lac + 28*Gluc - 7*a2 + 2*c2 = 11200
inv : Pi + _1_3_BPG + _3PG + 700*start + Lac = 700
inv : c1 + c2 = 700
inv : ATP + Ru5P + Xu5P + R5P + S7P + GAP + E4P + F6P + G6P + 2*FBP + DHAP + _1_3_BPG - Lac = 4000
inv : a1 + a2 = 200
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P - 300*GAP + 151*E4P - 600*F6P - 600*FBP - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
inv : NADPplus + NADPH = 2000
Total of 9 invariants.
[2020-05-18 10:31:51] [INFO ] Computed 9 place invariants in 2 ms
[2020-05-18 10:31:51] [INFO ] Ran tautology test, simplified 0 / 1 in 129 ms.
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/graph10920311577135518555.txt, -o, /tmp/graph10920311577135518555.bin, -w, /tmp/graph10920311577135518555.weights], workingDir=null]
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=0 took 6 ms
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=1 took 4 ms
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=2 took 4 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/graph10920311577135518555.bin, -l, -1, -v, -w, /tmp/graph10920311577135518555.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=3 took 21 ms
[2020-05-18 10:31:51] [INFO ] Decomposing Gal with order
[2020-05-18 10:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=4 took 20 ms
[2020-05-18 10:31:51] [INFO ] Removed a total of 2 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 26 cols
[2020-05-18 10:31:51] [INFO ] Computed 9 place invariants in 1 ms
inv : -Ru5P - Xu5P - R5P - S7P - GAP - E4P - F6P - G6P - 2*FBP - DHAP - _1_3_BPG + ADP + 700*start + Lac = 700
inv : -2*Ru5P + 1051*Xu5P - 210602*R5P - 209851*S7P + 300*GAP - 151*E4P + 600*F6P + 600*FBP + 300*DHAP + 2*b1 + 1053*a2 - 300*c2 = 600
inv : 28*Ru5P + 21*Xu5P + 1428*R5P + 1435*S7P + 14*GAP + 21*E4P + 28*F6P + 28*G6P + 28*FBP + 14*DHAP + 16*_1_3_BPG + 16*_3PG + 11200*start + 16*Lac + 28*Gluc - 7*a2 + 2*c2 = 11200
inv : Pi + _1_3_BPG + _3PG + 700*start + Lac = 700
inv : c1 + c2 = 700
inv : ATP + Ru5P + Xu5P + R5P + S7P + GAP + E4P + F6P + G6P + 2*FBP + DHAP + _1_3_BPG - Lac = 4000
inv : a1 + a2 = 200
inv : 2*Ru5P - 1051*Xu5P + 210602*R5P + 209851*S7P - 300*GAP + 151*E4P - 600*F6P - 600*FBP - 300*DHAP + 2*b2 - 1053*a2 + 300*c2 = 0
inv : NADPplus + NADPH = 2000
Total of 9 invariants.
[2020-05-18 10:31:51] [INFO ] Computed 9 place invariants in 3 ms
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=5 took 37 ms
[2020-05-18 10:31:51] [INFO ] Proved 26 variables to be positive in 159 ms
[2020-05-18 10:31:51] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-18 10:31:51] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 10:31:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 10:31:51] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-18 10:31:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 10:31:51] [INFO ] Flatten gal took : 73 ms
[2020-05-18 10:31:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-18 10:31:51] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 3 ms
[2020-05-18 10:31:51] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.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/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

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/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=6 took 123 ms
Loading property file ReachabilityFireability.prop.
Read [reachable] property : GPPP-PT-C0100N0000001000-ReachabilityFireability-13 with value :(((((((((i1.u0.ATP>=1)&&(i1.u3.Gluc>=1))&&(i1.u0._1_3_BPG>=1))&&(i1.u0.ADP>=1))&&(i4.u2.DHAP>=1))&&(u1.NADPplus>=2))&&(u4.G6P>=1))&&(u4.b2>=1))&&((i1.u3.start>=1)||(((u5.S7P>=1)&&(i4.u2.GAP>=1))&&(i4.u6.c1>=700))))
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
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
[2020-05-18 10:31:51] [INFO ] Proved 26 variables to be positive in 243 ms
[2020-05-18 10:31:51] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=7 took 131 ms
[2020-05-18 10:31:51] [INFO ] Computing symmetric co enabling matrix : 18 transitions.
SDD proceeding with computation, new max is 64
[2020-05-18 10:31:52] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=8 took 406 ms
SDD proceeding with computation, new max is 128
[2020-05-18 10:31:52] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=9 took 544 ms
[2020-05-18 10:31:53] [INFO ] Computation of Finished co-enabling matrix. took 1259 ms. Total solver calls (SAT/UNSAT): 137(110/27)
[2020-05-18 10:31:53] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2020-05-18 10:31:53] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=10 took 1012 ms
[2020-05-18 10:31:54] [INFO ] Computation of Completed DNA matrix. took 1190 ms. Total solver calls (SAT/UNSAT): 37(0/37)
[2020-05-18 10:31:54] [INFO ] Built C files in 2961ms 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]
Compilation finished in 555 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, GPPPPTC0100N0000001000ReachabilityFireability13==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, GPPPPTC0100N0000001000ReachabilityFireability13==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, GPPPPTC0100N0000001000ReachabilityFireability13==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 10:31:54] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=11 took 1236 ms
[2020-05-18 10:31:56] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=12 took 1819 ms
SDD proceeding with computation, new max is 256
[2020-05-18 10:32:00] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=13 took 3966 ms
[2020-05-18 10:32:05] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=14 took 4919 ms
[2020-05-18 10:32:14] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=15 took 9073 ms
[2020-05-18 10:32:34] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesGPPP-PT-C0100N0000001000-ReachabilityFireability-13
[2020-05-18 10:32:34] [INFO ] KInduction solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(SAT) depth K=0 took 43134 ms
[2020-05-18 10:32:34] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate GPPP-PT-C0100N0000001000-ReachabilityFireability-13
[2020-05-18 10:32:34] [INFO ] Induction result is UNSAT, successfully proved induction at step 1 for GPPP-PT-C0100N0000001000-ReachabilityFireability-13
FORMULA GPPP-PT-C0100N0000001000-ReachabilityFireability-13 FALSE TECHNIQUES SAT_SMT K_INDUCTION(1)
[2020-05-18 10:32:34] [INFO ] KInduction solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(FALSE) depth K=1 took 26 ms
[2020-05-18 10:32:37] [INFO ] BMC solution for property GPPP-PT-C0100N0000001000-ReachabilityFireability-13(UNSAT) depth K=16 took 22772 ms
[2020-05-18 10:32:37] [INFO ] SMT solved all 1 properties. Interrupting other analysis methods.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589797958484

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-C0100N0000001000"
export BK_EXAMINATION="ReachabilityFireability"
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-C0100N0000001000, examination is ReachabilityFireability"
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-158922978000511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;