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-167856413100315.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-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413100315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-10000-LTLCardinality-00
FORMULA_NAME Kanban-PT-10000-LTLCardinality-01
FORMULA_NAME Kanban-PT-10000-LTLCardinality-02
FORMULA_NAME Kanban-PT-10000-LTLCardinality-03
FORMULA_NAME Kanban-PT-10000-LTLCardinality-04
FORMULA_NAME Kanban-PT-10000-LTLCardinality-05
FORMULA_NAME Kanban-PT-10000-LTLCardinality-06
FORMULA_NAME Kanban-PT-10000-LTLCardinality-07
FORMULA_NAME Kanban-PT-10000-LTLCardinality-08
FORMULA_NAME Kanban-PT-10000-LTLCardinality-09
FORMULA_NAME Kanban-PT-10000-LTLCardinality-10
FORMULA_NAME Kanban-PT-10000-LTLCardinality-11
FORMULA_NAME Kanban-PT-10000-LTLCardinality-12
FORMULA_NAME Kanban-PT-10000-LTLCardinality-13
FORMULA_NAME Kanban-PT-10000-LTLCardinality-14
FORMULA_NAME Kanban-PT-10000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679469370631

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-10000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 07:16:12] [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 07:16:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:16:12] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-22 07:16:12] [INFO ] Transformed 16 places.
[2023-03-22 07:16:12] [INFO ] Transformed 16 transitions.
[2023-03-22 07:16:12] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Kanban-PT-10000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLCardinality-10 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 07:16:12] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-22 07:16:12] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-22 07:16:12] [INFO ] Invariant cache hit.
[2023-03-22 07:16:12] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-22 07:16:12] [INFO ] Invariant cache hit.
[2023-03-22 07:16:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 15 out of 16 places after structural reductions.
[2023-03-22 07:16:12] [INFO ] Flatten gal took : 13 ms
[2023-03-22 07:16:12] [INFO ] Flatten gal took : 3 ms
[2023-03-22 07:16:12] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 31) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 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 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 07:16:12] [INFO ] Invariant cache hit.
[2023-03-22 07:16:12] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 07:16:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 07:16:13] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 07:16:13] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 07:16:13] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 07:16:13] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 61232 steps, including 0 resets, run visited all 2 properties in 262 ms. (steps per millisecond=233 )
Parikh walk visited 12 properties in 8659 ms.
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' '!(F(G(p0)))'
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 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 3 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Applied a total of 3 rules in 8 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 07:16:22] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 07:16:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 07:16:22] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 07:16:22] [INFO ] Invariant cache hit.
[2023-03-22 07:16:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:16:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-22 07:16:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:16:22] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 07:16:22] [INFO ] Invariant cache hit.
[2023-03-22 07:16:22] [INFO ] Dead Transitions using invariants and state equation in 23 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 94 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 3 s4) (LEQ s3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 3 ms.
FORMULA Kanban-PT-10000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-00 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((G(p1) U (p2 U p0)))))))'
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
[2023-03-22 07:16:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 07:16:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 07:16:22] [INFO ] Invariant cache hit.
[2023-03-22 07:16:22] [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 07:16:22] [INFO ] Invariant cache hit.
[2023-03-22 07:16:22] [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 293 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-01 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=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s9 s5), p2:(LEQ 2 s14), p1:(LEQ s2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 186 ms.
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 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 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:16:23] [INFO ] Invariant cache hit.
[2023-03-22 07:16:23] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:16:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 07:16:23] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:16:23] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 07:16:23] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 118507 steps, including 0 resets, run visited all 1 properties in 122 ms. (steps per millisecond=971 )
Parikh walk visited 3 properties in 1072 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 07:16:25] [INFO ] Invariant cache hit.
[2023-03-22 07:16:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 07:16:25] [INFO ] Invariant cache hit.
[2023-03-22 07:16:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 07:16:25] [INFO ] Invariant cache hit.
[2023-03-22 07:16:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 15/15 places, 16/16 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 p1 (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) 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 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:16:26] [INFO ] Invariant cache hit.
[2023-03-22 07:16:26] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:16:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:26] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:16:26] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 07:16:26] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 240393 steps, including 1 resets, run visited all 3 properties in 922 ms. (steps per millisecond=260 )
Parikh walk visited 3 properties in 921 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 254 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 59 ms.
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 7 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 4 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2023-03-22 07:16:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:16:28] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2023-03-22 07:16:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/15 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 13/15 places, 14/16 transitions.
Built C files in :
/tmp/ltsmin15066562294636490160
[2023-03-22 07:16:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15066562294636490160
Running compilation step : cd /tmp/ltsmin15066562294636490160;'/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 162 ms.
Running link step : cd /tmp/ltsmin15066562294636490160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15066562294636490160;'/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/stateBased13261701573782591773.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA Kanban-PT-10000-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-10000-LTLCardinality-01 finished in 6700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 734 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 07:16:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 07:16:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 07:16:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 07:16:29] [INFO ] Invariant cache hit.
[2023-03-22 07:16:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:16:29] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-22 07:16:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:16:29] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 07:16:29] [INFO ] Invariant cache hit.
[2023-03-22 07:16:29] [INFO ] Dead Transitions using invariants and state equation in 25 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 833 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-03 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!(p0 U p1))||X(p0)||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 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 07:16:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 07:16:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 07:16:30] [INFO ] Invariant cache hit.
[2023-03-22 07:16:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 07:16:30] [INFO ] Invariant cache hit.
[2023-03-22 07:16:30] [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 93 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 s8), p0:(LEQ 1 s3), p1:(LEQ s10 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 188 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), (X (AND p2 p0)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (OR (AND p2 p0) (AND p2 p1))), (X (X (AND p2 p0))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND p2 p0) (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 642 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 291250 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291250 steps, saw 222637 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 07:16:34] [INFO ] Invariant cache hit.
[2023-03-22 07:16:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:34] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 07:16:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:34] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 07:16:34] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 07:16:34] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 129802 steps, including 0 resets, run visited all 4 properties in 900 ms. (steps per millisecond=144 )
Parikh walk visited 6 properties in 2900 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (OR (AND p2 p0) (AND p2 p1))), (X (X (AND p2 p0))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (AND p2 p0) (AND p2 p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2 p1)), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 13 factoid took 694 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 07:16:38] [INFO ] Invariant cache hit.
[2023-03-22 07:16:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 07:16:38] [INFO ] Invariant cache hit.
[2023-03-22 07:16:38] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 07:16:38] [INFO ] Invariant cache hit.
[2023-03-22 07:16:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 15/15 places, 16/16 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), (X (OR (AND p0 p2) (AND p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 545 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 295168 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295168 steps, saw 225550 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 07:16:42] [INFO ] Invariant cache hit.
[2023-03-22 07:16:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:42] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 07:16:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:42] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 07:16:42] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 07:16:42] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 119694 steps, including 0 resets, run visited all 4 properties in 891 ms. (steps per millisecond=134 )
Parikh walk visited 6 properties in 2891 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (OR (AND p0 p2) (AND p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 13 factoid took 627 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 120 ms.
Built C files in :
/tmp/ltsmin10213482326003626551
[2023-03-22 07:16:46] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10213482326003626551
Running compilation step : cd /tmp/ltsmin10213482326003626551;'/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 83 ms.
Running link step : cd /tmp/ltsmin10213482326003626551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10213482326003626551;'/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/stateBased11023411896740591942.hoa' '--buchi-type=spotba'
LTSmin run took 3485 ms.
FORMULA Kanban-PT-10000-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-10000-LTLCardinality-04 finished in 20375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 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 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 716 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 07:16:51] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 07:16:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 07:16:51] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 07:16:51] [INFO ] Invariant cache hit.
[2023-03-22 07:16:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 07:16:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:16:51] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 07:16:51] [INFO ] Invariant cache hit.
[2023-03-22 07:16:51] [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 809 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-05 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: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LEQ s2 s10) (LEQ s11 s0)), p0:(OR (AND (OR (LEQ s2 s10) (LEQ 3 s6)) (LEQ 3 s6)) (LEQ s11 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 130 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 (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 653 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:16:52] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 07:16:52] [INFO ] Invariant cache hit.
[2023-03-22 07:16:52] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-22 07:16:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:52] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 07:16:52] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 07:16:52] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 987 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 13/13 transitions.
Graph (trivial) has 8 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 11 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 6 transition count 5
Applied a total of 10 rules in 1 ms. Remains 6 /12 variables (removed 6) and now considering 5/13 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 6/12 places, 5/13 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=10001 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1063684 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1063684 steps, saw 556331 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-22 07:16:56] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 07:16:56] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:16:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 07:16:56] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:16:56] [INFO ] After 10ms 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 07:16:56] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 30001 steps, including 0 resets, run visited all 2 properties in 122 ms. (steps per millisecond=245 )
Parikh walk visited 2 properties in 121 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 15 factoid took 338 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-10000-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-10000-LTLCardinality-05 finished in 6653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 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 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 713 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 07:16:57] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 07:16:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 07:16:57] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 07:16:57] [INFO ] Invariant cache hit.
[2023-03-22 07:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:16:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 07:16:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:16:57] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 07:16:57] [INFO ] Invariant cache hit.
[2023-03-22 07:16:57] [INFO ] Dead Transitions using invariants and state equation in 29 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 797 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s4), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 435 steps with 0 reset in 5 ms.
FORMULA Kanban-PT-10000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-06 finished in 890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U (p2||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
[2023-03-22 07:16:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 07:16:57] [INFO ] Invariant cache hit.
[2023-03-22 07:16:57] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 07:16:57] [INFO ] Invariant cache hit.
[2023-03-22 07:16:57] [INFO ] Dead Transitions using invariants and state equation in 26 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 82 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GT 3 s1) (GT 2 s12)), p1:(GT 3 s1), p0:(AND (GT 1 s5) (GT 3 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 244 steps with 0 reset in 2 ms.
FORMULA Kanban-PT-10000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-07 finished in 252 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&&G(F(p1))) U X(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 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 07:16:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Dead Transitions using invariants and state equation in 22 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 76 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s10 s0), p2:(LEQ 3 s9), p1:(OR (GT s10 s0) (GT 2 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4526 steps with 43 reset in 6 ms.
FORMULA Kanban-PT-10000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-08 finished in 284 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 U p1))&&F((!p1||G(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
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 0 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Dead Transitions using invariants and state equation in 20 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 62 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2)), true]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s9 s4), p0:(LEQ s7 s4), p2:(GT 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3280 reset in 127 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 81 in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-09 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||X(p1))&&(p2||X(p3)))))'
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 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 07:16:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Dead Transitions using invariants and state equation in 19 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 61 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s11), p2:(LEQ 2 s12), p1:(GT 2 s3), p3:(LEQ 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-11 finished in 208 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 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.
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 07:16:58] [INFO ] Invariant cache hit.
[2023-03-22 07:16:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-22 07:16:59] [INFO ] Invariant cache hit.
[2023-03-22 07:16:59] [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 68 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-12 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 s11 s5)], 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 76 ms.
Product exploration explored 100000 steps with 33333 reset in 58 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 50 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-10000-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-10000-LTLCardinality-12 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 07:16:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 07:16:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 07:16:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 07:16:59] [INFO ] Invariant cache hit.
[2023-03-22 07:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:16:59] [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 07:16:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:16:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 07:16:59] [INFO ] Invariant cache hit.
[2023-03-22 07:16:59] [INFO ] Dead Transitions using invariants and state equation in 20 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 82 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 5 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-13 finished in 126 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) U p1)&&X(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
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 07:16:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:16:59] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 07:16:59] [INFO ] Invariant cache hit.
[2023-03-22 07:16:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 07:16:59] [INFO ] Invariant cache hit.
[2023-03-22 07:16:59] [INFO ] Dead Transitions using invariants and state equation in 32 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 78 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s5), p0:(LEQ s9 s2), p2:(GT s9 s7)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-14 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 1 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 1 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 703 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2023-03-22 07:17:00] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2023-03-22 07:17:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:17:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 07:17:00] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-22 07:17:00] [INFO ] Invariant cache hit.
[2023-03-22 07:17:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-22 07:17:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:17:00] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-22 07:17:00] [INFO ] Invariant cache hit.
[2023-03-22 07:17:00] [INFO ] Dead Transitions using invariants and state equation in 22 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 775 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLCardinality-15 finished in 845 ms.
All properties solved by simple procedures.
Total runtime 48389 ms.

BK_STOP 1679469421543

--------------------
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-10000"
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-10000, 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-167856413100315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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