fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331300261
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
337.159 19420.00 41949.00 414.80 FFTFFTFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331300261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0100N0000010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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-00
FORMULA_NAME GPPP-PT-C0100N0000010000-01
FORMULA_NAME GPPP-PT-C0100N0000010000-02
FORMULA_NAME GPPP-PT-C0100N0000010000-03
FORMULA_NAME GPPP-PT-C0100N0000010000-04
FORMULA_NAME GPPP-PT-C0100N0000010000-05
FORMULA_NAME GPPP-PT-C0100N0000010000-06
FORMULA_NAME GPPP-PT-C0100N0000010000-07
FORMULA_NAME GPPP-PT-C0100N0000010000-08
FORMULA_NAME GPPP-PT-C0100N0000010000-09
FORMULA_NAME GPPP-PT-C0100N0000010000-10
FORMULA_NAME GPPP-PT-C0100N0000010000-11
FORMULA_NAME GPPP-PT-C0100N0000010000-12
FORMULA_NAME GPPP-PT-C0100N0000010000-13
FORMULA_NAME GPPP-PT-C0100N0000010000-14
FORMULA_NAME GPPP-PT-C0100N0000010000-15

=== Now, execution of the tool begins

BK_START 1621226880283

Running Version 0
[2021-05-17 04:48:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 04:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:48:03] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-17 04:48:03] [INFO ] Transformed 33 places.
[2021-05-17 04:48:03] [INFO ] Transformed 22 transitions.
[2021-05-17 04:48:03] [INFO ] Parsed PT model containing 33 places and 22 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 04:48:03] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C0100N0000010000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 17 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:04] [INFO ] Computed 12 place invariants in 19 ms
[2021-05-17 04:48:04] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:04] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 04:48:04] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:04] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 04:48:04] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:04] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 04:48:04] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
[2021-05-17 04:48:04] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 04:48:04] [INFO ] Flatten gal took : 45 ms
FORMULA GPPP-PT-C0100N0000010000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:48:05] [INFO ] Flatten gal took : 14 ms
[2021-05-17 04:48:05] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100020 steps, including 34 resets, run finished after 207 ms. (steps per millisecond=483 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:05] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:48:05] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:48:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-17 04:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:48:05] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 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 10 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
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 2 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 53 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 04:48:05] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 04:48:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 04:48:05] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 04:48:05] [INFO ] Implicit Places using invariants in 69 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
[2021-05-17 04:48:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-17 04:48:05] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:48:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 21/33 places, 16/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 18 transition count 13
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 3 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 18 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:48:05] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-17 04:48:05] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:48:05] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-17 04:48:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:48:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 117 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 12 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-17 04:48:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 04:48:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 04:48:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s7 1) (AND (GEQ s0 1) (GEQ s12 200)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000010000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-00 finished in 829 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U !p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 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 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 16
Applied a total of 12 rules in 10 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 04:48:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:48:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 04:48:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:48:06] [INFO ] Implicit Places using invariants in 69 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
[2021-05-17 04:48:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:48:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:48:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 22/33 places, 16/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 12
Applied a total of 8 rules in 6 ms. Remains 18 /22 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-17 04:48:06] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:48:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-17 04:48:06] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:48:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:48:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 17/33 places, 12/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-17 04:48:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:48:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:48:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 3 iterations. Remains : 17/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-01 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 2) (LT s7 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-01 finished in 463 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(X(F(p1))&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:06] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:06] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:06] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:48:06] [INFO ] Implicit Places using invariants in 98 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 99 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:06] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:06] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:06] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:07] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : GPPP-PT-C0100N0000010000-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (LT s1 1) (LT s12 1)), p0:(LT s17 1), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 596 ms.
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Applying partial POR strategy [true, false, true, false, true]
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 30 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 22
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
[2021-05-17 04:48:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 22/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
[2021-05-17 04:48:10] [INFO ] Flatten gal took : 5 ms
[2021-05-17 04:48:10] [INFO ] Flatten gal took : 4 ms
[2021-05-17 04:48:10] [INFO ] Time to serialize gal into /tmp/LTL821005315771875524.gal : 2 ms
[2021-05-17 04:48:10] [INFO ] Time to serialize properties into /tmp/LTL13491003352854305117.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL821005315771875524.gal, -t, CGAL, -LTL, /tmp/LTL13491003352854305117.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL821005315771875524.gal -t CGAL -LTL /tmp/LTL13491003352854305117.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(_3PG<1)")||((X(F("(DHAP>=1)")))&&(G("((ATP<1)||(F6P<1))"))))))
Formula 0 simplified : !X("(_3PG<1)" | (XF"(DHAP>=1)" & G"((ATP<1)||(F6P<1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-17 04:48:10] [INFO ] Flatten gal took : 4 ms
[2021-05-17 04:48:10] [INFO ] Applying decomposition
[2021-05-17 04:48:10] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15892291335106354968.txt, -o, /tmp/graph15892291335106354968.bin, -w, /tmp/graph15892291335106354968.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15892291335106354968.bin, -l, -1, -v, -w, /tmp/graph15892291335106354968.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:48:10] [INFO ] Decomposing Gal with order
[2021-05-17 04:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:48:10] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-17 04:48:10] [INFO ] Flatten gal took : 47 ms
[2021-05-17 04:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 04:48:10] [INFO ] Time to serialize gal into /tmp/LTL5757836619427512189.gal : 2 ms
[2021-05-17 04:48:10] [INFO ] Time to serialize properties into /tmp/LTL523870703857962895.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5757836619427512189.gal, -t, CGAL, -LTL, /tmp/LTL523870703857962895.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5757836619427512189.gal -t CGAL -LTL /tmp/LTL523870703857962895.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i2.u4._3PG<1)")||((X(F("(i1.u2.DHAP>=1)")))&&(G("((u3.ATP<1)||(i1.u2.F6P<1))"))))))
Formula 0 simplified : !X("(i2.u4._3PG<1)" | (XF"(i1.u2.DHAP>=1)" & G"((u3.ATP<1)||(i1.u2.F6P<1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin68399260386078131
[2021-05-17 04:48:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin68399260386078131
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin68399260386078131]
Compilation finished in 372 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin68399260386078131]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||(X(<>((LTLAPp1==true)))&&[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin68399260386078131]
LTSmin run took 155 ms.
FORMULA GPPP-PT-C0100N0000010000-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000010000-02 finished in 4424 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 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 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
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 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 5 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 04:48:11] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:48:11] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 04:48:11] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 04:48:11] [INFO ] Implicit Places using invariants in 52 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
[2021-05-17 04:48:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 04:48:11] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 04:48:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 23/33 places, 17/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 23 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 16
Applied a total of 2 rules in 7 ms. Remains 22 /23 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:48:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:48:11] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 04:48:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 04:48:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:48:11] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-04 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(G(!p0)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:11] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:48:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:11] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 04:48:11] [INFO ] Implicit Places using invariants in 66 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : GPPP-PT-C0100N0000010000-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s5 2), p1:(AND (GEQ s1 1) (GEQ s12 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0]
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0]
Support contains 4 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 29 transition count 21
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 29 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 8 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 04:48:13] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:13] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
[2021-05-17 04:48:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-17 04:48:13] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 566 ms.
Product exploration explored 100000 steps with 50000 reset in 437 ms.
[2021-05-17 04:48:14] [INFO ] Flatten gal took : 5 ms
[2021-05-17 04:48:14] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:48:14] [INFO ] Time to serialize gal into /tmp/LTL16555447631430893123.gal : 2 ms
[2021-05-17 04:48:14] [INFO ] Time to serialize properties into /tmp/LTL8908923467382852917.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16555447631430893123.gal, -t, CGAL, -LTL, /tmp/LTL8908923467382852917.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16555447631430893123.gal -t CGAL -LTL /tmp/LTL8908923467382852917.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(GSH<2)")||(("(((ATP>=1)&&(F6P>=1))&&(Gluc>=1))")&&(G("(GSH>=2)"))))))
Formula 0 simplified : !X("(GSH<2)" | ("(((ATP>=1)&&(F6P>=1))&&(Gluc>=1))" & G"(GSH>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-17 04:48:14] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:48:14] [INFO ] Applying decomposition
[2021-05-17 04:48:14] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12429081148576209014.txt, -o, /tmp/graph12429081148576209014.bin, -w, /tmp/graph12429081148576209014.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12429081148576209014.bin, -l, -1, -v, -w, /tmp/graph12429081148576209014.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 04:48:14] [INFO ] Decomposing Gal with order
[2021-05-17 04:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 04:48:14] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 04:48:14] [INFO ] Flatten gal took : 6 ms
[2021-05-17 04:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 04:48:14] [INFO ] Time to serialize gal into /tmp/LTL16904465439225072177.gal : 2 ms
[2021-05-17 04:48:14] [INFO ] Time to serialize properties into /tmp/LTL2697676422845576904.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16904465439225072177.gal, -t, CGAL, -LTL, /tmp/LTL2697676422845576904.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16904465439225072177.gal -t CGAL -LTL /tmp/LTL2697676422845576904.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i1.u2.GSH<2)")||(("(((i3.u5.ATP>=1)&&(i5.u4.F6P>=1))&&(i2.u3.Gluc>=1))")&&(G("(i1.u2.GSH>=2)"))))))
Formula 0 simplified : !X("(i1.u2.GSH<2)" | ("(((i3.u5.ATP>=1)&&(i5.u4.F6P>=1))&&(i2.u3.Gluc>=1))" & G"(i1.u2.GSH>=2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin1669454468492579196
[2021-05-17 04:48:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1669454468492579196
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1669454468492579196]
Compilation finished in 207 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1669454468492579196]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||([](!(LTLAPp0==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1669454468492579196]
LTSmin run took 158 ms.
FORMULA GPPP-PT-C0100N0000010000-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000010000-05 finished in 3279 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 17
Applied a total of 9 rules in 9 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 04:48:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:14] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 04:48:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 04:48:14] [INFO ] Implicit Places using invariants in 74 ms returned [2, 3, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 76 ms to find 3 implicit places.
[2021-05-17 04:48:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-17 04:48:14] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 25/33 places, 17/22 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 24 transition count 16
Applied a total of 2 rules in 4 ms. Remains 24 /25 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 04:48:14] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:15] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-17 04:48:15] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:48:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0, 2, 4]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 126 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 21/33 places, 16/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-17 04:48:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2021-05-17 04:48:15] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 04:48:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 3 iterations. Remains : 21/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s8 1)), p1:(LT s2 2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-07 finished in 395 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:15] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:15] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:15] [INFO ] Implicit Places using invariants in 71 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:48:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:48:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 04:48:15] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:48:15] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0100N0000010000-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s27 700)), p1:(LT s9 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6367 reset in 503 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-08 finished in 891 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:16] [INFO ] Implicit Places using invariants in 44 ms returned [1, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:16] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s10 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2553 reset in 168 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-09 finished in 474 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&(p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 17
Applied a total of 9 rules in 4 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 04:48:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2021-05-17 04:48:16] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:16] [INFO ] Implicit Places using invariants in 50 ms returned [1, 2, 3, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
[2021-05-17 04:48:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 04:48:16] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 24/33 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Applied a total of 8 rules in 4 ms. Remains 20 /24 variables (removed 4) and now considering 13/17 (removed 4) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 04:48:16] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:48:16] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 04:48:16] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:48:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 04:48:16] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 58 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 18/33 places, 13/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2021-05-17 04:48:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 04:48:16] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 3 iterations. Remains : 18/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s8 1) (GEQ s12 300)), p2:(AND (GEQ s0 1) (GEQ s1 1)), p1:(AND (GEQ s3 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-10 finished in 383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((p0||X((p1 U X(p2)))) U p1)&&G(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:16] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 04:48:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:48:16] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants in 41 ms returned [1, 2, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 04:48:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p2), (NOT p1), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 4}, { cond=p3, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s21 1), p0:(AND (GEQ s6 1) (GEQ s27 1)), p2:(AND (GEQ s1 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-12 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. 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
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 10 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 6 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 04:48:17] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 04:48:17] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
[2021-05-17 04:48:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 22 cols
[2021-05-17 04:48:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 22/33 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 12
Applied a total of 10 rules in 2 ms. Remains 17 /22 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:48:17] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 04:48:17] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 53 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-17 04:48:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 04:48:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : GPPP-PT-C0100N0000010000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 844 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0100N0000010000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-13 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((G(!p0) U p1)||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 30 transition count 19
Applied a total of 6 rules in 5 ms. Remains 30 /33 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 30 cols
[2021-05-17 04:48:17] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 19 rows 30 cols
[2021-05-17 04:48:17] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants in 52 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
[2021-05-17 04:48:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 26 cols
[2021-05-17 04:48:17] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 26/33 places, 19/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 24 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 24 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 22 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 21 transition count 14
Applied a total of 10 rules in 4 ms. Remains 21 /26 variables (removed 5) and now considering 14/19 (removed 5) transitions.
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 04:48:17] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 04:48:17] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 04:48:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [0, 1, 3]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 84 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 18/33 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 04:48:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-17 04:48:17] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 04:48:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 3 iterations. Remains : 18/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s9 1) (GEQ s1 2)), p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(LT s1 2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2491 steps with 7 reset in 6 ms.
FORMULA GPPP-PT-C0100N0000010000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-14 finished in 497 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
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 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 6 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 04:48:18] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:48:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 04:48:18] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 04:48:18] [INFO ] Implicit Places using invariants in 39 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
[2021-05-17 04:48:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-17 04:48:18] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:48:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 24/33 places, 17/22 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 23 transition count 16
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 04:48:18] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 04:48:18] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 04:48:18] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 04:48:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 04:48:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s13 1)), p0:(OR (LT s1 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 45 steps with 8 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-15 finished in 335 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621226899703

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331300261"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;