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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 9.4K Apr 29 18:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 29 18:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 18:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:34 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652717627580

Running Version 202205111006
[2022-05-16 16:13:49] [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 16:13:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:13:50] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-16 16:13:50] [INFO ] Transformed 33 places.
[2022-05-16 16:13:50] [INFO ] Transformed 22 transitions.
[2022-05-16 16:13:50] [INFO ] Parsed PT model containing 33 places and 22 transitions in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 20 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 16:13:50] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-16 16:13:50] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:50] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-16 16:13:50] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:50] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-16 16:13:50] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:50] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-16 16:13:50] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 26 out of 33 places after structural reductions.
[2022-05-16 16:13:51] [INFO ] Flatten gal took : 41 ms
[2022-05-16 16:13:51] [INFO ] Flatten gal took : 20 ms
[2022-05-16 16:13:51] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=218 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:51] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-16 16:13:51] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
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 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 16:13:52] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:52] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:52] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-16 16:13:52] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:52] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:52] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 273 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 557 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s15 1), p1:(GEQ s18 1)], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 2600 reset in 619 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 2 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-00 finished in 1651 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(F(p0)))&&G(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 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 16:13:54] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:54] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-16 16:13:54] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 6 ms
[2022-05-16 16:13:54] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s21 1)), p0:(OR (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s1 7000) (GEQ s23 7000)))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-02 finished in 486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 7 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 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 7 place count 29 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 9 place count 28 transition count 17
Applied a total of 9 rules in 30 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:54] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 17 rows 28 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 16:13:54] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [0, 2, 3, 17]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 242 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 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 21 transition count 14
Applied a total of 6 rules in 4 ms. Remains 21 /24 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 21 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:54] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2022-05-16 16:13:54] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-06 finished in 632 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 2 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 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 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 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 17 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 7 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-07 finished in 429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&X(F((!p1 U (X(G(p1))&&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 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 16:13:55] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:55] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 180 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 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.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s21 1)), p2:(AND (GEQ s2 1) (GEQ s21 1)), p1:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28089 steps with 0 reset in 171 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-08 finished in 826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X((G(p0)&&G(p1)))))&&F(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 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 16:13:56] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:56] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:56] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:56] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:56] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-16 16:13:56] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 187 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 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.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s21 1)), p0:(OR (LT s8 1) (LT s9 1)), p1:(OR (LT s3 2) (LT s14 1) (LT s26 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 399 steps with 5 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-09 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G((X(p0)&&p0))))||X(F(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 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 16:13:56] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:56] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:57] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:57] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:57] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [2, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 168 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s4 1) (LT s5 1)), p0:(OR (LT s2 1) (LT s21 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 155 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-11 finished in 850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 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 6 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 16:13:57] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 16:13:57] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:57] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 16:13:57] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 137 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Applied a total of 4 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 16:13:57] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:57] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2022-05-16 16:13:57] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 1) (LT s7 1) (LT s22 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 8 reset in 123 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 32 in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-12 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(X(p1))))&&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 16:13:58] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 131 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 1 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 161 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1)), p1:(AND (GEQ s7 1) (GEQ s8 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, 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-C1000N0000001000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-13 finished in 358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(F(G(X(G(p0)))))||(p1 U p2))))))'
Support contains 4 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 6 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 16:13:58] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 96 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 17
Applied a total of 2 rules in 5 ms. Remains 24 /25 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 24 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 4 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 17 rows 24 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:58] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/33 places, 17/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 24/33 places, 17/22 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s10 1), p2:(GEQ s6 1), p1:(AND (GEQ s12 1) (GEQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12069 steps with 0 reset in 34 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-14 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(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.
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 1 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
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 26 transition count 17
Applied a total of 12 rules in 10 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 16:13:58] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 16:13:59] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-16 16:13:59] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 16:13:59] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [0, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 150 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 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 19 transition count 14
Applied a total of 6 rules in 4 ms. Remains 19 /22 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:13:59] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:13:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:13:59] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:13:59] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 14/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9950 reset in 152 ms.
Product exploration explored 100000 steps with 9982 reset in 328 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1500 ) properties (out of 1) seen :0
Finished Best-First random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:00] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:14:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 16:14:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:14:00] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-16 16:14:00] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:14:00] [INFO ] Added : 12 causal constraints over 3 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:00] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:00] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:14:00] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:00] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:00] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-05-16 16:14:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:00] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1715 ) properties (out of 1) seen :0
Finished Best-First random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:01] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:14:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 16:14:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:14:01] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-16 16:14:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:14:01] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9962 reset in 158 ms.
Product exploration explored 100000 steps with 10031 reset in 174 ms.
Built C files in :
/tmp/ltsmin1782972855487771018
[2022-05-16 16:14:01] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2022-05-16 16:14:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:14:01] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2022-05-16 16:14:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:14:01] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2022-05-16 16:14:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:14:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1782972855487771018
Running compilation step : cd /tmp/ltsmin1782972855487771018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin1782972855487771018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin1782972855487771018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3799843940112950573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:17] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:17] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 16:14:17] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:17] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-05-16 16:14:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 16:14:17] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 16:14:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin13060494532212592866
[2022-05-16 16:14:17] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2022-05-16 16:14:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:14:17] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2022-05-16 16:14:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:14:17] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2022-05-16 16:14:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:14:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13060494532212592866
Running compilation step : cd /tmp/ltsmin13060494532212592866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin13060494532212592866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13060494532212592866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5564357490250388057.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:14:32] [INFO ] Flatten gal took : 5 ms
[2022-05-16 16:14:32] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:14:32] [INFO ] Time to serialize gal into /tmp/LTL3806609005134134485.gal : 2 ms
[2022-05-16 16:14:32] [INFO ] Time to serialize properties into /tmp/LTL8868052518730739779.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3806609005134134485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8868052518730739779.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3806609...266
Read 1 LTL properties
Checking formula 0 : !((F("(DHAP>=1)")))
Formula 0 simplified : !F"(DHAP>=1)"
Detected timeout of ITS tools.
[2022-05-16 16:14:47] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:14:47] [INFO ] Applying decomposition
[2022-05-16 16:14:47] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6329571710766839092.txt' '-o' '/tmp/graph6329571710766839092.bin' '-w' '/tmp/graph6329571710766839092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6329571710766839092.bin' '-l' '-1' '-v' '-w' '/tmp/graph6329571710766839092.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:14:47] [INFO ] Decomposing Gal with order
[2022-05-16 16:14:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:14:47] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:14:47] [INFO ] Flatten gal took : 166 ms
[2022-05-16 16:14:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 16:14:47] [INFO ] Time to serialize gal into /tmp/LTL17444472875661630207.gal : 1 ms
[2022-05-16 16:14:47] [INFO ] Time to serialize properties into /tmp/LTL13373327534388322158.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17444472875661630207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13373327534388322158.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1744447...247
Read 1 LTL properties
Checking formula 0 : !((F("(u0.DHAP>=1)")))
Formula 0 simplified : !F"(u0.DHAP>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10657603299583283123
[2022-05-16 16:15:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10657603299583283123
Running compilation step : cd /tmp/ltsmin10657603299583283123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin10657603299583283123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10657603299583283123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C1000N0000001000-LTLFireability-15 finished in 78852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-16 16:15:18] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10848156829806476181
[2022-05-16 16:15:18] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2022-05-16 16:15:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:15:18] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2022-05-16 16:15:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:15:18] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2022-05-16 16:15:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:15:18] [INFO ] Applying decomposition
[2022-05-16 16:15:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10848156829806476181
Running compilation step : cd /tmp/ltsmin10848156829806476181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 16:15:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9635429547768728858.txt' '-o' '/tmp/graph9635429547768728858.bin' '-w' '/tmp/graph9635429547768728858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9635429547768728858.bin' '-l' '-1' '-v' '-w' '/tmp/graph9635429547768728858.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:15:18] [INFO ] Decomposing Gal with order
[2022-05-16 16:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:15:18] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-16 16:15:18] [INFO ] Flatten gal took : 7 ms
[2022-05-16 16:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 16:15:18] [INFO ] Time to serialize gal into /tmp/LTLFireability5070717640513789502.gal : 1 ms
[2022-05-16 16:15:18] [INFO ] Time to serialize properties into /tmp/LTLFireability13847135280722572717.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5070717640513789502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13847135280722572717.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F("(i5.u3.DHAP>=1)")))
Formula 0 simplified : !F"(i5.u3.DHAP>=1)"
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin10848156829806476181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10848156829806476181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 23, guards 22
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: <>((LTLAPp0==true))
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: "<>((LTLAPp0==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.014: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.017: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.017: State length is 34, there are 23 groups
pins2lts-mc-linux64( 0/ 8), 0.017: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.017: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.017: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.017: Visible groups: 0 / 23, labels: 1 / 25
pins2lts-mc-linux64( 0/ 8), 0.017: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.017: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.097: [Blue] ~96 levels ~960 states ~1880 transitions
pins2lts-mc-linux64( 3/ 8), 0.147: [Blue] ~184 levels ~1920 states ~3352 transitions
pins2lts-mc-linux64( 0/ 8), 0.252: [Blue] ~428 levels ~3840 states ~6560 transitions
pins2lts-mc-linux64( 0/ 8), 0.468: [Blue] ~848 levels ~7680 states ~12320 transitions
pins2lts-mc-linux64( 3/ 8), 0.697: [Blue] ~1360 levels ~15360 states ~23512 transitions
pins2lts-mc-linux64( 6/ 8), 1.052: [Blue] ~2313 levels ~30720 states ~46192 transitions
pins2lts-mc-linux64( 0/ 8), 1.516: [Blue] ~6728 levels ~61440 states ~92960 transitions
pins2lts-mc-linux64( 6/ 8), 2.143: [Blue] ~9225 levels ~122880 states ~184432 transitions
pins2lts-mc-linux64( 4/ 8), 3.067: [Blue] ~26899 levels ~245760 states ~370936 transitions
pins2lts-mc-linux64( 4/ 8), 4.070: [Blue] ~28010 levels ~491520 states ~657424 transitions
pins2lts-mc-linux64( 4/ 8), 5.287: [Blue] ~28010 levels ~983040 states ~1229768 transitions
pins2lts-mc-linux64( 4/ 8), 7.093: [Blue] ~28010 levels ~1966080 states ~2375264 transitions
pins2lts-mc-linux64( 4/ 8), 10.481: [Blue] ~28010 levels ~3932160 states ~4667192 transitions
pins2lts-mc-linux64( 4/ 8), 17.400: [Blue] ~28010 levels ~7864320 states ~9252176 transitions
pins2lts-mc-linux64( 7/ 8), 31.507: [Blue] ~28013 levels ~15728640 states ~22856872 transitions
pins2lts-mc-linux64( 7/ 8), 59.619: [Blue] ~28013 levels ~31457280 states ~45021744 transitions
pins2lts-mc-linux64( 2/ 8), 104.229: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 104.372:
pins2lts-mc-linux64( 0/ 8), 104.372: Explored 48985654 states 68260396 transitions, fanout: 1.393
pins2lts-mc-linux64( 0/ 8), 104.372: Total exploration time 104.310 sec (104.180 sec minimum, 104.232 sec on average)
pins2lts-mc-linux64( 0/ 8), 104.372: States per second: 469616, Transitions per second: 654399
pins2lts-mc-linux64( 0/ 8), 104.372:
pins2lts-mc-linux64( 0/ 8), 104.372: State space has 49136793 states, 48771960 are accepting
pins2lts-mc-linux64( 0/ 8), 104.372: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 104.372: blue states: 48985654 (99.69%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 104.372: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 104.372: all-red states: 48771960 (99.26%), bogus 4770 (0.01%)
pins2lts-mc-linux64( 0/ 8), 104.372:
pins2lts-mc-linux64( 0/ 8), 104.372: Total memory used for local state coloring: 3.4MB
pins2lts-mc-linux64( 0/ 8), 104.372:
pins2lts-mc-linux64( 0/ 8), 104.372: Queue width: 8B, total height: 224023, memory: 1.71MB
pins2lts-mc-linux64( 0/ 8), 104.372: Tree memory: 630.9MB, 13.5 B/state, compr.: 9.8%
pins2lts-mc-linux64( 0/ 8), 104.372: Tree fill ratio (roots/leafs): 36.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 104.372: Stored 23 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 104.372: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 104.372: Est. total memory use: 632.6MB (~1025.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10848156829806476181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10848156829806476181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 16:35:47] [INFO ] Flatten gal took : 4 ms
[2022-05-16 16:35:47] [INFO ] Time to serialize gal into /tmp/LTLFireability12035036779052365360.gal : 1 ms
[2022-05-16 16:35:47] [INFO ] Time to serialize properties into /tmp/LTLFireability15695556107194051886.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12035036779052365360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15695556107194051886.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((F("(DHAP>=1)")))
Formula 0 simplified : !F"(DHAP>=1)"
Detected timeout of ITS tools.
[2022-05-16 16:56:18] [INFO ] Flatten gal took : 427 ms
[2022-05-16 16:56:19] [INFO ] Input system was already deterministic with 22 transitions.
[2022-05-16 16:56:19] [INFO ] Transformed 33 places.
[2022-05-16 16:56:19] [INFO ] Transformed 22 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 16:56:20] [INFO ] Time to serialize gal into /tmp/LTLFireability8589933136251670080.gal : 18 ms
[2022-05-16 16:56:20] [INFO ] Time to serialize properties into /tmp/LTLFireability14952594690129912986.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8589933136251670080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14952594690129912986.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(DHAP>=1)")))
Formula 0 simplified : !F"(DHAP>=1)"

BK_TIME_CONFINEMENT_REACHED

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

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