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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.0K Apr 4 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 4 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 4 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.2K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.6K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-C0100N0000010000-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589800112956

[2020-05-18 11:08:35] [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 11:08:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 11:08:35] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-05-18 11:08:35] [INFO ] Transformed 33 places.
[2020-05-18 11:08:35] [INFO ] Transformed 22 transitions.
[2020-05-18 11:08:35] [INFO ] Parsed PT model containing 33 places and 22 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10096 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=458 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0]
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 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, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-05-18 11:08:36] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 11:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:36] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-18 11:08:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:08:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-18 11:08:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:08:41] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4969 ms returned (error "Failed to check-sat")
[2020-05-18 11:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:41] [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: Broken pipe") while checking expression at index 3
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-05-18 11:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:41] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-05-18 11:08:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:08:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-18 11:08:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:08:46] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4987 ms returned unknown
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 13 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
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 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 5 place count 30 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 8 place count 28 transition count 19
Applied a total of 8 rules in 28 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2020-05-18 11:08:46] [INFO ] Computed 10 place invariants in 3 ms
[2020-05-18 11:08:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/33 places, 19/22 transitions.
Incomplete random walk after 1000029 steps, including 754 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties seen :[1, 0]
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties seen :[0]
// Phase 1: matrix 19 rows 28 cols
[2020-05-18 11:08:48] [INFO ] Computed 10 place invariants in 3 ms
[2020-05-18 11:08:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-18 11:08:48] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:08:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-18 11:08:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:08:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 11:08:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:08:54] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6015 ms returned unknown
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 19/19 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 18
Deduced a syphon composed of 1 places in 1 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 18
Applied a total of 2 rules in 5 ms. Remains 27 /28 variables (removed 1) and now considering 18/19 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/28 places, 18/19 transitions.
Incomplete random walk after 1000392 steps, including 762 resets, run finished after 372 ms. (steps per millisecond=2689 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties seen :[0]
Interrupted probabilistic random walk after 26269209 steps, run timeout after 30001 ms. (steps per millisecond=875 ) properties seen :[0]
Probabilistic random walk after 26269209 steps, saw 3683568 distinct states, run finished after 30001 ms. (steps per millisecond=875 ) properties seen :[0]
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 11:09:25] [INFO ] Computed 10 place invariants in 1 ms
[2020-05-18 11:09:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-18 11:09:25] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2020-05-18 11:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:09:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-18 11:09:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:09:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-18 11:09:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:09:31] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6018 ms returned unknown
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Applied a total of 0 rules in 12 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 27 cols
[2020-05-18 11:09:31] [INFO ] Computed 10 place invariants in 2 ms
[2020-05-18 11:09:31] [INFO ] Implicit Places using invariants in 52 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
[2020-05-18 11:09:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2020-05-18 11:09:31] [INFO ] Computed 7 place invariants in 2 ms
[2020-05-18 11:09:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 24/27 places, 18/18 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 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Applied a total of 2 rules in 5 ms. Remains 23 /24 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:09:31] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:09:31] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:09:31] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:09:31] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/27 places, 17/18 transitions.
Incomplete random walk after 1000303 steps, including 768 resets, run finished after 513 ms. (steps per millisecond=1949 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties seen :[0]
Interrupted probabilistic random walk after 28023340 steps, run timeout after 30001 ms. (steps per millisecond=934 ) properties seen :[0]
Probabilistic random walk after 28023340 steps, saw 3991541 distinct states, run finished after 30001 ms. (steps per millisecond=934 ) properties seen :[0]
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:03] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:10:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-18 11:10:03] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-18 11:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:10:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-18 11:10:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:10:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-05-18 11:10:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:10:09] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 6017 ms returned unknown
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 17/17 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:09] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:10:09] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:09] [INFO ] Computed 7 place invariants in 2 ms
[2020-05-18 11:10:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2020-05-18 11:10:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:09] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:10:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 17/17 transitions.
Incomplete random walk after 100056 steps, including 76 resets, run finished after 49 ms. (steps per millisecond=2041 ) properties seen :[0]
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:09] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:10:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-18 11:10:09] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-18 11:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:10:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-18 11:10:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:10:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-05-18 11:10:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:10:15] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 6017 ms returned unknown
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 17/17 (removed 0) transitions.
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:15] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:10:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-18 11:10:15] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-18 11:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 11:10:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-05-18 11:10:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 11:10:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-18 11:10:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 11:10:21] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 6008 ms returned unknown
[2020-05-18 11:10:21] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 11:10:21] [INFO ] Flatten gal took : 9 ms
[2020-05-18 11:10:21] [INFO ] Applying decomposition
[2020-05-18 11:10:21] [INFO ] Flatten gal took : 9 ms
[2020-05-18 11:10:22] [INFO ] Input system was already deterministic with 17 transitions.
[2020-05-18 11:10:22] [INFO ] Input system was already deterministic with 17 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/graph9206045944690704832.txt, -o, /tmp/graph9206045944690704832.bin, -w, /tmp/graph9206045944690704832.weights], workingDir=null]
[2020-05-18 11:10:22] [INFO ] Ran tautology test, simplified 0 / 1 in 126 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:22] [INFO ] Computed 7 place invariants in 2 ms
inv : a1 + a2 = 200
inv : -7*Xu5P + 1400*R5P + 1407*S7P - 14*GAP - 7*E4P - 28*FBP - 14*DHAP - 12*_1_3_BPG + 28*ADP + 16*_3PG + 30800*start + 44*Lac + 28*Gluc - 7*a2 + 2*c2 = 30800
inv : c1 + c2 = 700
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 : 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 : Pi + _1_3_BPG + _3PG + 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
Total of 7 invariants.
[2020-05-18 11:10:22] [INFO ] Computed 7 place invariants in 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/graph9206045944690704832.bin, -l, -1, -v, -w, /tmp/graph9206045944690704832.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=0 took 22 ms
[2020-05-18 11:10:22] [INFO ] Decomposing Gal with order
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=1 took 8 ms
[2020-05-18 11:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=2 took 12 ms
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=3 took 11 ms
[2020-05-18 11:10:22] [INFO ] Removed a total of 1 redundant transitions.
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=4 took 9 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 17 rows 23 cols
[2020-05-18 11:10:22] [INFO ] Computed 7 place invariants in 1 ms
inv : a1 + a2 = 200
inv : -7*Xu5P + 1400*R5P + 1407*S7P - 14*GAP - 7*E4P - 28*FBP - 14*DHAP - 12*_1_3_BPG + 28*ADP + 16*_3PG + 30800*start + 44*Lac + 28*Gluc - 7*a2 + 2*c2 = 30800
inv : c1 + c2 = 700
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 : 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 : Pi + _1_3_BPG + _3PG + 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
Total of 7 invariants.
[2020-05-18 11:10:22] [INFO ] Computed 7 place invariants in 1 ms
[2020-05-18 11:10:22] [INFO ] Flatten gal took : 68 ms
[2020-05-18 11:10:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-18 11:10:22] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 3 ms
[2020-05-18 11:10:22] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 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]
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=5 took 76 ms
[2020-05-18 11:10:22] [INFO ] Proved 23 variables to be positive in 109 ms

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
Loading property file ReachabilityFireability.prop.
Read [invariant] property : GPPP-PT-C0100N0000010000-ReachabilityFireability-15 with value :(((((u1._1_3_BPG<1)||(u1.ADP<1))||(u3.S7P<1))||(u0.GAP<1))||(u4.c1<700))
built 7 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
[2020-05-18 11:10:22] [INFO ] Proved 23 variables to be positive in 227 ms
[2020-05-18 11:10:22] [INFO ] Computing symmetric may disable matrix : 17 transitions.
[2020-05-18 11:10:22] [INFO ] Computation of disable matrix completed :0/17 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 11:10:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 16
[2020-05-18 11:10:22] [INFO ] Computing symmetric may enable matrix : 17 transitions.
[2020-05-18 11:10:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 32
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=6 took 92 ms
[2020-05-18 11:10:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesGPPP-PT-C0100N0000010000-ReachabilityFireability-15
[2020-05-18 11:10:22] [INFO ] KInduction solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(SAT) depth K=0 took 64 ms
[2020-05-18 11:10:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesGPPP-PT-C0100N0000010000-ReachabilityFireability-15
[2020-05-18 11:10:22] [INFO ] KInduction solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(SAT) depth K=1 took 12 ms
SDD proceeding with computation, new max is 64
[2020-05-18 11:10:22] [INFO ] Computing symmetric co enabling matrix : 17 transitions.
[2020-05-18 11:10:22] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=7 took 317 ms
[2020-05-18 11:10:23] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=8 took 433 ms
[2020-05-18 11:10:23] [INFO ] Induction result is UNSAT, proved invariant GPPP-PT-C0100N0000010000-ReachabilityFireability-15
[2020-05-18 11:10:23] [INFO ] Induction result is UNSAT, successfully proved induction at step 2 for GPPP-PT-C0100N0000010000-ReachabilityFireability-15
FORMULA GPPP-PT-C0100N0000010000-ReachabilityFireability-15 TRUE TECHNIQUES SAT_SMT K_INDUCTION(2)
[2020-05-18 11:10:23] [INFO ] KInduction solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(TRUE) depth K=2 took 786 ms
SDD proceeding with computation, new max is 128
[2020-05-18 11:10:23] [INFO ] Computation of Finished co-enabling matrix. took 986 ms. Total solver calls (SAT/UNSAT): 136(109/27)
[2020-05-18 11:10:23] [INFO ] Computing Do-Not-Accords matrix : 17 transitions.
[2020-05-18 11:10:23] [INFO ] BMC solution for property GPPP-PT-C0100N0000010000-ReachabilityFireability-15(UNSAT) depth K=9 took 608 ms
[2020-05-18 11:10:23] [INFO ] SMT solved all 1 properties. Interrupting other analysis methods.
ITS tools runner thread asked to quit. Dying gracefully.
[2020-05-18 11:10:23] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:630)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 11:10:23] [INFO ] Built C files in 1738ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589800224841

--------------------
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-C0100N0000010000"
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-C0100N0000010000, 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-158922978100519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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