fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856413100331
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Kanban-PT-50000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2543.871 88946.00 140881.00 636.50 TFFTTTTFFFFFFFFT 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.r229-tall-167856413100331.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Kanban-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413100331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.7K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 11:58 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.4K 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.2K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 12:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:20 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-50000-LTLCardinality-00
FORMULA_NAME Kanban-PT-50000-LTLCardinality-01
FORMULA_NAME Kanban-PT-50000-LTLCardinality-02
FORMULA_NAME Kanban-PT-50000-LTLCardinality-03
FORMULA_NAME Kanban-PT-50000-LTLCardinality-04
FORMULA_NAME Kanban-PT-50000-LTLCardinality-05
FORMULA_NAME Kanban-PT-50000-LTLCardinality-06
FORMULA_NAME Kanban-PT-50000-LTLCardinality-07
FORMULA_NAME Kanban-PT-50000-LTLCardinality-08
FORMULA_NAME Kanban-PT-50000-LTLCardinality-09
FORMULA_NAME Kanban-PT-50000-LTLCardinality-10
FORMULA_NAME Kanban-PT-50000-LTLCardinality-11
FORMULA_NAME Kanban-PT-50000-LTLCardinality-12
FORMULA_NAME Kanban-PT-50000-LTLCardinality-13
FORMULA_NAME Kanban-PT-50000-LTLCardinality-14
FORMULA_NAME Kanban-PT-50000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679472922887

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-50000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 08:15:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 08:15:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:15:24] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 08:15:24] [INFO ] Transformed 16 places.
[2023-03-22 08:15:24] [INFO ] Transformed 16 transitions.
[2023-03-22 08:15:24] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 79 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-50000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-15 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.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 08:15:24] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-22 08:15:24] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-22 08:15:24] [INFO ] Invariant cache hit.
[2023-03-22 08:15:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-22 08:15:24] [INFO ] Invariant cache hit.
[2023-03-22 08:15:25] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 15 out of 16 places after structural reductions.
[2023-03-22 08:15:25] [INFO ] Flatten gal took : 14 ms
[2023-03-22 08:15:25] [INFO ] Flatten gal took : 4 ms
[2023-03-22 08:15:25] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=1612 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 08:15:25] [INFO ] Invariant cache hit.
[2023-03-22 08:15:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 08:15:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 08:15:25] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 08:15:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 08:15:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 08:15:25] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 08:15:25] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 08:15:25] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 3 properties in 16003 ms.
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 5 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 11
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 13 transition count 11
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 12 transition count 10
Applied a total of 5 rules in 16 ms. Remains 12 /16 variables (removed 4) and now considering 10/16 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 12/16 places, 10/16 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=3571 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 352974 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352974 steps, saw 219475 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-22 08:15:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 08:15:44] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 08:15:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 08:15:44] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 08:15:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 08:15:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 08:15:44] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 08:15:44] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 08:15:44] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 10000 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 9 transition count 9
Applied a total of 4 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 9/12 places, 9/10 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 930030 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 930030 steps, saw 415961 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9 rows 9 cols
[2023-03-22 08:15:57] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 08:15:57] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 08:15:57] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 08:15:57] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:15:57] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 08:15:57] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 204589 steps, including 0 resets, run visited all 2 properties in 1008 ms. (steps per millisecond=202 )
Parikh walk visited 2 properties in 1007 ms.
FORMULA Kanban-PT-50000-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(G(p0)))'
Support contains 2 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 1 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 08:15:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 08:15:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:15:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-22 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:15:59] [INFO ] Dead Transitions using invariants and state equation in 24 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 89 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5 s6)], 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 2 steps with 0 reset in 2 ms.
FORMULA Kanban-PT-50000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-01 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(!p0)))))'
Support contains 1 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 08:15:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 08:15:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:15:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-22 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:15:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, true, true, p0]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-02 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: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s10)], 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 1 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-02 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(F((p1||((p2 U p3) U !p2)))))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:15:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:15:59] [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 08:15:59] [INFO ] Invariant cache hit.
[2023-03-22 08:16:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(LEQ 3 s11), p2:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 103 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 p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), true, (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-50000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-03 finished in 648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 08:16:00] [INFO ] Invariant cache hit.
[2023-03-22 08:16:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 08:16:00] [INFO ] Invariant cache hit.
[2023-03-22 08:16:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 08:16:00] [INFO ] Invariant cache hit.
[2023-03-22 08:16:00] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LEQ s6 s11) (LEQ 1 s4))], 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 33333 reset in 131 ms.
Product exploration explored 100000 steps with 33333 reset in 92 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-50000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-04 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X((p1&&F(((p0&&X(F(p0)))||G(F(p0)))))))))))'
Support contains 2 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 08:16:01] [INFO ] Invariant cache hit.
[2023-03-22 08:16:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 08:16:01] [INFO ] Invariant cache hit.
[2023-03-22 08:16:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 08:16:01] [INFO ] Invariant cache hit.
[2023-03-22 08:16:01] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 822 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 16}, { cond=(AND p0 p1), acceptance={} source=0 dest: 17}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 16}, { cond=(AND p0 p1), acceptance={} source=2 dest: 17}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p0, acceptance={} source=4 dest: 8}, { cond=(NOT p0), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 16}, { cond=(AND p0 p1), acceptance={} source=7 dest: 17}], [{ cond=p0, acceptance={} source=8 dest: 12}, { cond=(NOT p0), acceptance={} source=8 dest: 13}], [{ cond=true, acceptance={} source=9 dest: 6}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=p0, acceptance={} source=11 dest: 4}, { cond=(NOT p0), acceptance={} source=11 dest: 5}], [{ cond=p0, acceptance={} source=12 dest: 14}, { cond=(NOT p0), acceptance={} source=12 dest: 15}], [{ cond=true, acceptance={} source=13 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 14}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=14 dest: 15}, { cond=(AND (NOT p0) p1), acceptance={0} source=14 dest: 16}, { cond=(AND p0 p1), acceptance={0} source=14 dest: 17}], [{ cond=(NOT p1), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 16}, { cond=(AND p0 p1), acceptance={} source=15 dest: 17}], [{ cond=(NOT p0), acceptance={0} source=16 dest: 16}, { cond=p0, acceptance={0} source=16 dest: 17}], [{ cond=(NOT p0), acceptance={0} source=17 dest: 17}]], initial=11, aps=[p1:(GT 2 s0), p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 86 ms.
Product exploration explored 100000 steps with 16666 reset in 112 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 p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 18 states, 34 edges and 2 AP (stutter sensitive) to 12 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=3846 ) properties (out of 6) seen :0
Finished Best-First random walk after 262 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=131 )
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 12 states, 25 edges and 2 AP (stutter sensitive) to 12 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 395 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 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 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 08:16:04] [INFO ] Invariant cache hit.
[2023-03-22 08:16:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 08:16:04] [INFO ] Invariant cache hit.
[2023-03-22 08:16:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 08:16:04] [INFO ] Invariant cache hit.
[2023-03-22 08:16:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 12 states, 25 edges and 2 AP (stutter sensitive) to 12 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 6) seen :0
Finished Best-First random walk after 245 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 12 states, 25 edges and 2 AP (stutter sensitive) to 12 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 461 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 427 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 16666 reset in 59 ms.
Product exploration explored 100000 steps with 16666 reset in 64 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, true, false, false, false]
Stuttering acceptance computed with spot in 407 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 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 7 edges and 14 vertex of which 4 / 14 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: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2023-03-22 08:16:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 08:16:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 08:16:06] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 08:16:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 13/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 12/14 places, 13/15 transitions.
Built C files in :
/tmp/ltsmin10781392246884335165
[2023-03-22 08:16:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10781392246884335165
Running compilation step : cd /tmp/ltsmin10781392246884335165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin10781392246884335165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10781392246884335165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17488857468289589077.hoa' '--buchi-type=spotba'
LTSmin run took 301 ms.
FORMULA Kanban-PT-50000-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-LTLCardinality-06 finished in 6519 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)&&F(G(p1)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 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.
Ensure Unique test removed 1 places
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 13375 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 08:16:20] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 08:16:20] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 08:16:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 08:16:21] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 08:16:21] [INFO ] Invariant cache hit.
[2023-03-22 08:16:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 08:16:21] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 08:16:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 08:16:21] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 08:16:21] [INFO ] Invariant cache hit.
[2023-03-22 08:16:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13455 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s6), p1:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-07 finished in 13574 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)||G(p1)||G(F(p2))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 6 edges and 16 vertex of which 4 / 16 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.
Ensure Unique test removed 1 places
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 12 transition count 13
Applied a total of 3 rules in 13021 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 08:16:34] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 08:16:34] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 08:16:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 08:16:34] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 08:16:34] [INFO ] Invariant cache hit.
[2023-03-22 08:16:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-22 08:16:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 08:16:34] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 08:16:34] [INFO ] Invariant cache hit.
[2023-03-22 08:16:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13116 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s4), p1:(LEQ s6 s1), p2:(GT s1 s8)], 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 72 steps with 6 reset in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-08 finished in 13258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&(G(p1)||(p1&&F(p2))))))))))'
Support contains 3 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 1 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 08:16:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 08:16:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 08:16:34] [INFO ] Invariant cache hit.
[2023-03-22 08:16:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 08:16:34] [INFO ] Invariant cache hit.
[2023-03-22 08:16:34] [INFO ] Dead Transitions using invariants and state equation in 21 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 76 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-10 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={0} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p1:(GT 3 s1), p0:(LEQ 1 s8), p2:(GT 3 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-10 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||(X(p1) U G(p2))))'
Support contains 3 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 08:16:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 08:16:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 08:16:34] [INFO ] Invariant cache hit.
[2023-03-22 08:16:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 08:16:34] [INFO ] Invariant cache hit.
[2023-03-22 08:16:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 673 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=true, acceptance={} source=2 dest: 8}, { cond=p2, acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}], [{ cond=(NOT p2), acceptance={} source=8 dest: 11}, { cond=true, acceptance={} source=8 dest: 12}, { cond=p2, acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 5}, { cond=(AND p2 p1), acceptance={} source=10 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=12 dest: 15}, { cond=(NOT p0), acceptance={} source=12 dest: 16}, { cond=(AND p2 (NOT p0)), acceptance={} source=12 dest: 17}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=13 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=14 dest: 18}], [{ cond=(NOT p1), acceptance={} source=15 dest: 6}], [{ cond=(NOT p2), acceptance={} source=16 dest: 15}, { cond=p2, acceptance={} source=16 dest: 16}, { cond=(NOT p2), acceptance={0} source=16 dest: 16}, { cond=p2, acceptance={} source=16 dest: 17}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=17 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=17 dest: 18}], [{ cond=(AND (NOT p2) p1), acceptance={} source=18 dest: 6}, { cond=(AND p2 p1), acceptance={} source=18 dest: 18}]], initial=0, aps=[p2:(LEQ 2 s6), p1:(GT 1 s0), p0:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-11 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(X(F(!p2)))))))'
Support contains 4 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 2 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 08:16:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 08:16:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 08:16:35] [INFO ] Invariant cache hit.
[2023-03-22 08:16:35] [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 08:16:35] [INFO ] Invariant cache hit.
[2023-03-22 08:16:35] [INFO ] Dead Transitions using invariants and state equation in 23 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 81 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p0), p2, true, p2]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LEQ 2 s4) (LEQ 2 s3)), p0:(GT 3 s1), p2:(LEQ 1 s8)], 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 0 reset in 104 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-12 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 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.
Ensure Unique test removed 1 places
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 12 transition count 13
Applied a total of 3 rules in 14505 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 08:16:50] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 08:16:50] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-22 08:16:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 08:16:50] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 08:16:50] [INFO ] Invariant cache hit.
[2023-03-22 08:16:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-22 08:16:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 08:16:50] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 08:16:50] [INFO ] Invariant cache hit.
[2023-03-22 08:16:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14609 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s11), p1:(AND (LEQ s11 s5) (LEQ s0 s1))], nbAcceptance=2, 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 6 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-13 finished in 14669 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&&F(p1))) U ((X((p0&&F(p1)))&&G(p0))||X(G((p0&&F(p1)))))))'
Support contains 3 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 08:16:50] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 08:16:50] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 08:16:50] [INFO ] Invariant cache hit.
[2023-03-22 08:16:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 08:16:50] [INFO ] Invariant cache hit.
[2023-03-22 08:16:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 2 s9), p1:(GT s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-14 finished in 262 ms.
All properties solved by simple procedures.
Total runtime 86592 ms.

BK_STOP 1679473011833

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-50000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Kanban-PT-50000, 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 r229-tall-167856413100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-50000.tgz
mv Kanban-PT-50000 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;