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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.0K Apr 29 18:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 18:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:35 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.5K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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: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-C0100N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652701542281

Running Version 202205111006
[2022-05-16 11:45:44] [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 11:45:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:45:44] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-16 11:45:44] [INFO ] Transformed 33 places.
[2022-05-16 11:45:44] [INFO ] Transformed 22 transitions.
[2022-05-16 11:45:44] [INFO ] Parsed PT model containing 33 places and 22 transitions in 333 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 1 formulas.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 17 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 11:45:45] [INFO ] Computed 12 place invariants in 15 ms
[2022-05-16 11:45:45] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:45:45] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 11:45:45] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:45:45] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 11:45:45] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:45:45] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 11:45:45] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Support contains 28 out of 33 places after structural reductions.
[2022-05-16 11:45:46] [INFO ] Flatten gal took : 40 ms
[2022-05-16 11:45:46] [INFO ] Flatten gal took : 14 ms
[2022-05-16 11:45:46] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10225 steps, including 3 resets, run finished after 111 ms. (steps per millisecond=92 ) properties (out of 23) seen :21
Finished Best-First random walk after 485 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=80 )
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(X(!p0)) U X(X((F(p1)&&!p2)))))'
Support contains 6 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 11:45:46] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 11:45:46] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:45:46] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 11:45:46] [INFO ] Implicit Places using invariants in 81 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 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 2 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 490 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), true, (OR (NOT p1) p2), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s1 1) (GEQ s21 1)), p0:(AND (GEQ s17 1) (GEQ s20 1)), p1:(AND (GEQ s7 1) (GEQ s11 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 2421 reset in 480 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-00 finished in 1245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(G(X(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 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 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 30 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 11:45:48] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 11:45:48] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2022-05-16 11:45:48] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 11:45:48] [INFO ] Implicit Places using invariants in 74 ms returned [2, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 16/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 21 transition count 15
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2022-05-16 11:45:48] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 11:45:48] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 15 rows 21 cols
[2022-05-16 11:45:48] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 11:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 11:45:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 15/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/33 places, 15/22 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-01 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 s1 1) (GEQ s14 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 1251 steps with 0 reset in 10 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-01 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0))||p2)))'
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 11:45:48] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 11:45:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:45:48] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 11:45:48] [INFO ] Implicit Places using invariants in 60 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 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 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s23 1) (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p0:(AND (GEQ s1 1) (GEQ s23 1)), p1:(AND (GEQ s1 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 268 ms.
Product exploration explored 100000 steps with 33333 reset in 339 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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) (NOT p1))
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-02 finished in 1095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p2)||p1)))'
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 7 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 11:45:49] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:45:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 18 rows 27 cols
[2022-05-16 11:45:49] [INFO ] Computed 10 place invariants in 8 ms
[2022-05-16 11:45:49] [INFO ] Implicit Places using invariants in 43 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/33 places, 18/22 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p2), true, p2]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s18 1)) (AND (GEQ s1 700) (GEQ s17 700))), p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s7 1) (GEQ s24 1)), p0:(AND (GEQ s0 1) (GEQ s2 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-03 finished in 185 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 2 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 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 0 with 3 rules applied. Total rules applied 9 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 0 with 2 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 8 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 11:45:49] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:45:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 11:45:49] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 11:45:49] [INFO ] Implicit Places using invariants in 57 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 17/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 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
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 8 place count 18 transition count 13
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 12
Applied a total of 10 rules in 6 ms. Remains 17 /22 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 17 cols
[2022-05-16 11:45:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 11:45:49] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2022-05-16 11:45:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 11:45:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:45:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 16/33 places, 12/22 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-04 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:(LT s7 1)], 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 35 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-04 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((!F(p0)||p1) U (p2 U p3))||X(p2)))'
Support contains 11 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 11:45:49] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 11:45:50] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:45:50] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 11:45:50] [INFO ] Implicit Places using invariants in 65 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 11 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p2) p3), (NOT p2), (AND (NOT p0) p3 (NOT p2)), (AND p3 (NOT p2)), (AND (NOT p2) p3), true, (NOT p0), (AND (NOT p0) p3), p3, p3]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=p3, acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=p3, acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s22 1)), p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s11 1) (GEQ s31 1)), p0:(AND (GEQ s3 2) (GEQ s14 1) (GEQ s27 1)), p2:(AND (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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16476 reset in 245 ms.
Product exploration explored 100000 steps with 16514 reset in 270 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 p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT p0))), true, (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 991 ms. Reduced automaton from 10 states, 21 edges and 4 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Finished random walk after 2897 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=482 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (X (X (NOT p0))), true, (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND p3 (NOT p0)))]
Knowledge based reduction with 15 factoid took 842 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Support contains 5 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 11:45:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 11:45:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 11:45:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 11:45:53] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2022-05-16 11:45:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 11:45:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 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/32 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 73 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Finished random walk after 2888 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=577 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) p3))]
Knowledge based reduction with 6 factoid took 386 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Product exploration explored 100000 steps with 16462 reset in 213 ms.
Product exploration explored 100000 steps with 16454 reset in 244 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3)]
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 71 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 29 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 29 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 29 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 6 rules in 11 ms. Remains 29 /31 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 29 cols
[2022-05-16 11:45:55] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:45:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2022-05-16 11:45:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 29 cols
[2022-05-16 11:45:55] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 11:45:55] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/31 places, 20/22 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/31 places, 20/22 transitions.
Product exploration explored 100000 steps with 16632 reset in 445 ms.
Product exploration explored 100000 steps with 16668 reset in 439 ms.
Built C files in :
/tmp/ltsmin6189474170162924707
[2022-05-16 11:45:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6189474170162924707
Running compilation step : cd /tmp/ltsmin6189474170162924707;'/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 350 ms.
Running link step : cd /tmp/ltsmin6189474170162924707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6189474170162924707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12903781442551187980.hoa' '--buchi-type=spotba'
LTSmin run took 1552 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-05 finished in 8953 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!F(!F(X(p0))) U p1)||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.
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 Post agglomeration using F-continuation condition.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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 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 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 5 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 11:45:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:45:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2022-05-16 11:45:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:45:58] [INFO ] Implicit Places using invariants in 36 ms returned [2, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/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 22 transition count 16
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 22 cols
[2022-05-16 11:45:58] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 11:45:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2022-05-16 11:45:59] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 11:45:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 11:45:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/33 places, 16/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LT s11 1) (OR (LT s8 1) (LT s16 300))), p1:(AND (GEQ s1 1) (GEQ s15 1)), p0:(AND (GEQ s2 1) (GEQ s18 200))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 79 reset in 457 ms.
Product exploration explored 100000 steps with 79 reset in 273 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 649 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 402 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p1), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 12 factoid took 857 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2022-05-16 11:46:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 11:46:02] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 16 rows 22 cols
[2022-05-16 11:46:02] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 11:46:02] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2022-05-16 11:46:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 11:46:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 11:46:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-16 11:46:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2022-05-16 11:46:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 11:46:02] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 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 : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 527 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Finished random walk after 402 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=402 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 805 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 79 reset in 152 ms.
Product exploration explored 100000 steps with 79 reset in 194 ms.
Built C files in :
/tmp/ltsmin11512875042611287055
[2022-05-16 11:46:05] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2022-05-16 11:46:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:46:05] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2022-05-16 11:46:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:46:05] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2022-05-16 11:46:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:46:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11512875042611287055
Running compilation step : cd /tmp/ltsmin11512875042611287055;'/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 138 ms.
Running link step : cd /tmp/ltsmin11512875042611287055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11512875042611287055;'/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/stateBased2450950546185152863.hoa' '--buchi-type=spotba'
LTSmin run took 824 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-07 finished in 7167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&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 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 11:46:06] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 11:46:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:46:06] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 11:46:06] [INFO ] Implicit Places using invariants in 50 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 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 0 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 126 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s9 1) (LT s4 2)), p1:(LT s4 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 16 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-08 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 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 11:46:06] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:46:06] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:46:06] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 11:46:06] [INFO ] Implicit Places using invariants in 74 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 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 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s20 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]]
Product exploration explored 100000 steps with 34 reset in 168 ms.
Product exploration explored 100000 steps with 34 reset in 195 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 p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 11:46:07] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 11:46:07] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 11:46:07] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-16 11:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:46:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 11:46:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:46:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 11:46:07] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-16 11:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:46:08] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 11:46:08] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 11:46:08] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 11:46:08] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 11:46:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 11:46:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 11:46:08] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 22 rows 29 cols
[2022-05-16 11:46:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 11:46:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 132 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 27/29 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 55 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 27 cols
[2022-05-16 11:46:08] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 11:46:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 11:46:09] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-16 11:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:46:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 11:46:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:46:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 11:46:09] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-16 11:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:46:09] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 11:46:09] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 11:46:09] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34 reset in 152 ms.
Product exploration explored 100000 steps with 34 reset in 190 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 2 / 27 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.
Graph (complete) has 53 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 24 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 24 transition count 20
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 24 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 21 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 21 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 21 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 19 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 19 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 20 rules in 9 ms. Remains 19 /27 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 19 cols
[2022-05-16 11:46:09] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 11:46:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2022-05-16 11:46:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2022-05-16 11:46:09] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 11:46:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/27 places, 15/22 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/27 places, 15/22 transitions.
Product exploration explored 100000 steps with 120 reset in 422 ms.
Product exploration explored 100000 steps with 120 reset in 594 ms.
Built C files in :
/tmp/ltsmin10478395504033334572
[2022-05-16 11:46:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10478395504033334572
Running compilation step : cd /tmp/ltsmin10478395504033334572;'/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 169 ms.
Running link step : cd /tmp/ltsmin10478395504033334572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10478395504033334572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3750189970788950488.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 27 cols
[2022-05-16 11:46:26] [INFO ] Computed 6 place invariants in 13 ms
[2022-05-16 11:46:26] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
// Phase 1: matrix 22 rows 27 cols
[2022-05-16 11:46:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 11:46:26] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 22 rows 27 cols
[2022-05-16 11:46:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 11:46:26] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 27 cols
[2022-05-16 11:46:26] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 11:46:26] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin17000249477676216730
[2022-05-16 11:46:26] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17000249477676216730
Running compilation step : cd /tmp/ltsmin17000249477676216730;'/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 141 ms.
Running link step : cd /tmp/ltsmin17000249477676216730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17000249477676216730;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4151338184118841205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:46:41] [INFO ] Flatten gal took : 6 ms
[2022-05-16 11:46:41] [INFO ] Flatten gal took : 4 ms
[2022-05-16 11:46:41] [INFO ] Time to serialize gal into /tmp/LTL2906142677285542250.gal : 2 ms
[2022-05-16 11:46:41] [INFO ] Time to serialize properties into /tmp/LTL5398662149090389703.ltl : 1 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/LTL2906142677285542250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5398662149090389703.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/LTL2906142...266
Read 1 LTL properties
Checking formula 0 : !((X(G("(start<1)"))))
Formula 0 simplified : !XG"(start<1)"
Detected timeout of ITS tools.
[2022-05-16 11:46:56] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:46:56] [INFO ] Applying decomposition
[2022-05-16 11:46:56] [INFO ] Flatten gal took : 3 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/graph2240255110385306160.txt' '-o' '/tmp/graph2240255110385306160.bin' '-w' '/tmp/graph2240255110385306160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2240255110385306160.bin' '-l' '-1' '-v' '-w' '/tmp/graph2240255110385306160.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:46:56] [INFO ] Decomposing Gal with order
[2022-05-16 11:46:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:46:56] [INFO ] Removed a total of 3 redundant transitions.
[2022-05-16 11:46:56] [INFO ] Flatten gal took : 81 ms
[2022-05-16 11:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 11:46:56] [INFO ] Time to serialize gal into /tmp/LTL8491701580308616887.gal : 2 ms
[2022-05-16 11:46:56] [INFO ] Time to serialize properties into /tmp/LTL14792199421401600786.ltl : 1 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/LTL8491701580308616887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14792199421401600786.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/LTL8491701...246
Read 1 LTL properties
Checking formula 0 : !((X(G("(i2.u6.start<1)"))))
Formula 0 simplified : !XG"(i2.u6.start<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5980016151744348199
[2022-05-16 11:47:11] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5980016151744348199
Running compilation step : cd /tmp/ltsmin5980016151744348199;'/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 169 ms.
Running link step : cd /tmp/ltsmin5980016151744348199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5980016151744348199;'/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' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-09 finished in 80636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(p1)&&p0)))))'
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 11:47:26] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:26] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:47:26] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:27] [INFO ] Implicit Places using invariants in 55 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 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 122 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s4 2) (OR (LT s12 1) (LT s23 300))), p1:(LT s4 2)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-10 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||(F(p1)&&F(p2))) U X(G(p2)))))'
Support contains 6 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 11:47:27] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:47:27] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 11:47:27] [INFO ] Implicit Places using invariants in 57 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 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 134 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1)), p1:(AND (GEQ s1 1) (GEQ s23 1)), p2:(AND (GEQ s6 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10955 steps with 16 reset in 32 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-11 finished in 293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(G(G(p0))))||X((F(p2)&&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 11:47:27] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:27] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:47:27] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:27] [INFO ] Implicit Places using invariants in 61 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 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 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1)), p2:(AND (GEQ s6 1) (GEQ s10 1)), p0:(LT s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 169 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-C0100N0000001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-13 finished in 554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||((X(X(p2))&&p1) U p3))))'
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 11:47:28] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:47:28] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 11:47:28] [INFO ] Implicit Places using invariants in 52 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 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 381 ms :[(AND (NOT p0) (NOT p3)), true, (NOT p0), (OR (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p3 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(OR p3 p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 2}]], initial=0, aps=[p3:(LT s17 1), p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(OR (LT s2 1) (LT s3 1)), p2:(GEQ s20 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-14 finished in 543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||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 11:47:28] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 11:47:28] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 11:47:28] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 11:47:28] [INFO ] Implicit Places using invariants in 58 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 60 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 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s17 1), p1:(AND (GEQ s5 1) (GEQ s25 200))], 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 1507 reset in 212 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-15 finished in 540 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : GPPP-PT-C0100N0000001000-LTLFireability-09
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 1 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 1 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 1 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 1 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 13 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 11:47:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:47:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 16 rows 25 cols
[2022-05-16 11:47:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 11:47:29] [INFO ] Implicit Places using invariants in 60 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 21/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 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 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 2 with 4 rules applied. Total rules applied 10 place count 16 transition count 11
Applied a total of 10 rules in 6 ms. Remains 16 /21 variables (removed 5) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:29] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 11:47:29] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:29] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 11:47:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:47:29] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 16/33 places, 11/22 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/33 places, 11/22 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s7 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 120 reset in 140 ms.
Product exploration explored 100000 steps with 120 reset in 161 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 p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:30] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 11:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:47:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 11:47:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:47:30] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-16 11:47:30] [INFO ] Computed and/alt/rep : 10/25/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 11:47:30] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:30] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 11:47:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:30] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 11:47:30] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:30] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 11:47:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:47:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:30] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 11:47:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 11/11 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 p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:31] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 11:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:47:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 11:47:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:47:31] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-16 11:47:31] [INFO ] Computed and/alt/rep : 10/25/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 11:47:31] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 120 reset in 138 ms.
Product exploration explored 100000 steps with 120 reset in 162 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:32] [INFO ] Invariants computation overflowed in 0 ms
[2022-05-16 11:47:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2022-05-16 11:47:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:47:32] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-16 11:47:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 11/11 transitions.
Product exploration explored 100000 steps with 120 reset in 135 ms.
Product exploration explored 100000 steps with 120 reset in 168 ms.
Built C files in :
/tmp/ltsmin8285667041279840375
[2022-05-16 11:47:32] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8285667041279840375
Running compilation step : cd /tmp/ltsmin8285667041279840375;'/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 141 ms.
Running link step : cd /tmp/ltsmin8285667041279840375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8285667041279840375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2536306339591529662.hoa' '--buchi-type=spotba'
LTSmin run took 5347 ms.
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-09 finished in 8994 ms.
CL/SL decision was in the wrong direction : SL + true
[2022-05-16 11:47:38] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4900976764870232422
[2022-05-16 11:47:38] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2022-05-16 11:47:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:47:38] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2022-05-16 11:47:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:47:38] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2022-05-16 11:47:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:47:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4900976764870232422
Running compilation step : cd /tmp/ltsmin4900976764870232422;'/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 11:47:38] [INFO ] Applying decomposition
[2022-05-16 11:47:38] [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/graph1456922968124083477.txt' '-o' '/tmp/graph1456922968124083477.bin' '-w' '/tmp/graph1456922968124083477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1456922968124083477.bin' '-l' '-1' '-v' '-w' '/tmp/graph1456922968124083477.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:47:38] [INFO ] Decomposing Gal with order
[2022-05-16 11:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:47:38] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-16 11:47:38] [INFO ] Flatten gal took : 6 ms
[2022-05-16 11:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 11:47:38] [INFO ] Time to serialize gal into /tmp/LTLFireability12876333567023385107.gal : 1 ms
[2022-05-16 11:47:38] [INFO ] Time to serialize properties into /tmp/LTLFireability8198805445408917342.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/LTLFireability12876333567023385107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8198805445408917342.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 : !((X(G("(i3.u6.start<1)"))))
Formula 0 simplified : !XG"(i3.u6.start<1)"
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin4900976764870232422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4900976764870232422;'/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' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.063: DFS-FIFO for weak LTL, using special progress label 24
pins2lts-mc-linux64( 0/ 8), 0.063: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.063: State length is 34, there are 26 groups
pins2lts-mc-linux64( 0/ 8), 0.063: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.063: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.063: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.063: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.134: ~1 levels ~960 states ~3728 transitions
pins2lts-mc-linux64( 4/ 8), 0.162: ~1 levels ~1920 states ~8448 transitions
pins2lts-mc-linux64( 6/ 8), 0.210: ~1 levels ~3840 states ~20744 transitions
pins2lts-mc-linux64( 6/ 8), 0.271: ~1 levels ~7680 states ~42768 transitions
pins2lts-mc-linux64( 6/ 8), 0.431: ~1 levels ~15360 states ~88824 transitions
pins2lts-mc-linux64( 6/ 8), 0.724: ~1 levels ~30720 states ~190224 transitions
pins2lts-mc-linux64( 6/ 8), 1.188: ~1 levels ~61440 states ~409712 transitions
pins2lts-mc-linux64( 6/ 8), 3.459: ~1 levels ~122880 states ~868984 transitions
pins2lts-mc-linux64( 7/ 8), 5.436: ~1 levels ~245760 states ~1728704 transitions
pins2lts-mc-linux64( 7/ 8), 6.918: ~1 levels ~491520 states ~3565920 transitions
pins2lts-mc-linux64( 7/ 8), 12.052: ~1 levels ~983040 states ~7348896 transitions
pins2lts-mc-linux64( 1/ 8), 18.242: ~1 levels ~1966080 states ~14934720 transitions
pins2lts-mc-linux64( 1/ 8), 24.993: ~1 levels ~3932160 states ~30930448 transitions
pins2lts-mc-linux64( 2/ 8), 38.441: ~1 levels ~7864320 states ~64645352 transitions
pins2lts-mc-linux64( 4/ 8), 62.834: ~1 levels ~15728640 states ~125005664 transitions
pins2lts-mc-linux64( 7/ 8), 112.259: ~1 levels ~31457280 states ~258766560 transitions
pins2lts-mc-linux64( 7/ 8), 211.900: ~1 levels ~62914560 states ~518537768 transitions
pins2lts-mc-linux64( 7/ 8), 447.712: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 447.795:
pins2lts-mc-linux64( 0/ 8), 447.795: mean standard work distribution: 2.3% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 447.795:
pins2lts-mc-linux64( 0/ 8), 447.795: Explored 114983497 states 986767818 transitions, fanout: 8.582
pins2lts-mc-linux64( 0/ 8), 447.795: Total exploration time 447.730 sec (447.620 sec minimum, 447.665 sec on average)
pins2lts-mc-linux64( 0/ 8), 447.795: States per second: 256814, Transitions per second: 2203935
pins2lts-mc-linux64( 0/ 8), 447.795:
pins2lts-mc-linux64( 0/ 8), 447.795: Progress states detected: 134217233
pins2lts-mc-linux64( 0/ 8), 447.795: Redundant explorations: -14.3304
pins2lts-mc-linux64( 0/ 8), 447.795:
pins2lts-mc-linux64( 0/ 8), 447.795: Queue width: 8B, total height: 41048861, memory: 313.18MB
pins2lts-mc-linux64( 0/ 8), 447.795: Tree memory: 1123.1MB, 8.8 B/state, compr.: 6.4%
pins2lts-mc-linux64( 0/ 8), 447.795: Tree fill ratio (roots/leafs): 99.0%/38.0%
pins2lts-mc-linux64( 0/ 8), 447.795: Stored 23 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 447.795: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 447.795: Est. total memory use: 1436.3MB (~1337.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4900976764870232422;'/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' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4900976764870232422;'/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' 'X([]((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 12:08:15] [INFO ] Flatten gal took : 4 ms
[2022-05-16 12:08:15] [INFO ] Time to serialize gal into /tmp/LTLFireability11114132294113122396.gal : 6 ms
[2022-05-16 12:08:15] [INFO ] Time to serialize properties into /tmp/LTLFireability14375046328557070731.ltl : 1 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/LTLFireability11114132294113122396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14375046328557070731.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 : !((X(G("(start<1)"))))
Formula 0 simplified : !XG"(start<1)"
Detected timeout of ITS tools.
[2022-05-16 12:28:56] [INFO ] Flatten gal took : 431 ms
[2022-05-16 12:28:57] [INFO ] Input system was already deterministic with 22 transitions.
[2022-05-16 12:28:57] [INFO ] Transformed 33 places.
[2022-05-16 12:28:57] [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 12:28:58] [INFO ] Time to serialize gal into /tmp/LTLFireability12889274696588895505.gal : 6 ms
[2022-05-16 12:28:58] [INFO ] Time to serialize properties into /tmp/LTLFireability2966644089635319543.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/LTLFireability12889274696588895505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2966644089635319543.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 : !((X(G("(start<1)"))))
Formula 0 simplified : !XG"(start<1)"
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
Computing Next relation with stutter on 1 deadlock states

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

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