About the Execution of LTSMin+red for Kanban-PT-00500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 509.720 | 19569.00 | 30399.00 | 358.30 | TTFFF?FFF?FFTFFF | 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.r233-tall-167856418700283.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 Kanban-PT-00500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418700283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 12:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00500-LTLCardinality-00
FORMULA_NAME Kanban-PT-00500-LTLCardinality-01
FORMULA_NAME Kanban-PT-00500-LTLCardinality-02
FORMULA_NAME Kanban-PT-00500-LTLCardinality-03
FORMULA_NAME Kanban-PT-00500-LTLCardinality-04
FORMULA_NAME Kanban-PT-00500-LTLCardinality-05
FORMULA_NAME Kanban-PT-00500-LTLCardinality-06
FORMULA_NAME Kanban-PT-00500-LTLCardinality-07
FORMULA_NAME Kanban-PT-00500-LTLCardinality-08
FORMULA_NAME Kanban-PT-00500-LTLCardinality-09
FORMULA_NAME Kanban-PT-00500-LTLCardinality-10
FORMULA_NAME Kanban-PT-00500-LTLCardinality-11
FORMULA_NAME Kanban-PT-00500-LTLCardinality-12
FORMULA_NAME Kanban-PT-00500-LTLCardinality-13
FORMULA_NAME Kanban-PT-00500-LTLCardinality-14
FORMULA_NAME Kanban-PT-00500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679486653447
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=Kanban-PT-00500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 12:04:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 12:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:04:15] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-22 12:04:15] [INFO ] Transformed 16 places.
[2023-03-22 12:04:15] [INFO ] Transformed 16 transitions.
[2023-03-22 12:04:15] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 80 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.
FORMULA Kanban-PT-00500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 13 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 12:04:15] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-22 12:04:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 12:04:15] [INFO ] Invariant cache hit.
[2023-03-22 12:04:15] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-22 12:04:15] [INFO ] Invariant cache hit.
[2023-03-22 12:04:15] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 15/16 places, 16/16 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-22 12:04:15] [INFO ] Flatten gal took : 14 ms
[2023-03-22 12:04:15] [INFO ] Flatten gal took : 4 ms
[2023-03-22 12:04:15] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 12:04:16] [INFO ] Invariant cache hit.
[2023-03-22 12:04:16] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 12:04:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 12:04:16] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 12:04:16] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 12:04:16] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 183 ms.
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 10 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 4 transition count 3
Applied a total of 13 rules in 29 ms. Remains 4 /15 variables (removed 11) and now considering 3/16 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 4/15 places, 3/16 transitions.
Finished random walk after 1003 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=334 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 12:04:16] [INFO ] Invariant cache hit.
[2023-03-22 12:04:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-22 12:04:16] [INFO ] Invariant cache hit.
[2023-03-22 12:04:16] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-22 12:04:16] [INFO ] Invariant cache hit.
[2023-03-22 12:04:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1 s3), p1:(LEQ s8 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-00500-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-00500-LTLCardinality-00 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X((!p0 U (p1||G(!p0))))) U p2))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 7 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 16 ms. Remains 12 /15 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2023-03-22 12:04:17] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 12:04:17] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:04:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 12:04:17] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:17] [INFO ] Invariant cache hit.
[2023-03-22 12:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 12:04:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 12:04:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:17] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:17] [INFO ] Invariant cache hit.
[2023-03-22 12:04:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/15 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 12/15 places, 13/16 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), true, (AND p0 (NOT p1))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 2 s4), p0:(AND (LEQ s0 s7) (LEQ 3 s0)), p1:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 826 steps with 13 reset in 9 ms.
FORMULA Kanban-PT-00500-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-02 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 5 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2023-03-22 12:04:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2023-03-22 12:04:17] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:04:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 12:04:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 12:04:17] [INFO ] Invariant cache hit.
[2023-03-22 12:04:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 12:04:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:17] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 12:04:17] [INFO ] Invariant cache hit.
[2023-03-22 12:04:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-04 finished in 165 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((G(p0)||X(X(X(F(p1)))))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 3 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 12:04:17] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-22 12:04:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 12:04:17] [INFO ] Invariant cache hit.
[2023-03-22 12:04:18] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-22 12:04:18] [INFO ] Invariant cache hit.
[2023-03-22 12:04:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(LEQ s11 s9), p1:(LEQ s12 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20013 reset in 155 ms.
Product exploration explored 100000 steps with 20040 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 12:04:19] [INFO ] Invariant cache hit.
[2023-03-22 12:04:19] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:04:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:04:19] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:04:19] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 12:04:19] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3452 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=431 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 12:04:19] [INFO ] Invariant cache hit.
[2023-03-22 12:04:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 12:04:19] [INFO ] Invariant cache hit.
[2023-03-22 12:04:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-22 12:04:19] [INFO ] Invariant cache hit.
[2023-03-22 12:04:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 14/14 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 12:04:20] [INFO ] Invariant cache hit.
[2023-03-22 12:04:20] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:04:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:04:20] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:04:20] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 12:04:20] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3458 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=576 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20013 reset in 70 ms.
Product exploration explored 100000 steps with 19944 reset in 194 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 9 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2023-03-22 12:04:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:22] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 12:04:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/14 places, 12/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 11/14 places, 12/15 transitions.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 12:04:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:04:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 12:04:22] [INFO ] Invariant cache hit.
[2023-03-22 12:04:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 12:04:22] [INFO ] Invariant cache hit.
[2023-03-22 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 14/14 places, 15/15 transitions.
Treatment of property Kanban-PT-00500-LTLCardinality-05 finished in 4441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 12 edges and 15 vertex of which 6 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 5 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2023-03-22 12:04:22] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2023-03-22 12:04:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:04:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 12:04:22] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 12:04:22] [INFO ] Invariant cache hit.
[2023-03-22 12:04:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 12:04:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-22 12:04:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 12:04:22] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 12:04:22] [INFO ] Invariant cache hit.
[2023-03-22 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00500-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-06 finished in 145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (p1||G(p0)))&&(F(p2)||X(p3))))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 12:04:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:04:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 12:04:22] [INFO ] Invariant cache hit.
[2023-03-22 12:04:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 12:04:22] [INFO ] Invariant cache hit.
[2023-03-22 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GT 1 s7) (GT s3 s2)), p0:(GT s3 s2), p2:(LEQ s12 s3), p3:(LEQ 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 523 reset in 120 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Kanban-PT-00500-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-07 finished in 490 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((X(p0)||G(!p1))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 12:04:23] [INFO ] Invariant cache hit.
[2023-03-22 12:04:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 12:04:23] [INFO ] Invariant cache hit.
[2023-03-22 12:04:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-22 12:04:23] [INFO ] Invariant cache hit.
[2023-03-22 12:04:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s5), p0:(LEQ 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2533 reset in 105 ms.
Stack based approach found an accepted trace after 32 steps with 1 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Kanban-PT-00500-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-08 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 6 ms. Remains 12 /15 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2023-03-22 12:04:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 12:04:23] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:04:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 12:04:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:23] [INFO ] Invariant cache hit.
[2023-03-22 12:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 12:04:23] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 12:04:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:23] [INFO ] Invariant cache hit.
[2023-03-22 12:04:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/15 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 12/15 places, 13/16 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s4), p1:(LEQ s1 s3)], 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 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 50923 steps, run visited all 2 properties in 274 ms. (steps per millisecond=185 )
Probabilistic random walk after 50923 steps, saw 32619 distinct states, run finished after 275 ms. (steps per millisecond=185 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 273 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 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 12:04:24] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:24] [INFO ] Invariant cache hit.
[2023-03-22 12:04:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 12:04:24] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:24] [INFO ] Invariant cache hit.
[2023-03-22 12:04:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 12:04:24] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-22 12:04:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:24] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:24] [INFO ] Invariant cache hit.
[2023-03-22 12:04:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 12/12 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2004 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 50923 steps, run visited all 2 properties in 242 ms. (steps per millisecond=210 )
Probabilistic random walk after 50923 steps, saw 32619 distinct states, run finished after 242 ms. (steps per millisecond=210 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 224 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 12:04:26] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 12:04:26] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 12:04:26] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-22 12:04:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:26] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 12/12 places, 13/13 transitions.
Treatment of property Kanban-PT-00500-LTLCardinality-09 finished in 3139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 8 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2023-03-22 12:04:26] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2023-03-22 12:04:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:04:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 12:04:26] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 12:04:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:26] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s6) (LEQ 3 s1)), p1:(GT 2 s8)], 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 22 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-10 finished in 196 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(p1)&&F(p2))||G(p1))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 12:04:26] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-22 12:04:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 12:04:26] [INFO ] Invariant cache hit.
[2023-03-22 12:04:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s12 s2), p1:(GT s12 s1), p2:(AND (LEQ 2 s13) (LEQ s12 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 870 reset in 123 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Kanban-PT-00500-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-11 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-13 finished in 244 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))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT s4 s1), p0:(LEQ s9 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00500-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-14 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1))))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 12:04:27] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 12:04:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 12:04:27] [INFO ] Invariant cache hit.
[2023-03-22 12:04:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GT s7 s3), p0:(LEQ s1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 351 steps with 57 reset in 1 ms.
FORMULA Kanban-PT-00500-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00500-LTLCardinality-15 finished in 434 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((G(p0)||X(X(X(F(p1)))))))'
Found a Shortening insensitive property : Kanban-PT-00500-LTLCardinality-05
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 11 transition count 12
Applied a total of 3 rules in 9 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-22 12:04:28] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 12:04:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 12:04:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 12:04:28] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:28] [INFO ] Invariant cache hit.
[2023-03-22 12:04:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 12:04:28] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:28] [INFO ] Invariant cache hit.
[2023-03-22 12:04:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/15 places, 12/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 106 ms. Remains : 11/15 places, 12/16 transitions.
Running random walk in product with property : Kanban-PT-00500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(LEQ s8 s7), p1:(LEQ s9 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19994 reset in 55 ms.
Product exploration explored 100000 steps with 19982 reset in 79 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2505 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 12:04:28] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:28] [INFO ] Invariant cache hit.
[2023-03-22 12:04:29] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:04:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:04:29] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:04:29] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 12:04:29] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 10 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 4 transition count 3
Applied a total of 11 rules in 9 ms. Remains 4 /11 variables (removed 7) and now considering 3/12 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 4/11 places, 3/12 transitions.
Finished random walk after 6014 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3007 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-22 12:04:29] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:29] [INFO ] Invariant cache hit.
[2023-03-22 12:04:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 12:04:29] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:29] [INFO ] Invariant cache hit.
[2023-03-22 12:04:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 12:04:29] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:29] [INFO ] Invariant cache hit.
[2023-03-22 12:04:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 11/11 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10022 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5011 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 12:04:30] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:30] [INFO ] Invariant cache hit.
[2023-03-22 12:04:30] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:04:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 12:04:30] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:04:30] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 12:04:30] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 12/12 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 10 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 4 transition count 3
Applied a total of 11 rules in 5 ms. Remains 4 /11 variables (removed 7) and now considering 3/12 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 4/11 places, 3/12 transitions.
Finished random walk after 2506 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1253 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19995 reset in 67 ms.
Product exploration explored 100000 steps with 19952 reset in 76 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-22 12:04:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 12:04:31] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:31] [INFO ] Invariant cache hit.
[2023-03-22 12:04:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 11/11 places, 12/12 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-22 12:04:31] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:31] [INFO ] Invariant cache hit.
[2023-03-22 12:04:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 12:04:31] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:31] [INFO ] Invariant cache hit.
[2023-03-22 12:04:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 12:04:31] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 12:04:31] [INFO ] Invariant cache hit.
[2023-03-22 12:04:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property Kanban-PT-00500-LTLCardinality-05 finished in 3732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2023-03-22 12:04:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 12:04:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 12:04:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 16 transitions and 38 arcs took 0 ms.
Total runtime 16789 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1659/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1659/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Kanban-PT-00500-LTLCardinality-05
Could not compute solution for formula : Kanban-PT-00500-LTLCardinality-09
BK_STOP 1679486673016
--------------------
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 Kanban-PT-00500-LTLCardinality-05
ltl formula formula --ltl=/tmp/1659/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 15 places, 16 transitions and 38 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1659/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1659/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
free(): double free detected in tcache 2
ltl formula name Kanban-PT-00500-LTLCardinality-09
ltl formula formula --ltl=/tmp/1659/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 15 places, 16 transitions and 38 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
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1659/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
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="Kanban-PT-00500"
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 Kanban-PT-00500, 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 r233-tall-167856418700283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00500.tgz
mv Kanban-PT-00500 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 ;