Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628200122.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r241-tall-171649628200122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:42 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 1716552908042

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=gold2023
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 202304061127
[2024-05-24 12:15:09] [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]
[2024-05-24 12:15:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:15:09] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2024-05-24 12:15:09] [INFO ] Transformed 16 places.
[2024-05-24 12:15:09] [INFO ] Transformed 16 transitions.
[2024-05-24 12:15:09] [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-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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
[2024-05-24 12:15:09] [INFO ] Computed 5 invariants in 5 ms
[2024-05-24 12:15:10] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-24 12:15:10] [INFO ] Invariant cache hit.
[2024-05-24 12:15:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-24 12:15:10] [INFO ] Invariant cache hit.
[2024-05-24 12:15:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2024-05-24 12:15:10] [INFO ] Flatten gal took : 13 ms
[2024-05-24 12:15:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 12:15:10] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=1785 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-24 12:15:10] [INFO ] Invariant cache hit.
[2024-05-24 12:15:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:15:10] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:15:10] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-24 12:15:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:15:10] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 12:15:10] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-24 12:15:10] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 12:15:10] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 5 properties in 24005 ms.
Support contains 7 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 3 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 15 transition count 13
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 14 transition count 13
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 13 transition count 12
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 13 transition count 12
Applied a total of 5 rules in 21 ms. Remains 13 /16 variables (removed 3) and now considering 12/16 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 13/16 places, 12/16 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=2272 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 266561 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266561 steps, saw 189870 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 12 rows 13 cols
[2024-05-24 12:15:37] [INFO ] Computed 5 invariants in 2 ms
[2024-05-24 12:15:38] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:15:38] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 12:15:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 12:15:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:15:38] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:15:38] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 12:15:38] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 12:15:38] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 14000 ms.
Support contains 7 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 13/13 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-24 12:15:52] [INFO ] Invariant cache hit.
[2024-05-24 12:15:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:15:52] [INFO ] Invariant cache hit.
[2024-05-24 12:15:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 12:15:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:15:52] [INFO ] Invariant cache hit.
[2024-05-24 12:15:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-24 12:15:52] [INFO ] Invariant cache hit.
[2024-05-24 12:15:52] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:15:52] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:15:52] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 12:15:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:15:52] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 12:15:52] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 12:15:52] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 12:15:52] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(X(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
[2024-05-24 12:15:52] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:15:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 12:15:52] [INFO ] Invariant cache hit.
[2024-05-24 12:15:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-24 12:15:52] [INFO ] Invariant cache hit.
[2024-05-24 12:15:52] [INFO ] Dead Transitions using invariants and state equation in 32 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 101 ms. Remains : 15/16 places, 16/16 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GT 3 s5), p1:(GT 1 s2), p0:(LEQ 1 s10)], nbAcceptance=0, 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 164 ms.
Product exploration explored 100000 steps with 50000 reset in 96 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-50000-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-00 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))&&G(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
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2024-05-24 12:15:53] [INFO ] Invariant cache hit.
[2024-05-24 12:15:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 12:15:53] [INFO ] Invariant cache hit.
[2024-05-24 12:15:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 12:15:53] [INFO ] Invariant cache hit.
[2024-05-24 12:15:53] [INFO ] Dead Transitions using invariants and state equation in 39 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 87 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
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=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(LEQ s5 s6), p0:(AND (LEQ 3 s5) (LEQ 3 s8))], 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, null, null][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-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-01 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&G(F(p1)))))))'
Support contains 3 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 11 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 10 transition count 11
Applied a total of 3 rules in 18339 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2024-05-24 12:16:11] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2024-05-24 12:16:11] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:16:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 12:16:12] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-24 12:16:12] [INFO ] Invariant cache hit.
[2024-05-24 12:16:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 12:16:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:16:12] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-24 12:16:12] [INFO ] Invariant cache hit.
[2024-05-24 12:16:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18445 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s1 s5), p0:(GT 2 s7)], 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 0 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 18589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 5 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 7 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 18096 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2024-05-24 12:16:30] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2024-05-24 12:16:30] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:16:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 12:16:30] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-24 12:16:30] [INFO ] Invariant cache hit.
[2024-05-24 12:16:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:16:30] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-24 12:16:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:16:30] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-24 12:16:30] [INFO ] Invariant cache hit.
[2024-05-24 12:16:30] [INFO ] Dead Transitions using invariants and state equation in 30 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 18195 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-03 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 3 s7) (LEQ 1 s4)), p1:(AND (LEQ s0 s9) (GT 2 s6))], 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 7 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-03 finished in 18326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(G(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
[2024-05-24 12:16:30] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:16:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:16:30] [INFO ] Invariant cache hit.
[2024-05-24 12:16:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-24 12:16:30] [INFO ] Invariant cache hit.
[2024-05-24 12:16:30] [INFO ] Dead Transitions using invariants and state equation in 25 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 81 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LEQ 3 s13) (LEQ 3 s1)), p1:(GT 3 s10)], 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]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-04 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(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
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
[2024-05-24 12:16:30] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:16:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 12:16:30] [INFO ] Invariant cache hit.
[2024-05-24 12:16:30] [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.
[2024-05-24 12:16:30] [INFO ] Invariant cache hit.
[2024-05-24 12:16:30] [INFO ] Dead Transitions using invariants and state equation in 22 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 123 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-05 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:(LEQ 2 s3), p0:(GT s0 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 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-05 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((p0&&X(p1)))||G(p2))))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 15 cols
[2024-05-24 12:16:31] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 12:16:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 12:16:31] [INFO ] Invariant cache hit.
[2024-05-24 12:16:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 12:16:31] [INFO ] Invariant cache hit.
[2024-05-24 12:16:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(LEQ 3 s12), p0:(LEQ s13 s0), p1:(LEQ s7 s5)], nbAcceptance=1, 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 20000 reset in 164 ms.
Product exploration explored 100000 steps with 20000 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 p2 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=5555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 12:16:32] [INFO ] Invariant cache hit.
[2024-05-24 12:16:32] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:16:32] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:16:32] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 12:16:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:16:32] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 12:16:32] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 12:16:32] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 12:16:32] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 14000 ms.
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Graph (trivial) has 6 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 13 transition count 10
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 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 9
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 11 transition count 9
Applied a total of 5 rules in 4 ms. Remains 11 /15 variables (removed 4) and now considering 9/15 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 11/15 places, 9/15 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 415853 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 415853 steps, saw 150100 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 9 rows 11 cols
[2024-05-24 12:16:49] [INFO ] Computed 5 invariants in 2 ms
[2024-05-24 12:16:49] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 12:16:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:16:49] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:16:49] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 12:16:49] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 12:16:49] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 4 properties in 14000 ms.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 11/11 places, 9/9 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=7143 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 997730 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 997730 steps, saw 348844 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 12:17:06] [INFO ] Invariant cache hit.
[2024-05-24 12:17:06] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:17:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:17:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:17:06] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:17:06] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 12:17:06] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 4725 ms.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 11/11 places, 9/9 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3705425 steps, run timeout after 3001 ms. (steps per millisecond=1234 ) properties seen :{}
Probabilistic random walk after 3705425 steps, saw 1223047 distinct states, run finished after 3001 ms. (steps per millisecond=1234 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:17:14] [INFO ] Invariant cache hit.
[2024-05-24 12:17:14] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:17:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 12:17:14] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:17:14] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:17:14] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 12:17:14] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 150006 steps, including 0 resets, run visited all 1 properties in 105 ms. (steps per millisecond=1428 )
Parikh walk visited 1 properties in 104 ms.
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2024-05-24 12:17:15] [INFO ] Computed 5 invariants in 2 ms
[2024-05-24 12:17:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 12:17:15] [INFO ] Invariant cache hit.
[2024-05-24 12:17:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 12:17:15] [INFO ] Invariant cache hit.
[2024-05-24 12:17:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 15/15 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 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 12:17:16] [INFO ] Invariant cache hit.
[2024-05-24 12:17:16] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:17:16] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 12:17:16] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 12:17:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 12:17:16] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 12:17:16] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 12:17:16] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 12:17:16] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 249703 steps, including 0 resets, run visited all 2 properties in 1122 ms. (steps per millisecond=222 )
Parikh walk visited 7 properties in 11121 ms.
Knowledge obtained : [(AND p0 p2 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 20000 reset in 79 ms.
Product exploration explored 100000 steps with 20000 reset in 69 ms.
Built C files in :
/tmp/ltsmin11365835695131849886
[2024-05-24 12:17:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11365835695131849886
Running compilation step : cd /tmp/ltsmin11365835695131849886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 142 ms.
Running link step : cd /tmp/ltsmin11365835695131849886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11365835695131849886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2981346472722279471.hoa' '--buchi-type=spotba'
LTSmin run took 63 ms.
FORMULA Kanban-PT-50000-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-LTLCardinality-06 finished in 57555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
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.
// Phase 1: matrix 15 rows 14 cols
[2024-05-24 12:17:28] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 12:17:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:17:28] [INFO ] Invariant cache hit.
[2024-05-24 12:17:28] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:17:28] [INFO ] Invariant cache hit.
[2024-05-24 12:17:28] [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 70 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 2 s4), p1:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-08 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(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.
[2024-05-24 12:17:28] [INFO ] Invariant cache hit.
[2024-05-24 12:17:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:17:28] [INFO ] Invariant cache hit.
[2024-05-24 12:17:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 12:17:28] [INFO ] Invariant cache hit.
[2024-05-24 12:17:28] [INFO ] Dead Transitions using invariants and state equation in 25 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 79 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-09 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:(LEQ s6 s13)], 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 57 ms.
Product exploration explored 100000 steps with 33333 reset in 52 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 (Minato strategy)
Knowledge based reduction with 2 factoid took 15 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-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-09 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(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 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2024-05-24 12:17:29] [INFO ] Invariant cache hit.
[2024-05-24 12:17:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:17:29] [INFO ] Invariant cache hit.
[2024-05-24 12:17:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 12:17:29] [INFO ] Invariant cache hit.
[2024-05-24 12:17:29] [INFO ] Dead Transitions using invariants and state equation in 24 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 70 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s12), p0:(LEQ s4 s11)], nbAcceptance=0, 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 117 ms.
Product exploration explored 100000 steps with 50000 reset in 136 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), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-50000-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-10 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G((p1||F(p2)))))))'
Support contains 6 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 1 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 18813 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2024-05-24 12:17:48] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2024-05-24 12:17:48] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 12:17:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:17:48] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-24 12:17:48] [INFO ] Invariant cache hit.
[2024-05-24 12:17:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 12:17:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:17:48] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2024-05-24 12:17:48] [INFO ] Invariant cache hit.
[2024-05-24 12:17:48] [INFO ] Dead Transitions using invariants and state equation in 17 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 18882 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ s11 s10) (LEQ s4 s9)), p1:(GT s0 s5), p2:(GT s4 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 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 19058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(!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 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2024-05-24 12:17:48] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 12:17:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 12:17:48] [INFO ] Invariant cache hit.
[2024-05-24 12:17:48] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 12:17:48] [INFO ] Invariant cache hit.
[2024-05-24 12:17:48] [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 66 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT s5 s7), p1:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-13 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((!p0 U p1) U p2))||F(p3))))'
Support contains 5 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
[2024-05-24 12:17:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 12:17:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:17:49] [INFO ] Invariant cache hit.
[2024-05-24 12:17:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:17:49] [INFO ] Invariant cache hit.
[2024-05-24 12:17:49] [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 72 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 3 s3), p3:(OR (GT 2 s2) (LEQ s5 s4)), p1:(LEQ 2 s0), p0:(GT 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 75 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 p2) p3 p1 p0), (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-50000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-15 finished in 451 ms.
All properties solved by simple procedures.
Total runtime 160042 ms.

BK_STOP 1716553070865

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r241-tall-171649628200122"
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 ;