About the Execution of LTSMin+red for FunctionPointer-PT-a032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 457.464 | 16504.00 | 25331.00 | 539.80 | TTFTFTTFFFFF??FT | normal |
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-167838856200635.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-a032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856200635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K 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-a032-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-a032-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678596475918
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 04:47:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 04:47:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 04:47:57] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-12 04:47:57] [INFO ] Transformed 40 places.
[2023-03-12 04:47:57] [INFO ] Transformed 70 transitions.
[2023-03-12 04:47:57] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-a032-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a032-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a032-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a032-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a032-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 10 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-12 04:47:57] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2023-03-12 04:47:57] [INFO ] Computed 4 place invariants in 10 ms
[2023-03-12 04:47:58] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-12 04:47:58] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:47:58] [INFO ] Invariant cache hit.
[2023-03-12 04:47:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:47:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-12 04:47:58] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:47:58] [INFO ] Invariant cache hit.
[2023-03-12 04:47:58] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 26 out of 34 places after structural reductions.
[2023-03-12 04:47:58] [INFO ] Flatten gal took : 23 ms
[2023-03-12 04:47:58] [INFO ] Flatten gal took : 10 ms
[2023-03-12 04:47:58] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10008 steps, including 20 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 04:47:59] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:47:59] [INFO ] Invariant cache hit.
[2023-03-12 04:47:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 04:47:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 04:47:59] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA FunctionPointer-PT-a032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
FORMULA FunctionPointer-PT-a032-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 5 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
[2023-03-12 04:47:59] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 31 cols
[2023-03-12 04:47:59] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 04:47:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 04:47:59] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:47:59] [INFO ] Invariant cache hit.
[2023-03-12 04:47:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:47:59] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-12 04:47:59] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:47:59] [INFO ] Invariant cache hit.
[2023-03-12 04:47:59] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/34 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 31/34 places, 62/66 transitions.
Stuttering acceptance computed with spot in 192 ms :[p0, p0, true]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s6 s10) (LEQ 1 s14))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 142 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a032-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a032-LTLCardinality-00 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 6 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
[2023-03-12 04:48:00] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2023-03-12 04:48:00] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 04:48:00] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 04:48:00] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:00] [INFO ] Invariant cache hit.
[2023-03-12 04:48:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-12 04:48:00] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:00] [INFO ] Invariant cache hit.
[2023-03-12 04:48:00] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 30/34 places, 62/66 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Detected a total of 3/30 stabilizing places and 8/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a032-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a032-LTLCardinality-03 finished in 646 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)||(G((p1||G(p2))) U (p2 U G(p3)))))'
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Applied a total of 2 rules in 1 ms. Remains 32 /34 variables (removed 2) and now considering 66/66 (removed 0) transitions.
[2023-03-12 04:48:01] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 32 cols
[2023-03-12 04:48:01] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 04:48:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 04:48:01] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:48:01] [INFO ] Invariant cache hit.
[2023-03-12 04:48:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-12 04:48:01] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:48:01] [INFO ] Invariant cache hit.
[2023-03-12 04:48:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 66/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 32/34 places, 66/66 transitions.
Stuttering acceptance computed with spot in 679 ms :[(AND (NOT p0) (NOT p3)), (NOT p0), (AND p3 (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p2) p1 (NOT p0)), (AND (NOT p3) (NOT p0)), false, true, (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p1)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p2) p1), false, false]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 7}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 12}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p3 p2 p1 (NOT p0)), acceptance={} source=6 dest: 13}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 14}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 7}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=11 dest: 9}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=11 dest: 11}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=11 dest: 11}, { cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 12}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=12 dest: 7}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=12 dest: 10}, { cond=(AND p2 p1), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=13 dest: 9}, { cond=(AND p3 p2 p1), acceptance={} source=13 dest: 13}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p3) p2), acceptance={} source=14 dest: 8}, { cond=(AND p3 p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p3:(LEQ 2 s16), p2:(GT 3 s30), p1:(GT s23 s24), p0:(LEQ s18 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 149 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) p0), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND p3 p2 p1 (NOT p0)))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X p2)), (X (X (OR (AND (NOT p3) p2) (AND (NOT p3) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), true, (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (NOT (OR (AND p3 p2) (AND p3 p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p3 (NOT p0))))
Knowledge based reduction with 35 factoid took 566 ms. Reduced automaton from 15 states, 49 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a032-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a032-LTLCardinality-06 finished in 1696 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||G(!p1))))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 5 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 7 place count 30 transition count 60
Applied a total of 7 rules in 17 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
[2023-03-12 04:48:02] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 04:48:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 04:48:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 04:48:02] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:02] [INFO ] Invariant cache hit.
[2023-03-12 04:48:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-12 04:48:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 04:48:02] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:02] [INFO ] Invariant cache hit.
[2023-03-12 04:48:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/34 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 30/34 places, 60/66 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GT 2 s7), p0:(LEQ s8 0)], 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, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 102 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-a032-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a032-LTLCardinality-07 finished in 274 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(p0))&&F(p1))))'
Support contains 2 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 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
[2023-03-12 04:48:03] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 31 cols
[2023-03-12 04:48:03] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 04:48:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 04:48:03] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:48:03] [INFO ] Invariant cache hit.
[2023-03-12 04:48:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-12 04:48:03] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:48:03] [INFO ] Invariant cache hit.
[2023-03-12 04:48:03] [INFO ] Dead Transitions using invariants and state equation in 40 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 138 ms. Remains : 31/34 places, 66/66 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s15), p1:(GT 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 207 steps with 6 reset in 2 ms.
FORMULA FunctionPointer-PT-a032-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a032-LTLCardinality-11 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p1)||G(p0)))))'
Support contains 4 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 5 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
[2023-03-12 04:48:03] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2023-03-12 04:48:03] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 04:48:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 04:48:03] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:03] [INFO ] Invariant cache hit.
[2023-03-12 04:48:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-12 04:48:03] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:03] [INFO ] Invariant cache hit.
[2023-03-12 04:48:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/34 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 30/34 places, 62/66 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-12 automaton TGBA Formula[mat=[[{ 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=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s27 s7), p1:(GT s18 s25)], 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 2501 reset in 178 ms.
Product exploration explored 100000 steps with 2573 reset in 187 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 : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 332 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 399 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-12 04:48:05] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:05] [INFO ] Invariant cache hit.
[2023-03-12 04:48:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 04:48:05] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:05] [INFO ] Invariant cache hit.
[2023-03-12 04:48:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:05] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-12 04:48:05] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:05] [INFO ] Invariant cache hit.
[2023-03-12 04:48:05] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 30/30 places, 62/62 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 : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 352 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2572 reset in 156 ms.
Product exploration explored 100000 steps with 2503 reset in 269 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 62/62 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 60
Applied a total of 2 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 60/62 (removed 2) transitions.
[2023-03-12 04:48:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 04:48:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 04:48:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 60/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 30/30 places, 60/62 transitions.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
// Phase 1: matrix 44 rows 30 cols
[2023-03-12 04:48:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 04:48:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:07] [INFO ] Invariant cache hit.
[2023-03-12 04:48:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:07] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 44 transitions (discarded 18 similar events)
[2023-03-12 04:48:07] [INFO ] Invariant cache hit.
[2023-03-12 04:48:07] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 30/30 places, 62/62 transitions.
Treatment of property FunctionPointer-PT-a032-LTLCardinality-12 finished in 3973 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 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 5 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 7 place count 30 transition count 60
Applied a total of 7 rules in 11 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-12 04:48:07] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 04:48:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:07] [INFO ] Invariant cache hit.
[2023-03-12 04:48:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:07] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-12 04:48:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 04:48:07] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:07] [INFO ] Invariant cache hit.
[2023-03-12 04:48:07] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/34 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 30/34 places, 60/66 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-13 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:(LEQ s3 s13), p0:(OR (LEQ s3 s13) (LEQ 3 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3099 reset in 131 ms.
Product exploration explored 100000 steps with 3083 reset in 135 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 : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10007 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 04:48:08] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:08] [INFO ] Invariant cache hit.
[2023-03-12 04:48:08] [INFO ] After 20ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 3 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 6 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 04:48:08] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:08] [INFO ] Invariant cache hit.
[2023-03-12 04:48:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 04:48:08] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:08] [INFO ] Invariant cache hit.
[2023-03-12 04:48:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:08] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-12 04:48:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 04:48:08] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:08] [INFO ] Invariant cache hit.
[2023-03-12 04:48:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 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 123 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3088 reset in 124 ms.
Product exploration explored 100000 steps with 3061 reset in 140 ms.
Support contains 3 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 4 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 04:48:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:09] [INFO ] Invariant cache hit.
[2023-03-12 04:48:09] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-12 04:48:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:09] [INFO ] Invariant cache hit.
[2023-03-12 04:48:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-12 04:48:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 04:48:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:09] [INFO ] Invariant cache hit.
[2023-03-12 04:48:10] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 30/30 places, 60/60 transitions.
Treatment of property FunctionPointer-PT-a032-LTLCardinality-13 finished in 2634 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))))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 5 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 7 place count 30 transition count 60
Applied a total of 7 rules in 10 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
[2023-03-12 04:48:10] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:10] [INFO ] Invariant cache hit.
[2023-03-12 04:48:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 04:48:10] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:10] [INFO ] Invariant cache hit.
[2023-03-12 04:48:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-12 04:48:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 04:48:10] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-12 04:48:10] [INFO ] Invariant cache hit.
[2023-03-12 04:48:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/34 places, 60/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 30/34 places, 60/66 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 : FunctionPointer-PT-a032-LTLCardinality-14 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:(LEQ s7 0), p0:(GT 2 s10)], 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 412 steps with 10 reset in 1 ms.
FORMULA FunctionPointer-PT-a032-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-a032-LTLCardinality-14 finished in 236 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))||(G(p1) U p2)))'
Support contains 4 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 2 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
[2023-03-12 04:48:10] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 31 cols
[2023-03-12 04:48:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 04:48:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 04:48:10] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:48:10] [INFO ] Invariant cache hit.
[2023-03-12 04:48:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 04:48:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-12 04:48:10] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 04:48:10] [INFO ] Invariant cache hit.
[2023-03-12 04:48:10] [INFO ] Dead Transitions using invariants and state equation in 38 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 128 ms. Remains : 31/34 places, 66/66 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-a032-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s11), p0:(LEQ s25 s26), p2:(LEQ 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 104 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 : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 198 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-a032-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-a032-LTLCardinality-15 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p1)||G(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' '!(G(F((G(p1)||p0))))'
[2023-03-12 04:48:11] [INFO ] Flatten gal took : 12 ms
[2023-03-12 04:48:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 04:48:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 66 transitions and 268 arcs took 1 ms.
Total runtime 13804 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1207/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1207/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-a032-LTLCardinality-12
Could not compute solution for formula : FunctionPointer-PT-a032-LTLCardinality-13
BK_STOP 1678596492422
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-a032-LTLCardinality-12
ltl formula formula --ltl=/tmp/1207/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 34 places, 66 transitions and 268 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name FunctionPointer-PT-a032-LTLCardinality-13
ltl formula formula --ltl=/tmp/1207/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 34 places, 66 transitions and 268 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1207/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1207/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1207/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1207/ltl_1_
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
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-a032"
export BK_EXAMINATION="LTLCardinality"
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-a032, examination is LTLCardinality"
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-167838856200635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a032.tgz
mv FunctionPointer-PT-a032 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;