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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-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 24K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K 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.7K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-C1000N0000001000-00
FORMULA_NAME GPPP-PT-C1000N0000001000-01
FORMULA_NAME GPPP-PT-C1000N0000001000-02
FORMULA_NAME GPPP-PT-C1000N0000001000-03
FORMULA_NAME GPPP-PT-C1000N0000001000-04
FORMULA_NAME GPPP-PT-C1000N0000001000-05
FORMULA_NAME GPPP-PT-C1000N0000001000-06
FORMULA_NAME GPPP-PT-C1000N0000001000-07
FORMULA_NAME GPPP-PT-C1000N0000001000-08
FORMULA_NAME GPPP-PT-C1000N0000001000-09
FORMULA_NAME GPPP-PT-C1000N0000001000-10
FORMULA_NAME GPPP-PT-C1000N0000001000-11
FORMULA_NAME GPPP-PT-C1000N0000001000-12
FORMULA_NAME GPPP-PT-C1000N0000001000-13
FORMULA_NAME GPPP-PT-C1000N0000001000-14
FORMULA_NAME GPPP-PT-C1000N0000001000-15

=== Now, execution of the tool begins

BK_START 1621241330042

Running Version 0
[2021-05-17 08:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 08:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 08:48:53] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-17 08:48:53] [INFO ] Transformed 33 places.
[2021-05-17 08:48:53] [INFO ] Transformed 22 transitions.
[2021-05-17 08:48:53] [INFO ] Parsed PT model containing 33 places and 22 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 08:48:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C1000N0000001000-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 19 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 08:48:53] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-17 08:48:53] [INFO ] Dead Transitions using invariants and state equation in 234 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:48:53] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 08:48:53] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 08:48:53] [INFO ] Invariants computation overflowed in 4 ms
[2021-05-17 08:48:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 168 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:53] [INFO ] Invariants computation overflowed in 11 ms
[2021-05-17 08:48:54] [INFO ] Dead Transitions using invariants and state equation in 80 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 08:48:54] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 08:48:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 08:48:54] [INFO ] Flatten gal took : 46 ms
FORMULA GPPP-PT-C1000N0000001000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 08:48:54] [INFO ] Flatten gal took : 15 ms
[2021-05-17 08:48:54] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 20087 steps, including 0 resets, run visited all 19 properties in 45 ms. (steps per millisecond=446 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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.
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 08:48:54] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:54] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:54] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:54] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 176 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:48:54] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:55] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 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 08:48:55] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s14 s4)], 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]]
Stuttering criterion allowed to conclude after 28085 steps with 0 reset in 233 ms.
FORMULA GPPP-PT-C1000N0000001000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-01 finished in 956 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(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 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 08:48:55] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:55] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:55] [INFO ] Invariants computation overflowed in 6 ms
[2021-05-17 08:48:55] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:55] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 08:48:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 178 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:48:55] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 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 08:48:55] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:55] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPPP-PT-C1000N0000001000-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GT s3 s26), p1:(LEQ 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-02 finished in 573 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 5 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 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 10 place count 26 transition count 17
Applied a total of 10 rules in 42 ms. Remains 26 /32 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 08:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:48:56] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [0, 2, 3]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 142 ms to find 3 implicit places.
[2021-05-17 08:48:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 23/32 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 22 transition count 16
Applied a total of 2 rules in 5 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 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:48:56] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s2), p0:(LEQ s0 s10)], 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 33 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C1000N0000001000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-03 finished in 547 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 21 transition count 14
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 20 place count 20 transition count 13
Applied a total of 20 rules in 10 ms. Remains 20 /32 variables (removed 12) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 5 ms
[2021-05-17 08:48:56] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 08:48:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
[2021-05-17 08:48:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 19/32 places, 13/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2021-05-17 08:48:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2021-05-17 08:48:56] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s15)], 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 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-04 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F((X(p1)&&F(p2)))))))], 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 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 08:48:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:57] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:57] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:48:57] [INFO ] Invariants computation overflowed in 2 ms
[2021-05-17 08:48:57] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 08:48:57] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:48:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 08:48:57] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:48:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 412 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 s5), p2:(LEQ s30 s2), p1:(LEQ 1 s17)], 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]]
Product exploration explored 100000 steps with 3 reset in 412 ms.
Product exploration explored 100000 steps with 3 reset in 528 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 432 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 7 reset in 229 ms.
Product exploration explored 100000 steps with 6 reset in 384 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 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 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 30 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 30 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 30 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 29 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 29 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 29 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 28 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 28 transition count 19
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 10 place count 28 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 10 rules in 9 ms. Remains 28 /31 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 08:49:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
[2021-05-17 08:49:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 28 cols
[2021-05-17 08:49:00] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/31 places, 19/22 transitions.
Product exploration explored 100000 steps with 3 reset in 565 ms.
Product exploration explored 100000 steps with 4 reset in 233 ms.
[2021-05-17 08:49:01] [INFO ] Flatten gal took : 6 ms
[2021-05-17 08:49:01] [INFO ] Flatten gal took : 5 ms
[2021-05-17 08:49:01] [INFO ] Time to serialize gal into /tmp/LTL13884793597352011447.gal : 2 ms
[2021-05-17 08:49:01] [INFO ] Time to serialize properties into /tmp/LTL6878271556330988464.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/LTL13884793597352011447.gal, -t, CGAL, -LTL, /tmp/LTL6878271556330988464.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/LTL13884793597352011447.gal -t CGAL -LTL /tmp/LTL6878271556330988464.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(GSSG>=3)"))||(X(F((X("(_1_3_BPG>=1)"))&&(F("(c2<=NADH)"))))))))
Formula 0 simplified : !X(G"(GSSG>=3)" | XF(X"(_1_3_BPG>=1)" & F"(c2<=NADH)"))
Detected timeout of ITS tools.
[2021-05-17 08:49:16] [INFO ] Flatten gal took : 4 ms
[2021-05-17 08:49:16] [INFO ] Applying decomposition
[2021-05-17 08:49:16] [INFO ] Flatten gal took : 4 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/graph8249875824301691748.txt, -o, /tmp/graph8249875824301691748.bin, -w, /tmp/graph8249875824301691748.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/graph8249875824301691748.bin, -l, -1, -v, -w, /tmp/graph8249875824301691748.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 08:49:16] [INFO ] Decomposing Gal with order
[2021-05-17 08:49:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 08:49:16] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 08:49:16] [INFO ] Flatten gal took : 74 ms
[2021-05-17 08:49:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 08:49:16] [INFO ] Time to serialize gal into /tmp/LTL2360961152700779971.gal : 4 ms
[2021-05-17 08:49:16] [INFO ] Time to serialize properties into /tmp/LTL1288016140081706729.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/LTL2360961152700779971.gal, -t, CGAL, -LTL, /tmp/LTL1288016140081706729.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/LTL2360961152700779971.gal -t CGAL -LTL /tmp/LTL1288016140081706729.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(gi1.gi0.gu2.GSSG>=3)"))||(X(F((X("(gi1.gi1.gu4._1_3_BPG>=1)"))&&(F("(gu0.c2<=gu0.NADH)"))))))))
Formula 0 simplified : !X(G"(gi1.gi0.gu2.GSSG>=3)" | XF(X"(gi1.gi1.gu4._1_3_BPG>=1)" & F"(gu0.c2<=gu0.NADH)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12745971726016279942
[2021-05-17 08:49:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12745971726016279942
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/ltsmin12745971726016279942]
Compilation finished in 366 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12745971726016279942]
Link finished in 44 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(<>((X((LTLAPp1==true))&&<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12745971726016279942]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C1000N0000001000-08 finished in 49556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((p0||X(p0))))&&(F(p1) U 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.
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 08:49:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:49:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:46] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 08:49:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:46] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:46] [INFO ] Dead Transitions using invariants and state equation in 29 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 08:49:46] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(LEQ 2 s25)], 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 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 321 ms.
Knowledge obtained : [p0, (NOT p1)]
Adopting property with smaller alphabet thanks to knowledge :p0
Stuttering acceptance computed with spot in 57 ms :[false, (NOT p0)]
Support contains 1 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.
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 08:49:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:47] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:47] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:47] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 22/22 transitions.
Stuttering acceptance computed with spot in 60 ms :[false, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 60 ms :[false, (NOT p0)]
Support contains 1 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 28 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 27 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 27 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 27 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 13 rules in 10 ms. Remains 27 /30 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 08:49:48] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
[2021-05-17 08:49:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-17 08:49:48] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 19/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Starting structural reductions, iteration 0 : 30/30 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 08:49:49] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:49] [INFO ] Invariants computation overflowed in 0 ms
[2021-05-17 08:49:49] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:49] [INFO ] Invariants computation overflowed in 1 ms
[2021-05-17 08:49:49] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-17 08:49:49] [INFO ] Invariants computation overflowed in 3 ms
[2021-05-17 08:49:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 22/22 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621241390130

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

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

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