Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575900188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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-C0001N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575900188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.2K Apr 29 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 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-C0001N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652680188387

Running Version 202205111006
[2022-05-16 05:49:50] [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]
[2022-05-16 05:49:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 05:49:50] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-16 05:49:50] [INFO ] Transformed 33 places.
[2022-05-16 05:49:50] [INFO ] Transformed 22 transitions.
[2022-05-16 05:49:50] [INFO ] Parsed PT model containing 33 places and 22 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 22 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:51] [INFO ] Computed 13 place invariants in 14 ms
[2022-05-16 05:49:51] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:51] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-16 05:49:51] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:51] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 05:49:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:51] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 05:49:51] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 31 out of 33 places after structural reductions.
[2022-05-16 05:49:52] [INFO ] Flatten gal took : 43 ms
[2022-05-16 05:49:52] [INFO ] Flatten gal took : 16 ms
[2022-05-16 05:49:52] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 113 steps, including 0 resets, run visited all 24 properties in 43 ms. (steps per millisecond=2 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U X(X(p1))))||G(p2)))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:53] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 05:49:53] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:53] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 05:49:53] [INFO ] Implicit Places using invariants in 91 ms returned [1, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 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.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 1074 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 10}, { cond=(AND p2 p0), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=11 dest: 12}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=11 dest: 13}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=11 dest: 14}], [{ cond=(NOT p0), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 6}, { cond=p2, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=14 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={} source=14 dest: 13}, { cond=(AND p2 p0), acceptance={} source=14 dest: 14}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s8 1)), p0:(OR (AND (GEQ s7 1) (GEQ s8 1)) (GEQ s18 1)), p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s10 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-00 finished in 1395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||G(p2)||X(p3)))'
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:54] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:54] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 05:49:54] [INFO ] Implicit Places using invariants in 116 ms returned [0, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 121 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 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.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 576 ms :[true, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 10}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=9 dest: 7}], [{ cond=(NOT p2), acceptance={} source=10 dest: 0}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=5, aps=[p1:(AND (GEQ s0 1) (GEQ s11 1)), p3:(AND (GEQ s16 1) (GEQ s19 1)), p0:(OR (GEQ s13 1) (GEQ s17 1)), p2:(OR (LT s8 1) (LT s9 1) (LT s28 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-02 finished in 812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0))) U G((p1 U !X(p2)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:55] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:55] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-16 05:49:55] [INFO ] Implicit Places using invariants in 106 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 108 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 545 ms :[p2, p2, (AND p1 (NOT p0) p2), (AND p1 p2 (NOT p0)), p2, true, (NOT p0), (AND p2 p0), (AND p0 p2), (OR (AND p1 p2) (AND p0 p2))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}, { cond=(AND p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(GEQ s16 1), p2:(LT s3 2), p0:(AND (GEQ s14 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-03 finished in 770 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !G(X(p1)))&&(X(F(p2))||G(p0))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:55] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 05:49:55] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:55] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:56] [INFO ] Implicit Places using invariants in 78 ms returned [0, 1, 2, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 80 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (NOT p2), p1, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s9 1), p2:(AND (GEQ s0 1) (GEQ s19 1)), p1:(AND (GEQ s6 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3323 reset in 385 ms.
Stack based approach found an accepted trace after 55 steps with 2 reset with depth 12 and stack size 12 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-04 finished in 844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U X(p1))||(p2 U X(p0))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:56] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:56] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:56] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:56] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 68 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}]], initial=1, aps=[p2:(GEQ s8 1), p0:(GEQ s15 1), p1:(AND (OR (GEQ s8 1) (GEQ s15 1)) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], 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-C0001N0000001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-05 finished in 487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:57] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:57] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 05:49:57] [INFO ] Implicit Places using invariants in 109 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 112 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s3 2), p1:(AND (GEQ s11 1) (GEQ s22 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Product exploration explored 100000 steps with 33333 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-06 finished in 1184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(F(p0))))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:58] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:58] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 05:49:58] [INFO ] Implicit Places using invariants in 93 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 94 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11483 reset in 131 ms.
Stack based approach found an accepted trace after 66 steps with 6 reset with depth 10 and stack size 10 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-07 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 18 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2022-05-16 05:49:58] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 05:49:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2022-05-16 05:49:58] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 05:49:59] [INFO ] Implicit Places using invariants in 70 ms returned [0, 1, 2, 3, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 72 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 16/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 17 transition count 13
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 3 with 4 rules applied. Total rules applied 10 place count 15 transition count 11
Applied a total of 10 rules in 10 ms. Remains 15 /20 variables (removed 5) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 05:49:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 05:49:59] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 05:49:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 05:49:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 05:49:59] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/33 places, 11/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/33 places, 11/22 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-08 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(X(G((X(p0)||p1)))))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:59] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:59] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:59] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:59] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2, 3, 19]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 68 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 28/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s4 1) (GEQ s24 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-10 finished in 400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((F(p0)&&F(p1))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:59] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 05:49:59] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:49:59] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:49:59] [INFO ] Implicit Places using invariants in 67 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 69 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s27 7)), p0:(OR (LT s15 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4061 reset in 190 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-11 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))&&G(X(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:50:00] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:50:00] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:50:00] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:50:00] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s15 1) (GEQ s18 1)), p1:(AND (GEQ s14 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-12 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(!(p0 U p1)))&&!(p0 U X(G((p2 U p3)))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 13 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 05:50:00] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 05:50:00] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 05:50:00] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 05:50:00] [INFO ] Implicit Places using invariants in 56 ms returned [0, 1, 2, 3, 15]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 58 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 18/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 19 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 18 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 17 transition count 13
Applied a total of 10 rules in 10 ms. Remains 17 /22 variables (removed 5) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 17 cols
[2022-05-16 05:50:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 05:50:00] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2022-05-16 05:50:00] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 05:50:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 13/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/33 places, 13/22 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR p1 p3), p3, p1]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=p3, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s14 1)), p2:(GEQ s9 1), p3:(GEQ s8 1), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25015 reset in 82 ms.
Stack based approach found an accepted trace after 33 steps with 7 reset with depth 8 and stack size 8 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-13 finished in 536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((((X(p0)&&!p1) U p2)&&(p0 U p3)))))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:50:01] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:50:01] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 05:50:01] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 05:50:01] [INFO ] Implicit Places using invariants in 67 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 81 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p0) (NOT p2)), (NOT p3)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p3) (AND p2 p0) (AND (NOT p1) p3) (AND (NOT p1) p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p3) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1) p3) (AND (NOT p2) (NOT p1) p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s0 2) (GEQ s11 1) (GEQ s24 1)), p3:(GEQ s12 1), p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s15 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-14 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(((G(p1)||p0) U p2)) U p2))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 8 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 05:50:01] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 05:50:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 05:50:01] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 05:50:01] [INFO ] Implicit Places using invariants in 65 ms returned [1, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 18/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 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 23 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 20 transition count 14
Applied a total of 8 rules in 4 ms. Remains 20 /24 variables (removed 4) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 05:50:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 05:50:01] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2022-05-16 05:50:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 05:50:01] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), p2, (AND p2 p1)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s4 1)), p0:(OR (NOT (AND (GEQ s3 1) (GEQ s4 1))) (AND (GEQ s0 1) (GEQ s1 1) (GEQ s6 1) (GEQ s19 1))), p1:(AND (GEQ s9 1) (GEQ s0 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 44 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-15 finished in 653 ms.
All properties solved by simple procedures.
Total runtime 11536 ms.

BK_STOP 1652680202330

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-C0001N0000001000"
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-C0001N0000001000, 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 r096-smll-165260575900188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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