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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K 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.2K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:56 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-C0010N0000000100-00
FORMULA_NAME GPPP-PT-C0010N0000000100-01
FORMULA_NAME GPPP-PT-C0010N0000000100-02
FORMULA_NAME GPPP-PT-C0010N0000000100-03
FORMULA_NAME GPPP-PT-C0010N0000000100-04
FORMULA_NAME GPPP-PT-C0010N0000000100-05
FORMULA_NAME GPPP-PT-C0010N0000000100-06
FORMULA_NAME GPPP-PT-C0010N0000000100-07
FORMULA_NAME GPPP-PT-C0010N0000000100-08
FORMULA_NAME GPPP-PT-C0010N0000000100-09
FORMULA_NAME GPPP-PT-C0010N0000000100-10
FORMULA_NAME GPPP-PT-C0010N0000000100-11
FORMULA_NAME GPPP-PT-C0010N0000000100-12
FORMULA_NAME GPPP-PT-C0010N0000000100-13
FORMULA_NAME GPPP-PT-C0010N0000000100-14
FORMULA_NAME GPPP-PT-C0010N0000000100-15

=== Now, execution of the tool begins

BK_START 1621212205668

Running Version 0
[2021-05-17 00:43:28] [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 00:43:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:43:28] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-17 00:43:28] [INFO ] Transformed 33 places.
[2021-05-17 00:43:28] [INFO ] Transformed 22 transitions.
[2021-05-17 00:43:28] [INFO ] Parsed PT model containing 33 places and 22 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Support contains 28 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 13 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 00:43:28] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-17 00:43:29] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 00:43:29] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 00:43:29] [INFO ] Implicit Places using invariants in 47 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:29] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 00:43:29] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:29] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-17 00:43:29] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 00:43:29] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 00:43:29] [INFO ] Flatten gal took : 32 ms
FORMULA GPPP-PT-C0010N0000000100-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 00:43:29] [INFO ] Flatten gal took : 9 ms
[2021-05-17 00:43:29] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100003 steps, including 240 resets, run finished after 152 ms. (steps per millisecond=657 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:29] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 00:43:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 00:43:29] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-17 00:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:43:29] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-17 00:43:29] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0010N0000000100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 3 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 31 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 30 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 30 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 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 19 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 00:43:30] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 00:43:30] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:30] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
[2021-05-17 00:43:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 00:43:30] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 15/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-17 00:43:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-17 00:43:30] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-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 (LT s9 1) (LT s10 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 34 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0010N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-00 finished in 539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (G(p2)||p1)))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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 31 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 30 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 30 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 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 24 transition count 15
Applied a total of 14 rules in 10 ms. Remains 24 /32 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 00:43:30] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-17 00:43:30] [INFO ] Computed 10 place invariants in 14 ms
[2021-05-17 00:43:30] [INFO ] Implicit Places using invariants in 67 ms returned [2, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
[2021-05-17 00:43:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 00:43:30] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 15/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-17 00:43:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 00:43:30] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s2 2) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s6 1))), p2:(OR (LT s1 1) (LT s9 1)), p0:(AND (GEQ s2 2) (GEQ s10 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 7 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-02 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:30] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-17 00:43:30] [INFO ] Implicit Places using invariants in 48 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:30] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-17 00:43:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 00:43:31] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s23 30)), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-04 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 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 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 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 30 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 7 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 00:43:31] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 00:43:31] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants in 47 ms returned [1, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
[2021-05-17 00:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-17 00:43:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 20/32 places, 15/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 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 14
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 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 2 with 2 rules applied. Total rules applied 4 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 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 00:43:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-17 00:43:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 75 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/32 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 00:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 00:43:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-05 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants in 38 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 29/32 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 00:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s27 70))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-06 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(!p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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 31 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 30 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 30 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 29 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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 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 11 place count 26 transition count 16
Applied a total of 11 rules in 6 ms. Remains 26 /32 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 00:43:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 00:43:31] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants in 45 ms returned [1, 2, 16]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
[2021-05-17 00:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 00:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 23/32 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 23 transition count 15
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 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 6 place count 20 transition count 13
Applied a total of 6 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 00:43:31] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 00:43:31] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-17 00:43:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-17 00:43:31] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 18/32 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 00:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-17 00:43:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 00:43:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 3 iterations. Remains : 18/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p0), p0]
Running random walk in product with property : GPPP-PT-C0010N0000000100-07 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s2 2), p0:(AND (GEQ s0 2) (GEQ s8 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-07 finished in 326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:32] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 00:43:32] [INFO ] Implicit Places using invariants in 34 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 00:43:32] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 30/32 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 00:43:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, 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][false, false]]
Product exploration explored 100000 steps with 2544 reset in 345 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA GPPP-PT-C0010N0000000100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-09 finished in 658 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:43:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:43:32] [INFO ] Implicit Places using invariants in 42 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:43:32] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-17 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 29/32 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 00:43:32] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 00:43:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-10 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: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s3 1)) (AND (GEQ s12 1) (GEQ s23 30)))], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 22/22 transitions.
Graph (trivial) has 8 edges and 29 vertex of which 2 / 29 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 28 transition count 21
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 28 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 25 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 25 transition count 18
Performed 2 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 2 rules applied. Total rules applied 14 place count 25 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 23 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 23 transition count 16
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 19 place count 23 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 19 rules in 10 ms. Remains 23 /29 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 00:43:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:43:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
[2021-05-17 00:43:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-17 00:43:34] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 00:43:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/29 places, 16/22 transitions.
Product exploration explored 100000 steps with 33333 reset in 324 ms.
Product exploration explored 100000 steps with 33333 reset in 439 ms.
[2021-05-17 00:43:35] [INFO ] Flatten gal took : 6 ms
[2021-05-17 00:43:35] [INFO ] Flatten gal took : 5 ms
[2021-05-17 00:43:35] [INFO ] Time to serialize gal into /tmp/LTL336494396401184898.gal : 2 ms
[2021-05-17 00:43:35] [INFO ] Time to serialize properties into /tmp/LTL1057306079827324168.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/LTL336494396401184898.gal, -t, CGAL, -LTL, /tmp/LTL1057306079827324168.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/LTL336494396401184898.gal -t CGAL -LTL /tmp/LTL1057306079827324168.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((NADPH>=1)&&(GSSG>=1))||((G6P>=1)&&(b1>=30)))")))))
Formula 0 simplified : !XXF"(((NADPH>=1)&&(GSSG>=1))||((G6P>=1)&&(b1>=30)))"
Detected timeout of ITS tools.
[2021-05-17 00:43:50] [INFO ] Flatten gal took : 4 ms
[2021-05-17 00:43:50] [INFO ] Applying decomposition
[2021-05-17 00:43:50] [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/graph868981951253128193.txt, -o, /tmp/graph868981951253128193.bin, -w, /tmp/graph868981951253128193.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/graph868981951253128193.bin, -l, -1, -v, -w, /tmp/graph868981951253128193.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 00:43:50] [INFO ] Decomposing Gal with order
[2021-05-17 00:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 00:43:50] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-17 00:43:50] [INFO ] Flatten gal took : 45 ms
[2021-05-17 00:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 00:43:50] [INFO ] Time to serialize gal into /tmp/LTL1754922140225282002.gal : 2 ms
[2021-05-17 00:43:50] [INFO ] Time to serialize properties into /tmp/LTL13317271788125958207.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/LTL1754922140225282002.gal, -t, CGAL, -LTL, /tmp/LTL13317271788125958207.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/LTL1754922140225282002.gal -t CGAL -LTL /tmp/LTL13317271788125958207.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((i0.u0.NADPH>=1)&&(i0.u1.GSSG>=1))||((i3.u2.G6P>=1)&&(i3.u8.b1>=30)))")))))
Formula 0 simplified : !XXF"(((i0.u0.NADPH>=1)&&(i0.u1.GSSG>=1))||((i3.u2.G6P>=1)&&(i3.u8.b1>=30)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4656268077201442037
[2021-05-17 00:44:05] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4656268077201442037
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/ltsmin4656268077201442037]
Compilation finished in 404 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4656268077201442037]
Link finished in 71 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(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4656268077201442037]
LTSmin run took 450 ms.
FORMULA GPPP-PT-C0010N0000000100-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0010N0000000100-10 finished in 33606 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((X(p1) U (X(p1)&&p2)))||(G(p4)&&p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:44:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:44:06] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:44:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:44:06] [INFO ] Implicit Places using invariants in 57 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:44:06] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 00:44:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 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 00:44:06] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 00:44:06] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4))), (NOT p1), true, (AND (NOT p4) (NOT p1)), (NOT p4)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p4), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(NOT p4), acceptance={} source=3 dest: 4}, { cond=p4, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p4 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p4), acceptance={} source=7 dest: 5}, { cond=p4, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s26 1)), p3:(AND (GEQ s5 1) (GEQ s26 1)), p4:(OR (LT s2 1) (LT s3 1)), p2:(AND (GEQ s5 1) (GEQ s26 1)), p1:(AND (LT s20 1) (OR (LT s2 1) (LT s3 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 58 steps with 12 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-12 finished in 576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(G((p0||X(X((p1||F(p2)))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:44:06] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 00:44:06] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 00:44:06] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 00:44:07] [INFO ] Implicit Places using invariants in 59 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 00:44:07] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:44:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 29/32 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 00:44:07] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 00:44:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}], [{ cond=true, acceptance={} source=7 dest: 0}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(GEQ s14 1), p1:(AND (GEQ s6 1) (GEQ s7 1)), p2:(AND (GEQ s5 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5617 reset in 165 ms.
Stack based approach found an accepted trace after 1049 steps with 57 reset with depth 20 and stack size 18 in 4 ms.
FORMULA GPPP-PT-C0010N0000000100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-14 finished in 753 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 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 31 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 30 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 30 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 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
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 17 place count 22 transition count 14
Applied a total of 17 rules in 19 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-17 00:44:07] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 00:44:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-17 00:44:07] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 00:44:07] [INFO ] Implicit Places using invariants in 71 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
[2021-05-17 00:44:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 00:44:07] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-17 00:44:08] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []
Starting structural reductions, iteration 1 : 20/32 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 00:44:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 00:44:08] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 00:44:08] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, p0]
Running random walk in product with property : GPPP-PT-C0010N0000000100-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-15 finished in 532 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621212249125

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

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