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-167838856200628.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 FunctionPointer-PT-a016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856200628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.5K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K 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 FunctionPointer-PT-a016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-a016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678593015087

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=FunctionPointer-PT-a016
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 03:50:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 03:50:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 03:50:16] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-12 03:50:16] [INFO ] Transformed 40 places.
[2023-03-12 03:50:16] [INFO ] Transformed 70 transitions.
[2023-03-12 03:50:16] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 98 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 4 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 10 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
[2023-03-12 03:50:17] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 31 cols
[2023-03-12 03:50:17] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 03:50:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-12 03:50:17] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:17] [INFO ] Invariant cache hit.
[2023-03-12 03:50:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 03:50:17] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:17] [INFO ] Invariant cache hit.
[2023-03-12 03:50:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 66/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 31/34 places, 66/66 transitions.
Support contains 24 out of 31 places after structural reductions.
[2023-03-12 03:50:17] [INFO ] Flatten gal took : 22 ms
[2023-03-12 03:50:17] [INFO ] Flatten gal took : 9 ms
[2023-03-12 03:50:17] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 03:50:17] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:17] [INFO ] Invariant cache hit.
[2023-03-12 03:50:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 03:50:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 03:50:17] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 8 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(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Applied a total of 4 rules in 4 ms. Remains 30 /31 variables (removed 1) and now considering 62/66 (removed 4) transitions.
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2023-03-12 03:50:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 03:50:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:18] [INFO ] Invariant cache hit.
[2023-03-12 03:50:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:18] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:18] [INFO ] Invariant cache hit.
[2023-03-12 03:50:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 30/31 places, 62/66 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-01 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 (GEQ s0 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-01 finished in 448 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(!p0))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 60
Applied a total of 6 rules in 16 ms. Remains 30 /31 variables (removed 1) and now considering 60/66 (removed 6) transitions.
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 03:50:18] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 03:50:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:18] [INFO ] Invariant cache hit.
[2023-03-12 03:50:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-12 03:50:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:18] [INFO ] Invariant cache hit.
[2023-03-12 03:50:18] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 30/31 places, 60/66 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 109 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-02 finished in 298 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)||F(X(p0))))) U p1))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Applied a total of 4 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 62/66 (removed 4) transitions.
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2023-03-12 03:50:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 03:50:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:18] [INFO ] Invariant cache hit.
[2023-03-12 03:50:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-12 03:50:18] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:18] [INFO ] Invariant cache hit.
[2023-03-12 03:50:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 30/31 places, 62/66 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s20 1)), p0:(AND (GEQ s2 1) (GEQ s13 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]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-04 finished in 316 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(p0))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Applied a total of 4 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 62/66 (removed 4) transitions.
[2023-03-12 03:50:19] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:19] [INFO ] Invariant cache hit.
[2023-03-12 03:50:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 03:50:19] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:19] [INFO ] Invariant cache hit.
[2023-03-12 03:50:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-12 03:50:19] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:19] [INFO ] Invariant cache hit.
[2023-03-12 03:50:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 30/31 places, 62/66 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s11 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-05 finished in 277 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(((F(p0)||G(p1)) U ((!p3 U G(p4))&&p2)))))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 60
Applied a total of 6 rules in 7 ms. Remains 30 /31 variables (removed 1) and now considering 60/66 (removed 6) transitions.
[2023-03-12 03:50:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 03:50:19] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 03:50:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 03:50:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:19] [INFO ] Invariant cache hit.
[2023-03-12 03:50:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-12 03:50:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 03:50:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:19] [INFO ] Invariant cache hit.
[2023-03-12 03:50:19] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 30/31 places, 60/66 transitions.
Stuttering acceptance computed with spot in 1214 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p0) (NOT p4)), (NOT p4), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p4)), (NOT p4), (AND (NOT p0) (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (AND (NOT p4) p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND p2 p4 p3 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 7}, { cond=(AND p2 p4 p3), acceptance={} source=0 dest: 8}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={} source=0 dest: 9}], [{ cond=(OR (AND p2 p4 (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND (NOT p0) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 2} source=1 dest: 3}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 4}, { cond=(AND p2 p4 p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 7}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={2} source=1 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 1, 2} source=1 dest: 10}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=1 dest: 11}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=1 dest: 11}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={1, 2} source=1 dest: 12}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (AND (NOT p4) p3)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p4 (NOT p3)), acceptance={1, 2} source=2 dest: 5}, { cond=(AND p2 (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 5}, { cond=(AND p2 p4 p3 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p4 p3), acceptance={1, 2} source=2 dest: 8}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={} source=2 dest: 9}], [{ cond=(OR (AND p2 p4 (NOT p0) (NOT p1)) (AND p2 (NOT p3) (NOT p0) (NOT p1))), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(OR (AND p2 p4 (NOT p0) p1) (AND p2 (NOT p3) (NOT p0) p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={2} source=3 dest: 6}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 2} source=3 dest: 6}, { cond=(AND p2 p4 p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={2} source=3 dest: 9}], [{ cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={0, 2} source=4 dest: 3}, { cond=(AND p4 (NOT p3) (NOT p0) p1), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={1} source=4 dest: 7}, { cond=(AND p4 p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={2} source=4 dest: 9}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={0, 1, 2} source=4 dest: 10}, { cond=(AND p4 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=4 dest: 11}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=4 dest: 11}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={1, 2} source=4 dest: 12}], [{ cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p4 (NOT p3)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND p4 p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p4 p3), acceptance={1, 2} source=5 dest: 8}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={0, 2} source=6 dest: 3}, { cond=(AND p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND p4 (NOT p3) (NOT p0) p1), acceptance={2} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 2} source=6 dest: 6}, { cond=(AND p4 p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={2} source=6 dest: 9}], [{ cond=(OR (AND p2 (NOT p4) (NOT p3) (NOT p0)) (AND (NOT p4) (NOT p0) p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 2} source=7 dest: 3}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(OR (AND p2 p4 (NOT p3) (NOT p0)) (AND p4 (NOT p0) p1)), acceptance={1} source=7 dest: 7}, { cond=(OR (AND (NOT p2) p4 (NOT p0) (NOT p1)) (AND p4 p3 (NOT p0) (NOT p1))), acceptance={1, 2} source=7 dest: 7}, { cond=(OR (AND (NOT p2) p4 (NOT p0) p1) (AND p4 p3 (NOT p0) p1)), acceptance={2} source=7 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 1, 2} source=7 dest: 10}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=7 dest: 11}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=7 dest: 11}, { cond=(OR (AND (NOT p2) p4 (NOT p0) p1) (AND p4 p3 (NOT p0) p1)), acceptance={1, 2} source=7 dest: 12}], [{ cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={} source=8 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4)) (AND (NOT p4) p3)), acceptance={0, 1, 2} source=8 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p2 p4 (NOT p3)), acceptance={1, 2} source=8 dest: 5}, { cond=(AND p2 (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=8 dest: 5}, { cond=(OR (AND (NOT p2) p4 (NOT p0) (NOT p1)) (AND p4 p3 (NOT p0) (NOT p1))), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p2) p4) (AND p4 p3)), acceptance={1, 2} source=8 dest: 8}, { cond=(OR (AND (NOT p2) p4 (NOT p0) p1) (AND p4 p3 (NOT p0) p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=9 dest: 1}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0} source=9 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=9 dest: 4}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 4}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={2} source=9 dest: 6}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 2} source=9 dest: 6}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1} source=9 dest: 7}, { cond=(OR (AND (NOT p2) p4 (NOT p0) (NOT p1)) (AND p4 p3 (NOT p0) (NOT p1))), acceptance={1, 2} source=9 dest: 7}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={} source=9 dest: 9}, { cond=(OR (AND (NOT p2) p4 (NOT p0) p1) (AND p4 p3 (NOT p0) p1)), acceptance={2} source=9 dest: 9}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=10 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 2} source=10 dest: 3}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=10 dest: 4}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=10 dest: 4}, { cond=(AND p2 p4 p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=10 dest: 7}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={2} source=10 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 1, 2} source=10 dest: 10}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=10 dest: 11}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=10 dest: 11}, { cond=(AND p2 p4 p3 (NOT p0) p1), acceptance={1, 2} source=10 dest: 12}], [{ cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=11 dest: 1}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={0, 2} source=11 dest: 3}, { cond=(AND p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=11 dest: 4}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=11 dest: 4}, { cond=(AND p4 p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=11 dest: 7}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={2} source=11 dest: 9}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={0, 1, 2} source=11 dest: 10}, { cond=(AND p4 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=11 dest: 11}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=11 dest: 11}, { cond=(AND p4 p3 (NOT p0) p1), acceptance={1, 2} source=11 dest: 12}], [{ cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=12 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 2} source=12 dest: 3}, { cond=(AND p2 p4 (NOT p3) (NOT p0) (NOT p1)), acceptance={1, 2} source=12 dest: 4}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=12 dest: 4}, { cond=(OR (AND (NOT p2) p4 (NOT p0) (NOT p1)) (AND p4 p3 (NOT p0) (NOT p1))), acceptance={1, 2} source=12 dest: 7}, { cond=(OR (AND (NOT p2) p4 (NOT p0) p1) (AND p4 p3 (NOT p0) p1)), acceptance={2} source=12 dest: 9}, { cond=(OR (AND (NOT p2) (NOT p4) (NOT p0) p1) (AND (NOT p4) p3 (NOT p0) p1)), acceptance={0, 1, 2} source=12 dest: 10}, { cond=(AND p2 p4 (NOT p3) (NOT p0) p1), acceptance={1, 2} source=12 dest: 11}, { cond=(AND p2 (NOT p4) (NOT p3) (NOT p0) p1), acceptance={0, 1, 2} source=12 dest: 11}, { cond=(OR (AND (NOT p2) p4 (NOT p0) p1) (AND p4 p3 (NOT p0) p1)), acceptance={1, 2} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s28 1)), p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(AND (GEQ s0 1) (GEQ s12 1)), p4:(AND (GEQ s1 1) (GEQ s14 1)), p3:(AND (GEQ s4 1) (GEQ...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3457 steps with 465 reset in 79 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-06 finished in 1494 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, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 60
Applied a total of 6 rules in 8 ms. Remains 30 /31 variables (removed 1) and now considering 60/66 (removed 6) transitions.
[2023-03-12 03:50:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:20] [INFO ] Invariant cache hit.
[2023-03-12 03:50:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 03:50:21] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:21] [INFO ] Invariant cache hit.
[2023-03-12 03:50:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:21] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-12 03:50:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 03:50:21] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:21] [INFO ] Invariant cache hit.
[2023-03-12 03:50:21] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 30/31 places, 60/66 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1040 reset in 227 ms.
Stack based approach found an accepted trace after 7642 steps with 87 reset with depth 118 and stack size 118 in 46 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-08 finished in 633 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||X(X(p1))) U (p2 U p3)))'
Support contains 8 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Applied a total of 4 rules in 18 ms. Remains 30 /31 variables (removed 1) and now considering 62/66 (removed 4) transitions.
[2023-03-12 03:50:21] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2023-03-12 03:50:21] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 03:50:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 03:50:21] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:21] [INFO ] Invariant cache hit.
[2023-03-12 03:50:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:21] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-12 03:50:21] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 03:50:21] [INFO ] Invariant cache hit.
[2023-03-12 03:50:21] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 30/31 places, 62/66 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s5 1) (GEQ s18 1)), p2:(AND (GEQ s0 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s7 1)), p1:(AND (GEQ s5 1) (GEQ s27 1) (NOT (AND (GEQ s0 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-10 finished in 658 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(!p1)&&(X(p2) U ((G(!p3)&&X(p2))||X(G(p2)))))) U p4))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-12 03:50:22] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 31 cols
[2023-03-12 03:50:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 03:50:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 03:50:22] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:22] [INFO ] Invariant cache hit.
[2023-03-12 03:50:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-12 03:50:22] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:22] [INFO ] Invariant cache hit.
[2023-03-12 03:50:22] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 31/31 places, 66/66 transitions.
Stuttering acceptance computed with spot in 678 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p3 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND p3 (NOT p2)), (AND p3 (NOT p2)), (NOT p2), (NOT p2), (AND p3 p2)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p4), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=p3, acceptance={} source=6 dest: 7}, { cond=(AND p3 p2), acceptance={0} source=6 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={1} source=8 dest: 6}, { cond=true, acceptance={} source=8 dest: 7}, { cond=(AND p3 p2), acceptance={0} source=8 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p3 p2), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p4:(AND (GEQ s3 1) (GEQ s13 1)), p3:(AND (GEQ s2 1) (GEQ s13 1)), p0:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s1 1) (GEQ s13 1)), p2:(AND (GEQ s1 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-12 finished in 909 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, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 60
Applied a total of 6 rules in 32 ms. Remains 30 /31 variables (removed 1) and now considering 60/66 (removed 6) transitions.
[2023-03-12 03:50:23] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 03:50:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 03:50:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 03:50:23] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:23] [INFO ] Invariant cache hit.
[2023-03-12 03:50:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-12 03:50:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:50:23] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:23] [INFO ] Invariant cache hit.
[2023-03-12 03:50:23] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 30/31 places, 60/66 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-13 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:(OR (LT s0 1) (LT s6 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]]
Product exploration explored 100000 steps with 15707 reset in 417 ms.
Product exploration explored 100000 steps with 15541 reset in 297 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-12 03:50:24] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:24] [INFO ] Invariant cache hit.
[2023-03-12 03:50:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 03:50:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 03:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 03:50:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 03:50:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 03:50:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 03:50:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 03:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 03:50:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-12 03:50:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-12 03:50:24] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 7 ms.
[2023-03-12 03:50:24] [INFO ] Added : 9 causal constraints over 2 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 03:50:24] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:24] [INFO ] Invariant cache hit.
[2023-03-12 03:50:24] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 03:50:24] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:24] [INFO ] Invariant cache hit.
[2023-03-12 03:50:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-12 03:50:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 03:50:24] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:24] [INFO ] Invariant cache hit.
[2023-03-12 03:50:25] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 30/30 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2023-03-12 03:50:25] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:25] [INFO ] Invariant cache hit.
[2023-03-12 03:50:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 03:50:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 03:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 03:50:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 03:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 03:50:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 03:50:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 03:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 03:50:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-12 03:50:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-12 03:50:25] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-12 03:50:25] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16006 reset in 131 ms.
Product exploration explored 100000 steps with 15843 reset in 109 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 03:50:25] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:25] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:26] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-12 03:50:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:26] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 30/30 places, 60/60 transitions.
Treatment of property FunctionPointer-PT-a016-LTLFireability-13 finished in 3029 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)&&X(X(X(G(p1)))))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 66/66 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 31 cols
[2023-03-12 03:50:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 03:50:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:26] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:50:26] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 31/31 places, 66/66 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s30 1) (GEQ s1 1) (GEQ s15 1)), p1:(OR (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s30 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 1 reset in 0 ms.
FORMULA FunctionPointer-PT-a016-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a016-LTLFireability-14 finished in 343 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, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 60
Applied a total of 6 rules in 12 ms. Remains 30 /31 variables (removed 1) and now considering 60/66 (removed 6) transitions.
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 03:50:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 03:50:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:26] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-12 03:50:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:50:26] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:26] [INFO ] Invariant cache hit.
[2023-03-12 03:50:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 30/31 places, 60/66 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1052 reset in 134 ms.
Product exploration explored 100000 steps with 1010 reset in 165 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 151 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 03:50:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:27] [INFO ] Invariant cache hit.
[2023-03-12 03:50:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 03:50:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:27] [INFO ] Invariant cache hit.
[2023-03-12 03:50:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:27] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-12 03:50:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 03:50:27] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:27] [INFO ] Invariant cache hit.
[2023-03-12 03:50:27] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 30/30 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1317 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=329 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1065 reset in 149 ms.
Product exploration explored 100000 steps with 1008 reset in 143 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 03:50:28] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:28] [INFO ] Invariant cache hit.
[2023-03-12 03:50:28] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 03:50:28] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:28] [INFO ] Invariant cache hit.
[2023-03-12 03:50:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:50:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-12 03:50:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 03:50:28] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 03:50:28] [INFO ] Invariant cache hit.
[2023-03-12 03:50:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 30/30 places, 60/60 transitions.
Treatment of property FunctionPointer-PT-a016-LTLFireability-15 finished in 1958 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)))'
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)))'
[2023-03-12 03:50:28] [INFO ] Flatten gal took : 11 ms
[2023-03-12 03:50:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 03:50:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 66 transitions and 264 arcs took 1 ms.
Total runtime 12128 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1097/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1097/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-a016-LTLFireability-13
Could not compute solution for formula : FunctionPointer-PT-a016-LTLFireability-15

BK_STOP 1678593029828

--------------------
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 FunctionPointer-PT-a016-LTLFireability-13
ltl formula formula --ltl=/tmp/1097/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 31 places, 66 transitions and 264 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1097/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1097/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1097/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
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/1097/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FunctionPointer-PT-a016-LTLFireability-15
ltl formula formula --ltl=/tmp/1097/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
pnml2lts-mc( 0/ 4): Petri net has 31 places, 66 transitions and 264 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1097/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1097/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1097/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1097/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="FunctionPointer-PT-a016"
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 FunctionPointer-PT-a016, 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-167838856200628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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