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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.7K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:55 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-C0001N0000000001-00
FORMULA_NAME GPPP-PT-C0001N0000000001-01
FORMULA_NAME GPPP-PT-C0001N0000000001-02
FORMULA_NAME GPPP-PT-C0001N0000000001-03
FORMULA_NAME GPPP-PT-C0001N0000000001-04
FORMULA_NAME GPPP-PT-C0001N0000000001-05
FORMULA_NAME GPPP-PT-C0001N0000000001-06
FORMULA_NAME GPPP-PT-C0001N0000000001-07
FORMULA_NAME GPPP-PT-C0001N0000000001-08
FORMULA_NAME GPPP-PT-C0001N0000000001-09
FORMULA_NAME GPPP-PT-C0001N0000000001-10
FORMULA_NAME GPPP-PT-C0001N0000000001-11
FORMULA_NAME GPPP-PT-C0001N0000000001-12
FORMULA_NAME GPPP-PT-C0001N0000000001-13
FORMULA_NAME GPPP-PT-C0001N0000000001-14
FORMULA_NAME GPPP-PT-C0001N0000000001-15

=== Now, execution of the tool begins

BK_START 1621196451951

Running Version 0
[2021-05-16 20:20:54] [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-16 20:20:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:20:54] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-16 20:20:54] [INFO ] Transformed 33 places.
[2021-05-16 20:20:54] [INFO ] Transformed 22 transitions.
[2021-05-16 20:20:54] [INFO ] Parsed PT model containing 33 places and 22 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 20:20:54] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0001N0000000001-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 12 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:20:55] [INFO ] Computed 13 place invariants in 11 ms
[2021-05-16 20:20:55] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:20:55] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-16 20:20:55] [INFO ] Implicit Places using invariants in 62 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:20:55] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 20:20:55] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:20:55] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:20:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-16 20:20:55] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 20:20:55] [INFO ] Flatten gal took : 29 ms
FORMULA GPPP-PT-C0001N0000000001-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:20:55] [INFO ] Flatten gal took : 11 ms
[2021-05-16 20:20:55] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 100 steps, including 0 resets, run visited all 15 properties in 3 ms. (steps per millisecond=33 )
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 4 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 1 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 3 places and 0 transitions.
Iterating global reduction 2 with 5 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
Applied a total of 13 rules in 23 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 20:20:55] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 20:20:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 20:20:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants in 38 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
[2021-05-16 20:20:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 20:20:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 16/22 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 20:20:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 20:20:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s11 s10)], 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 7 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000000001-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-00 finished in 517 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U 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 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 6 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:20:56] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:20:56] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants in 38 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
[2021-05-16 20:20:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2021-05-16 20:20:56] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-16 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 24/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 23 transition count 16
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2021-05-16 20:20:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2021-05-16 20:20:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 23/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-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:(LEQ s0 s9), p0:(LEQ s12 s7)], 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 26 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000000001-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-03 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((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.
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-16 20:20:56] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:20:56] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:20:56] [INFO ] Implicit Places using invariants in 48 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:20:56] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 20:20:56] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:20:56] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s15 s13), p1:(LEQ s1 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Stack based approach found an accepted trace after 130 steps with 0 reset with depth 131 and stack size 106 in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-04 finished in 785 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 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 3 places and 0 transitions.
Iterating global reduction 2 with 5 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 8 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-16 20:20:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-16 20:20:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:57] [INFO ] Implicit Places using invariants in 46 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
[2021-05-16 20:20:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 20:20:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 15/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 20 transition count 14
Applied a total of 2 rules in 6 ms. Remains 20 /21 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 20:20:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:57] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 20:20:57] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:20:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-07 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:(GT s3 s11)], 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 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-07 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(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 3 places and 0 transitions.
Iterating global reduction 2 with 5 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
Applied a total of 13 rules in 13 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 20:20:57] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-16 20:20:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 20:20:57] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants in 54 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
[2021-05-16 20:20:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 20:20:58] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:20:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 16/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 18 transition count 13
Applied a total of 7 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 18 cols
[2021-05-16 20:20:58] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 13 rows 18 cols
[2021-05-16 20:20:58] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/32 places, 13/22 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s6 s1), p1:(LEQ s16 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-10 finished in 373 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.
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 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 25 transition count 17
Applied a total of 12 rules in 6 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:20:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:20:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants in 43 ms returned [2, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
[2021-05-16 20:20:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:20:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 23/32 places, 17/22 transitions.
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 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 14
Applied a total of 7 rules in 3 ms. Remains 19 /23 variables (removed 4) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:20:58] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:20:58] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-11 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:(LEQ s10 s15)], 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 32 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-11 finished in 292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G((X(p1)||p0))))||G(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 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-16 20:20:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:20:58] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Implicit Places using invariants in 39 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:20:58] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 20:20:58] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 20:20:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=4, aps=[p0:(OR (LEQ s14 s2) (LEQ s26 s16)), p1:(GT 3 s25), p2:(LEQ s26 s16)], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-12 finished in 613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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.
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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 7 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:20:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:20:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] Implicit Places using invariants in 49 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
[2021-05-16 20:20:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:20:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 26 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
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 16
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 4 place count 21 transition count 15
Applied a total of 4 rules in 4 ms. Remains 21 /23 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 20:20:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2021-05-16 20:20:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:20:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 1 s15) (GT s11 s14))], 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 13 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-14 finished in 277 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p0&&G(F(p1)))))))], 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 3 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.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 18
Applied a total of 7 rules in 5 ms. Remains 28 /32 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 28 cols
[2021-05-16 20:20:59] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 18 rows 28 cols
[2021-05-16 20:20:59] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] Implicit Places using invariants in 30 ms returned [2, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
[2021-05-16 20:20:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-16 20:20:59] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 26/32 places, 18/22 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 16
Applied a total of 4 rules in 3 ms. Remains 24 /26 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 20:20:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:20:59] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 16 rows 24 cols
[2021-05-16 20:20:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:20:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 20:20:59] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s5), p0:(GT 2 s15)], 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 90 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-15 finished in 326 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621196460735

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

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