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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0010N0000000010-00
FORMULA_NAME GPPP-PT-C0010N0000000010-01
FORMULA_NAME GPPP-PT-C0010N0000000010-02
FORMULA_NAME GPPP-PT-C0010N0000000010-03
FORMULA_NAME GPPP-PT-C0010N0000000010-04
FORMULA_NAME GPPP-PT-C0010N0000000010-05
FORMULA_NAME GPPP-PT-C0010N0000000010-06
FORMULA_NAME GPPP-PT-C0010N0000000010-07
FORMULA_NAME GPPP-PT-C0010N0000000010-08
FORMULA_NAME GPPP-PT-C0010N0000000010-09
FORMULA_NAME GPPP-PT-C0010N0000000010-10
FORMULA_NAME GPPP-PT-C0010N0000000010-11
FORMULA_NAME GPPP-PT-C0010N0000000010-12
FORMULA_NAME GPPP-PT-C0010N0000000010-13
FORMULA_NAME GPPP-PT-C0010N0000000010-14
FORMULA_NAME GPPP-PT-C0010N0000000010-15

=== Now, execution of the tool begins

BK_START 1621208485901

Running Version 0
[2021-05-16 23:41:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 23:41:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 23:41:29] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-16 23:41:29] [INFO ] Transformed 33 places.
[2021-05-16 23:41:29] [INFO ] Transformed 22 transitions.
[2021-05-16 23:41:29] [INFO ] Parsed PT model containing 33 places and 22 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 23:41:29] [INFO ] Initial state test concluded for 5 properties.
FORMULA GPPP-PT-C0010N0000000010-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 13 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 23:41:29] [INFO ] Computed 12 place invariants in 8 ms
[2021-05-16 23:41:29] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 23:41:29] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 23:41:29] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 23:41:29] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 23:41:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:29] [INFO ] Dead Transitions using invariants and state equation in 42 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-16 23:41:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:29] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-16 23:41:30] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 23:41:30] [INFO ] Flatten gal took : 41 ms
FORMULA GPPP-PT-C0010N0000000010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:41:30] [INFO ] Flatten gal took : 15 ms
[2021-05-16 23:41:30] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100003 steps, including 237 resets, run finished after 277 ms. (steps per millisecond=361 ) properties (out of 23) seen :21
Running SMT prover for 2 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:30] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 23:41:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-16 23:41:30] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-16 23:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 23:41:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 23:41:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 23:41:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-16 23:41:30] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-16 23:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 23:41:30] [INFO ] [Nat]Absence check using state equation in 72 ms returned unsat
[2021-05-16 23:41:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-16 23:41:30] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-16 23:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 23:41:31] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2021-05-16 23:41:31] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C0010N0000000010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(F(p0))||F((p1||X(F((F(p0)&&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 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-16 23:41:31] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 23:41:31] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:31] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 23:41:31] [INFO ] Implicit Places using invariants in 46 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:31] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-16 23:41:31] [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 23:41:31] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 23:41:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s27 20)), p0:(AND (GEQ s16 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10362 reset in 495 ms.
Stack based approach found an accepted trace after 95 steps with 11 reset with depth 8 and stack size 8 in 2 ms.
FORMULA GPPP-PT-C0010N0000000010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-00 finished in 1101 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 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 31 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 23:41:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 23:41:32] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-16 23:41:32] [INFO ] Implicit Places using invariants in 53 ms returned [2, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
[2021-05-16 23:41:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 23:41:32] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:32] [INFO ] Dead Transitions using invariants and state equation in 44 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 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 14
Applied a total of 6 rules in 6 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 23:41:32] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:32] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 23:41:32] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:32] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 136 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-16 23:41:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 23:41:32] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 23:41:32] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 581 reset in 265 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-01 finished in 816 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 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 0 with 3 rules applied. Total rules applied 9 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 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 19 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 23:41:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 23:41:33] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-16 23:41:33] [INFO ] Implicit Places using invariants in 47 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
[2021-05-16 23:41:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 23:41:33] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 38 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 20 transition count 14
Applied a total of 6 rules in 7 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 23:41:33] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-16 23:41:33] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 23:41:33] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-16 23:41:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 23:41:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 99 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-16 23:41:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 23:41:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-03 finished in 389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0 U (!p1 U !p2))) U X(X(X(p3)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
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-16 23:41:33] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:33] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 23:41:33] [INFO ] Implicit Places using invariants in 52 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-16 23:41:33] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 44 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 23:41:33] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 1056 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p0 p2 (NOT p3)), (NOT p3), (NOT p3), true, (AND p0 p2 (NOT p3)), (NOT p3), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), (AND p0 p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), p2, p2, p2]
Running random walk in product with property : GPPP-PT-C0010N0000000010-04 automaton TGBA [mat=[[{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 8}], [{ cond=(AND p2 p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 9}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 9}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 10}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 14}], [{ cond=(AND p2 p1 p0 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=9 dest: 15}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 15}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=10 dest: 16}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=10 dest: 17}], [{ cond=(NOT p3), acceptance={} source=11 dest: 5}], [{ cond=(AND p2 p1 p0 (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=12 dest: 9}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=13 dest: 10}], [{ cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={0} source=14 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=14 dest: 12}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=14 dest: 13}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=14 dest: 14}], [{ cond=(AND p2 p1), acceptance={0} source=15 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={0} source=15 dest: 15}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=16 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=16 dest: 15}, { cond=(AND p2 p0), acceptance={0} source=16 dest: 16}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=17 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=17 dest: 15}, { cond=(AND p2 p0), acceptance={} source=17 dest: 16}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={} source=17 dest: 17}]], initial=0, aps=[p2:(LT s19 1), p1:(LT s10 1), p0:(AND (GEQ s17 1) (GEQ s20 1)), p3:(OR (GEQ s22 1) (AND (GEQ s13 1) (GEQ s25 30)))], 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, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-04 finished in 1328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((X(p0) U (X(p0)&&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.
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 23:41:34] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-16 23:41:34] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:34] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 23:41:34] [INFO ] Implicit Places using invariants in 71 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:34] [INFO ] Dead Transitions using invariants and state equation in 44 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-16 23:41:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 23:41:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0010N0000000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s12 1)), p1:(AND (GEQ s1 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-05 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -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.
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 1 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 10 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 23:41:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 23:41:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Implicit Places using invariants in 40 ms returned [2, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
[2021-05-16 23:41:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 23:41:35] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 34 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 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 14
Applied a total of 6 rules in 4 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 23:41:35] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-16 23:41:35] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-16 23:41:35] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 23:41:35] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 92 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-16 23:41:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 23:41:35] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 3 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-06 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:(OR (LT s4 1) (LT s5 1) (LT s17 70))], 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 29 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-06 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((p1||G((X(X(p0))&&p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:35] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Implicit Places using invariants in 66 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 32 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-16 23:41:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p2)), (AND (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s12 1)), p1:(GEQ s5 2), p2:(AND (GEQ s6 1) (GEQ s26 20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-07 finished in 468 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1 U !p2)&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 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 23:41:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:36] [INFO ] Implicit Places using invariants in 47 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:36] [INFO ] Dead Transitions using invariants and state equation in 46 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-16 23:41:36] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p2), p2, (OR (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s9 1) (LT s10 1) (LT s28 70)), p1:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s28 70))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3412 reset in 342 ms.
Stack based approach found an accepted trace after 53 steps with 2 reset with depth 14 and stack size 14 in 16 ms.
FORMULA GPPP-PT-C0010N0000000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-09 finished in 795 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)&&X(G(p0))))], 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 3 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 23:41:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:36] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:36] [INFO ] Implicit Places using invariants in 34 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:36] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 23:41:36] [INFO ] Dead Transitions using invariants and state equation in 34 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-16 23:41:36] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 23:41:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000010-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p1:(OR (LT s1 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-11 finished in 437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(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 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-16 23:41:37] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Implicit Places using invariants in 35 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 30 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-16 23:41:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : GPPP-PT-C0010N0000000010-13 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={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s11 1)), p1:(OR (LT s1 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 379 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0010N0000000010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-13 finished in 318 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U X(G((F(!p2)||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 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-16 23:41:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 23:41:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Implicit Places using invariants in 29 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 23:41:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 30 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-16 23:41:37] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0010N0000000010-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s15 1), p1:(OR (LT s7 1) (LT s8 1)), p2:(GEQ s5 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23864 reset in 114 ms.
Stack based approach found an accepted trace after 12675 steps with 3055 reset with depth 20 and stack size 19 in 20 ms.
FORMULA GPPP-PT-C0010N0000000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000010-14 finished in 527 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621208499076

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0010N0000000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0010N0000000010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331300213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000010.tgz
mv GPPP-PT-C0010N0000000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;