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.r169-tall-167838856600892.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 ltsminxred
Input is GPPP-PT-C1000N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856600892
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:38 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.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:40 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-C1000N0000000100-LTLFireability-00
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-09
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-10
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-11
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-12
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-13
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-14
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678661616556

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:53:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:53:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:53:38] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 22:53:38] [INFO ] Transformed 33 places.
[2023-03-12 22:53:38] [INFO ] Transformed 22 transitions.
[2023-03-12 22:53:38] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 83 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 5 formulas.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 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-12 22:53:38] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-12 22:53:38] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:38] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-12 22:53:38] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:38] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:53:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:38] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:53:38] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 26 out of 33 places after structural reductions.
[2023-03-12 22:53:38] [INFO ] Flatten gal took : 18 ms
[2023-03-12 22:53:38] [INFO ] Flatten gal took : 5 ms
[2023-03-12 22:53:38] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10004 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:53:39] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
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' '!(F(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 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 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
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 24 transition count 15
Applied a total of 15 rules in 15 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:39] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:53:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:39] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [0, 2, 13, 17]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 124 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/33 places, 15/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 19 transition count 14
Applied a total of 2 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 19 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-12 22:53:39] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:39] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/33 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 19/33 places, 14/22 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-00 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 s11 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 3 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-00 finished in 517 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((G(F(p1))||p0)))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:39] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:39] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 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 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s25 1)), p1:(OR (AND (GEQ s18 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s31 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 2546 reset in 260 ms.
Stack based approach found an accepted trace after 41 steps with 1 reset with depth 18 and stack size 18 in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-02 finished in 570 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' '!((!p0 U X((G(p1) U G(p0)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:40] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:53:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:40] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:40] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:40] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 103 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 LTL mode , in 2 iterations and 147 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), true, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, 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}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 736 steps with 0 reset in 5 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-03 finished in 371 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(((p0 U p1)&&X(G(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
[2023-03-12 22:53:40] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:40] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:40] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:40] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 103 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 140 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(AND (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s15 1), p0:(AND (GEQ s17 1) (GEQ s20 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 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-04 finished in 351 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)) U (X(p2)&&p1)))'
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
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 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 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 32/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s13 1) (GEQ s18 1) (GEQ s21 1)), p0:(AND (GEQ s2 1) (GEQ s22 1)), p2:(AND (GEQ s18 1) (GEQ s21 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33237 reset in 130 ms.
Stack based approach found an accepted trace after 10494 steps with 3494 reset with depth 7 and stack size 7 in 15 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-05 finished in 430 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((X(p0)||F(!p1)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 8 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 79 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s16 1)), p1:(AND (GEQ s11 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-06 finished in 259 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&&(p1||X(p2))))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 31/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 1) (LT s11 1) (LT s30 1)), p1:(GEQ s6 2), p2:(AND (GEQ s1 1) (GEQ s13 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][false, false, false]]
Product exploration explored 100000 steps with 19986 reset in 124 ms.
Product exploration explored 100000 steps with 20047 reset in 115 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) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 348 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1516 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=303 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:43] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:43] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-12 22:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:43] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-12 22:53:43] [INFO ] Computed and/alt/rep : 21/42/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 22:53:43] [INFO ] Added : 20 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 7 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-12 22:53:43] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:43] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 22:53:43] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:43] [INFO ] Invariants computation overflowed in 2 ms
[2023-03-12 22:53:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:43] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 31/31 places, 22/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 : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1719 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=343 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 487 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:45] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-12 22:53:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-12 22:53:45] [INFO ] Computed and/alt/rep : 21/42/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 22:53:45] [INFO ] Added : 20 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 20029 reset in 101 ms.
Product exploration explored 100000 steps with 19955 reset in 110 ms.
Support contains 7 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.
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:45] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:45] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:45] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2023-03-12 22:53:45] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 31/31 places, 22/22 transitions.
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-07 finished in 4153 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(p1)||p0))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 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 4 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:46] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:46] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [2, 3, 14]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 78 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
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:46] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:46] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 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 SI_LTL mode , in 2 iterations and 165 ms. Remains : 22/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(OR (GEQ s9 1) (AND (GEQ s1 1) (GEQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1276 steps with 0 reset in 5 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-08 finished in 268 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((p0||X(X(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:46] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:46] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 93 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 LTL mode , in 2 iterations and 130 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (GEQ s7 1) (GEQ s11 1)), p1:(LT s10 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Product exploration explored 100000 steps with 25000 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 1416 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=472 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:47] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:47] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:47] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:47] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-12 22:53:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 30/30 places, 22/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 : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 909 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=454 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 79 ms.
Product exploration explored 100000 steps with 25000 reset in 74 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 4 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 4 rules applied. Total rules applied 8 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2023-03-12 22:53:48] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-12 22:53:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2023-03-12 22:53:48] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 20/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 28/30 places, 20/22 transitions.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 30/30 places, 22/22 transitions.
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-09 finished in 2875 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))||G(p1)))'
Support contains 3 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
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 23/33 places, 16/22 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s12 1), p0:(OR (LT s10 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-14 finished in 264 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(G(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
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 22:53:49] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:49] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [2, 3, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 83 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 LTL mode , in 2 iterations and 117 ms. Remains : 30/33 places, 22/22 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-15 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:(AND (LT s21 1) (OR (LT s7 1) (LT s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-15 finished in 224 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&&(p1||X(p2))))))'
Found a Shortening insensitive property : GPPP-PT-C1000N0000000100-LTLFireability-07
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_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
Applied a total of 4 rules in 3 ms. Remains 31 /33 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 31 cols
[2023-03-12 22:53:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 20 rows 31 cols
[2023-03-12 22:53:50] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:50] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 31 cols
[2023-03-12 22:53:50] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-12 22:53:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 71 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 29/33 places, 20/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 108 ms. Remains : 29/33 places, 20/22 transitions.
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 1) (LT s11 1) (LT s28 1)), p1:(GEQ s6 2), p2:(AND (GEQ s1 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19986 reset in 87 ms.
Product exploration explored 100000 steps with 20059 reset in 109 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) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1014 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=253 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:51] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 22:53:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:51] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-12 22:53:51] [INFO ] Computed and/alt/rep : 19/40/19 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 22:53:51] [INFO ] Added : 18 causal constraints over 4 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:51] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:51] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:51] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:51] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:51] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:51] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 29/29 places, 20/20 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 p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1621 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=810 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:52] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 22:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-12 22:53:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:53:52] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-12 22:53:52] [INFO ] Computed and/alt/rep : 19/40/19 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 22:53:52] [INFO ] Added : 18 causal constraints over 4 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 20036 reset in 91 ms.
Product exploration explored 100000 steps with 20016 reset in 99 ms.
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:53] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:53] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 22:53:53] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 22:53:53] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 29/29 places, 20/20 transitions.
Treatment of property GPPP-PT-C1000N0000000100-LTLFireability-07 finished in 3824 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((p0||X(X(p1)))))'
[2023-03-12 22:53:53] [INFO ] Flatten gal took : 3 ms
[2023-03-12 22:53:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 22:53:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 1 ms.
Total runtime 15342 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1537/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1537/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GPPP-PT-C1000N0000000100-LTLFireability-07
Could not compute solution for formula : GPPP-PT-C1000N0000000100-LTLFireability-09

BK_STOP 1678661636113

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name GPPP-PT-C1000N0000000100-LTLFireability-07
ltl formula formula --ltl=/tmp/1537/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 22 transitions and 83 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1537/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name GPPP-PT-C1000N0000000100-LTLFireability-09
ltl formula formula --ltl=/tmp/1537/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 22 transitions and 83 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1537/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-C1000N0000000100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPPP-PT-C1000N0000000100, 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 r169-tall-167838856600892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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