Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850900804.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPPP-PT-C0001N0000010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850900804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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-C0001N0000010000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000010000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679590445865

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000010000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 16:54:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 16:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:54:07] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 16:54:07] [INFO ] Transformed 33 places.
[2023-03-23 16:54:07] [INFO ] Transformed 22 transitions.
[2023-03-23 16:54:07] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 16:54:07] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-23 16:54:07] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
[2023-03-23 16:54:07] [INFO ] Invariant cache hit.
[2023-03-23 16:54:07] [INFO ] Implicit Places using invariants in 40 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 31/33 places, 22/22 transitions.
Support contains 22 out of 31 places after structural reductions.
[2023-03-23 16:54:08] [INFO ] Flatten gal took : 18 ms
[2023-03-23 16:54:08] [INFO ] Flatten gal took : 5 ms
[2023-03-23 16:54:08] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 16:54:08] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-23 16:54:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 16:54:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-23 16:54:08] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 16:54:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 16:54:08] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 23 ms returned sat
[2023-03-23 16:54:08] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p0 U p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 16:54:08] [INFO ] Invariant cache hit.
[2023-03-23 16:54:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-23 16:54:08] [INFO ] Invariant cache hit.
[2023-03-23 16:54:08] [INFO ] Implicit Places using invariants in 35 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 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 LTL mode , in 2 iterations and 73 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s4 2), p1:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7839 reset in 207 ms.
Stack based approach found an accepted trace after 164 steps with 13 reset with depth 15 and stack size 15 in 2 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-00 finished in 573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 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 2 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 30 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 29 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 29 transition count 19
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 28 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 25 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 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 22 transition count 15
Applied a total of 15 rules in 23 ms. Remains 22 /31 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-23 16:54:09] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-23 16:54:09] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-23 16:54:09] [INFO ] Invariant cache hit.
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants in 33 ms returned [0, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 15/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 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 0 with 4 rules applied. Total rules applied 4 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 0 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 16:54:09] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-23 16:54:09] [INFO ] Invariant cache hit.
[2023-03-23 16:54:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/31 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 17/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-03 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 s0 1) (GEQ s8 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-03 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 4 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 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 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 29 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 29 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 28 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 25 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 23 transition count 16
Applied a total of 13 rules in 12 ms. Remains 23 /31 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-23 16:54:09] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 16:54:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 16:54:09] [INFO ] Invariant cache hit.
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants in 35 ms returned [1, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 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 20 transition count 15
Applied a total of 2 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 20 cols
[2023-03-23 16:54:09] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-23 16:54:09] [INFO ] Invariant cache hit.
[2023-03-23 16:54:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/31 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 20/31 places, 15/22 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s2 1) (GEQ s5 1)), p0:(OR (LT s0 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-04 finished in 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(F(!p0)||G(p1))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 16:54:09] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-23 16:54:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-23 16:54:09] [INFO ] Invariant cache hit.
[2023-03-23 16:54:09] [INFO ] Implicit Places using invariants in 44 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 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 LTL mode , in 2 iterations and 80 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s26 1)), p1:(OR (LT s15 1) (LT 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][false, false, false, false]]
Product exploration explored 100000 steps with 6291 reset in 143 ms.
Stack based approach found an accepted trace after 133 steps with 8 reset with depth 9 and stack size 9 in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-06 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 16:54:10] [INFO ] Invariant cache hit.
[2023-03-23 16:54:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-23 16:54:10] [INFO ] Invariant cache hit.
[2023-03-23 16:54:10] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 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 LTL mode , in 2 iterations and 80 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s3 2), p0:(OR (LT s14 1) (LT s15 1))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-07 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 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.
[2023-03-23 16:54:10] [INFO ] Invariant cache hit.
[2023-03-23 16:54:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-23 16:54:10] [INFO ] Invariant cache hit.
[2023-03-23 16:54:10] [INFO ] Implicit Places using invariants in 44 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9188 reset in 79 ms.
Product exploration explored 100000 steps with 9254 reset in 98 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 22 rows 28 cols
[2023-03-23 16:54:11] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-23 16:54:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:54:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 16:54:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:54:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:54:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-23 16:54:11] [INFO ] Computed and/alt/rep : 21/39/21 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 16:54:11] [INFO ] Added : 21 causal constraints over 5 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 18
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 24 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 23 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 23 transition count 16
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 12 place count 22 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 17 place count 19 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 17 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 22 place count 16 transition count 12
Applied a total of 22 rules in 4 ms. Remains 16 /28 variables (removed 12) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-23 16:54:11] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-23 16:54:11] [INFO ] Invariant cache hit.
[2023-03-23 16:54:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-23 16:54:11] [INFO ] Invariant cache hit.
[2023-03-23 16:54:11] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-23 16:54:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:54:11] [INFO ] Invariant cache hit.
[2023-03-23 16:54:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/28 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 16/28 places, 12/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-23 16:54:11] [INFO ] Invariant cache hit.
[2023-03-23 16:54:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:54:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-23 16:54:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:54:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 16:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:54:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-23 16:54:11] [INFO ] Computed and/alt/rep : 11/28/11 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-23 16:54:12] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23664 reset in 99 ms.
Product exploration explored 100000 steps with 23740 reset in 99 ms.
Built C files in :
/tmp/ltsmin15194931202609635970
[2023-03-23 16:54:12] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2023-03-23 16:54:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:54:12] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2023-03-23 16:54:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:54:12] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2023-03-23 16:54:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:54:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15194931202609635970
Running compilation step : cd /tmp/ltsmin15194931202609635970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin15194931202609635970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15194931202609635970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14353564702829172153.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-08 finished in 2139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 16:54:12] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-23 16:54:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-23 16:54:12] [INFO ] Invariant cache hit.
[2023-03-23 16:54:12] [INFO ] Implicit Places using invariants in 30 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 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 LTL mode , in 2 iterations and 72 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s5 1) (LT s26 1)), p1:(OR (LT s0 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 69 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 p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-10 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(!p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 16:54:13] [INFO ] Invariant cache hit.
[2023-03-23 16:54:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-23 16:54:13] [INFO ] Invariant cache hit.
[2023-03-23 16:54:13] [INFO ] Implicit Places using invariants in 30 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 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 LTL mode , in 2 iterations and 84 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s11 1)) (OR (LT s6 1) (LT s10 1))), p1:(AND (GEQ s6 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Product exploration explored 100000 steps with 50000 reset in 67 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 p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-11 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((!p1 U (p2||G(!p1)))))))'
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.
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 30 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 29 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 29 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 28 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 25 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 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 22 transition count 15
Applied a total of 15 rules in 11 ms. Remains 22 /31 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-23 16:54:13] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-23 16:54:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-23 16:54:13] [INFO ] Invariant cache hit.
[2023-03-23 16:54:13] [INFO ] Implicit Places using invariants in 29 ms returned [1, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 15/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 20/31 places, 15/22 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 7) (GEQ s12 7)), p2:(AND (NOT (AND (GEQ s0 1) (GEQ s6 1) (GEQ s0 7) (GEQ s12 7))) (NOT (AND (GEQ s7 1) (GEQ s14 3)))), p1:(AND (GEQ s7 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-13 finished in 210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0 U p1))))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 16:54:13] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-23 16:54:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-23 16:54:13] [INFO ] Invariant cache hit.
[2023-03-23 16:54:13] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s22 3)), p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s26 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-14 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 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 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 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 29 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 29 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 28 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 25 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 23 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 22 transition count 15
Applied a total of 15 rules in 11 ms. Remains 22 /31 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-23 16:54:14] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-23 16:54:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-23 16:54:14] [INFO ] Invariant cache hit.
[2023-03-23 16:54:14] [INFO ] Implicit Places using invariants in 39 ms returned [0, 1, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 15/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 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 13
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 17 transition count 12
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 6 place count 16 transition count 12
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 14 transition count 10
Applied a total of 10 rules in 3 ms. Remains 14 /19 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-23 16:54:14] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 16:54:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-23 16:54:14] [INFO ] Invariant cache hit.
[2023-03-23 16:54:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:54:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/31 places, 10/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 14/31 places, 10/22 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000010000-LTLFireability-15 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:(AND (GEQ s1 1) (GEQ s2 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000010000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000010000-LTLFireability-15 finished in 236 ms.
All properties solved by simple procedures.
Total runtime 6927 ms.

BK_STOP 1679590455100

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-C0001N0000010000"
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-5348"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000010000, 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 r165-tall-167838850900804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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