Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407100556.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-05000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407100556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 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-05000-00
FORMULA_NAME Kanban-PT-05000-01
FORMULA_NAME Kanban-PT-05000-02
FORMULA_NAME Kanban-PT-05000-03
FORMULA_NAME Kanban-PT-05000-04
FORMULA_NAME Kanban-PT-05000-05
FORMULA_NAME Kanban-PT-05000-06
FORMULA_NAME Kanban-PT-05000-07
FORMULA_NAME Kanban-PT-05000-08
FORMULA_NAME Kanban-PT-05000-09
FORMULA_NAME Kanban-PT-05000-10
FORMULA_NAME Kanban-PT-05000-11
FORMULA_NAME Kanban-PT-05000-12
FORMULA_NAME Kanban-PT-05000-13
FORMULA_NAME Kanban-PT-05000-14
FORMULA_NAME Kanban-PT-05000-15

=== Now, execution of the tool begins

BK_START 1620867981126

Running Version 0
[2021-05-13 01:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 01:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 01:06:22] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-13 01:06:22] [INFO ] Transformed 16 places.
[2021-05-13 01:06:22] [INFO ] Transformed 16 transitions.
[2021-05-13 01:06:22] [INFO ] Parsed PT model containing 16 places and 16 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 01:06:22] [INFO ] Initial state test concluded for 3 properties.
FORMULA Kanban-PT-05000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:06:22] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-13 01:06:22] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:06:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 01:06:22] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:06:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 01:06:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-13 01:06:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 01:06:23] [INFO ] Flatten gal took : 18 ms
FORMULA Kanban-PT-05000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 01:06:23] [INFO ] Flatten gal took : 4 ms
[2021-05-13 01:06:23] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100022 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=2326 ) properties (out of 27) seen :19
Running SMT prover for 8 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:06:23] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 01:06:23] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 01:06:23] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 01:06:23] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-13 01:06:23] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 01:06:23] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 01:06:23] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 01:06:23] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 01:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:06:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 01:06:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 01:06:23] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:06:23] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:06:23] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:06:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:06:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:06:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:06:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-05000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} 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:(OR (LEQ 1 s8) (LEQ 2 s8)), p1:(OR (LEQ 2 s8) (AND (LEQ s13 s0) (GT 1 s8)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Product exploration explored 100000 steps with 0 reset in 284 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 3 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 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.
Applied a total of 1 rules in 7 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 01:06:25] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 01:06:25] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 01:06:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:06:25] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
[2021-05-13 01:06:25] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:06:25] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:06:25] [INFO ] Time to serialize gal into /tmp/LTL947126141295401576.gal : 1 ms
[2021-05-13 01:06:25] [INFO ] Time to serialize properties into /tmp/LTL14843615833086748413.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL947126141295401576.gal, -t, CGAL, -LTL, /tmp/LTL14843615833086748413.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL947126141295401576.gal -t CGAL -LTL /tmp/LTL14843615833086748413.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((P1>=2)||((Pback2<=P3)&&(P1<1)))")))&&("((P1>=1)||(P1>=2))")))))
Formula 0 simplified : !XX("((P1>=1)||(P1>=2))" & GF"((P1>=2)||((Pback2<=P3)&&(P1<1)))")
Detected timeout of ITS tools.
[2021-05-13 01:06:40] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:06:40] [INFO ] Applying decomposition
[2021-05-13 01:06:40] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8199724212675735072.txt, -o, /tmp/graph8199724212675735072.bin, -w, /tmp/graph8199724212675735072.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8199724212675735072.bin, -l, -1, -v, -w, /tmp/graph8199724212675735072.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 01:06:40] [INFO ] Decomposing Gal with order
[2021-05-13 01:06:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 01:06:40] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 01:06:40] [INFO ] Flatten gal took : 56 ms
[2021-05-13 01:06:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 01:06:40] [INFO ] Time to serialize gal into /tmp/LTL11801005775183559306.gal : 1 ms
[2021-05-13 01:06:40] [INFO ] Time to serialize properties into /tmp/LTL15287283155683364199.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11801005775183559306.gal, -t, CGAL, -LTL, /tmp/LTL15287283155683364199.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11801005775183559306.gal -t CGAL -LTL /tmp/LTL15287283155683364199.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((gi1.gi1.gu4.P1>=2)||((gu0.Pback2<=gu0.P3)&&(gi1.gi1.gu4.P1<1)))")))&&("((gi1.gi1.gu4.P1>=1)||(gi1.gi1.gu4.P1>=2))")))))
Formula 0 simplified : !XX("((gi1.gi1.gu4.P1>=1)||(gi1.gi1.gu4.P1>=2))" & GF"((gi1.gi1.gu4.P1>=2)||((gu0.Pback2<=gu0.P3)&&(gi1.gi1.gu4.P1<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7635828540623661806
[2021-05-13 01:06:55] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7635828540623661806
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7635828540623661806]
Compilation finished in 176 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7635828540623661806]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(([](<>((LTLAPp0==true)))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7635828540623661806]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-05000-00 finished in 47174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&(p1||(X(G(p2))&&F(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:07:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 01:07:10] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 01:07:10] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 01:07:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 01:07:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 01:07:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p3), true]
Running random walk in product with property : Kanban-PT-05000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s11), p3:(LEQ s12 s7), p0:(LEQ 2 s2), p2:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Kanban-PT-05000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-02 finished in 368 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p0))&&G((p1&&X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:07:11] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:07:11] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:11] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:11] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 01:07:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-05000-03 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(GT s11 s12), p0:(LEQ s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 171 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 8 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 01:07:12] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:07:12] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 01:07:12] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:07:12] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 1 reset in 132 ms.
[2021-05-13 01:07:12] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:07:12] [INFO ] Flatten gal took : 1 ms
[2021-05-13 01:07:12] [INFO ] Time to serialize gal into /tmp/LTL16261813670270595640.gal : 0 ms
[2021-05-13 01:07:12] [INFO ] Time to serialize properties into /tmp/LTL10578472514901740769.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16261813670270595640.gal, -t, CGAL, -LTL, /tmp/LTL10578472514901740769.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16261813670270595640.gal -t CGAL -LTL /tmp/LTL10578472514901740769.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(Pm1<=Pout3)")U(X("(Pm1<=Pout3)")))&&(G(("(P2>Pout2)")&&(X(X("(P2>Pout2)")))))))
Formula 0 simplified : !(("(Pm1<=Pout3)" U X"(Pm1<=Pout3)") & G("(P2>Pout2)" & XX"(P2>Pout2)"))
Detected timeout of ITS tools.
[2021-05-13 01:07:27] [INFO ] Flatten gal took : 1 ms
[2021-05-13 01:07:27] [INFO ] Applying decomposition
[2021-05-13 01:07:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2648949049741526231.txt, -o, /tmp/graph2648949049741526231.bin, -w, /tmp/graph2648949049741526231.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2648949049741526231.bin, -l, -1, -v, -w, /tmp/graph2648949049741526231.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 01:07:27] [INFO ] Decomposing Gal with order
[2021-05-13 01:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 01:07:27] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 01:07:27] [INFO ] Time to serialize gal into /tmp/LTL17206765880301131722.gal : 0 ms
[2021-05-13 01:07:27] [INFO ] Time to serialize properties into /tmp/LTL9362689422487530594.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17206765880301131722.gal, -t, CGAL, -LTL, /tmp/LTL9362689422487530594.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17206765880301131722.gal -t CGAL -LTL /tmp/LTL9362689422487530594.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(gu1.Pm1<=gu1.Pout3)")U(X("(gu1.Pm1<=gu1.Pout3)")))&&(G(("(gu5.P2>gu5.Pout2)")&&(X(X("(gu5.P2>gu5.Pout2)")))))))
Formula 0 simplified : !(("(gu1.Pm1<=gu1.Pout3)" U X"(gu1.Pm1<=gu1.Pout3)") & G("(gu5.P2>gu5.Pout2)" & XX"(gu5.P2>gu5.Pout2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15225617527489296087
[2021-05-13 01:07:42] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15225617527489296087
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15225617527489296087]
Compilation finished in 111 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15225617527489296087]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true) U X((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(X((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15225617527489296087]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-05000-03 finished in 46422 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:07:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:07:57] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 01:07:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:57] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 01:07:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:07:57] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Kanban-PT-05000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s12), p1:(LEQ s0 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23739 reset in 108 ms.
Stack based approach found an accepted trace after 119 steps with 26 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Kanban-PT-05000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-04 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:07:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Kanban-PT-05000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s5 s10), p0:(LEQ s14 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-05000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-05 finished in 170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Kanban-PT-05000-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s6 s1), p1:(LEQ 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 3 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-05000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-06 finished in 142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((p0&&F(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Kanban-PT-05000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s1 s4), p1:(LEQ 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Kanban-PT-05000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-07 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:07:58] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 1108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-05000-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT s10 s4) (LEQ 1 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 56 ms.
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 55 ms.
Product exploration explored 100000 steps with 33333 reset in 62 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-13 01:08:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:08:00] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 01:08:00] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-13 01:08:00] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/14 places, 13/15 transitions.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 95 ms.
[2021-05-13 01:08:00] [INFO ] Flatten gal took : 1 ms
[2021-05-13 01:08:00] [INFO ] Flatten gal took : 1 ms
[2021-05-13 01:08:00] [INFO ] Time to serialize gal into /tmp/LTL12962990503886484842.gal : 0 ms
[2021-05-13 01:08:00] [INFO ] Time to serialize properties into /tmp/LTL13322558287191081093.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12962990503886484842.gal, -t, CGAL, -LTL, /tmp/LTL13322558287191081093.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12962990503886484842.gal -t CGAL -LTL /tmp/LTL13322558287191081093.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((Pm2>Pm4)||(P1>=1))")))))
Formula 0 simplified : !XXF"((Pm2>Pm4)||(P1>=1))"
Detected timeout of ITS tools.
[2021-05-13 01:08:15] [INFO ] Flatten gal took : 1 ms
[2021-05-13 01:08:15] [INFO ] Applying decomposition
[2021-05-13 01:08:15] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8707790950990546369.txt, -o, /tmp/graph8707790950990546369.bin, -w, /tmp/graph8707790950990546369.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8707790950990546369.bin, -l, -1, -v, -w, /tmp/graph8707790950990546369.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 01:08:15] [INFO ] Decomposing Gal with order
[2021-05-13 01:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 01:08:15] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 01:08:15] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2021-05-13 01:08:15] [INFO ] Time to serialize gal into /tmp/LTL15615792865987681919.gal : 0 ms
[2021-05-13 01:08:15] [INFO ] Time to serialize properties into /tmp/LTL2403662976684974996.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15615792865987681919.gal, -t, CGAL, -LTL, /tmp/LTL2403662976684974996.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15615792865987681919.gal -t CGAL -LTL /tmp/LTL2403662976684974996.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((gu2.Pm2>gu2.Pm4)||(gi1.gu4.P1>=1))")))))
Formula 0 simplified : !XXF"((gu2.Pm2>gu2.Pm4)||(gi1.gu4.P1>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5200676112656626624
[2021-05-13 01:08:30] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5200676112656626624
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5200676112656626624]
Compilation finished in 111 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5200676112656626624]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5200676112656626624]
LTSmin run took 144 ms.
FORMULA Kanban-PT-05000-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-05000-09 finished in 32200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1&&(G(p2) U p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:08:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:30] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:08:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:08:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:30] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p2)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : Kanban-PT-05000-11 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p3 p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=5, aps=[p2:(GT s4 s6), p1:(LEQ 1 s1), p3:(LEQ 3 s9), p0:(AND (LEQ s4 s6) (LEQ 3 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-05000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-11 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G((p1||X(F((p2&&X(G((p2||G(p3))))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 01:08:31] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:08:31] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:08:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:31] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:08:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:31] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : Kanban-PT-05000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1, 2} source=2 dest: 2}, { cond=p2, acceptance={0, 1, 2} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=4 dest: 6}, { cond=(AND p1 p0 p2), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(OR p2 p3), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1, 2} source=6 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p0 p2) (AND (NOT p1) p0 p3)), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={1} source=6 dest: 6}, { cond=(OR (AND p1 (NOT p0) p2) (AND p1 (NOT p0) p3)), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0, 2} source=6 dest: 10}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={2} source=6 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={} source=7 dest: 5}, { cond=(OR (AND p1 p2) (AND p1 p3)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=7 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 5}, { cond=(AND p1 p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=9 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0, 1, 2} source=9 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p2 p3), acceptance={0, 2} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=10 dest: 4}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1, 2} source=10 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0, 1, 2} source=10 dest: 6}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0, 2} source=10 dest: 10}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={2} source=10 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0, 2} source=10 dest: 13}, { cond=(AND p1 p0 p2 p3), acceptance={2} source=10 dest: 13}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=10 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=11 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=11 dest: 12}, { cond=(AND p1 p2 p3), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=12 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=12 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0, 2} source=12 dest: 9}, { cond=(AND p2 p3), acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=13 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=13 dest: 4}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1, 2} source=13 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0, 1} source=13 dest: 6}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={1} source=13 dest: 6}, { cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=13 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=13 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0, 2} source=13 dest: 10}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={2} source=13 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=13 dest: 13}, { cond=(AND p1 p0 p2 p3), acceptance={} source=13 dest: 13}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=14 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=14 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=14 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=14 dest: 12}, { cond=(AND p1 p2 p3), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(GT 3 s1), p1:(LEQ s1 s6), p2:(GT 2 s0), p3:(GT s2 s11)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 396 steps with 0 reset with depth 397 and stack size 362 in 1 ms.
FORMULA Kanban-PT-05000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-14 finished in 651 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 12 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 13
Applied a total of 5 rules in 3 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 12 cols
[2021-05-13 01:08:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:31] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 13 rows 12 cols
[2021-05-13 01:08:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:08:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-13 01:08:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 12 cols
[2021-05-13 01:08:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:08:31] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-05000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s6 s2) (LEQ 2 s5)), p2:(AND (LEQ 1 s0) (GT 2 s4)), p1:(GT 2 s4)], 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 7 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-05000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-15 finished in 121 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17789611105265966199
[2021-05-13 01:08:31] [INFO ] Applying decomposition
[2021-05-13 01:08:31] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14050217802720198365.txt, -o, /tmp/graph14050217802720198365.bin, -w, /tmp/graph14050217802720198365.weights], workingDir=null]
[2021-05-13 01:08:31] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2021-05-13 01:08:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 01:08:31] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2021-05-13 01:08:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14050217802720198365.bin, -l, -1, -v, -w, /tmp/graph14050217802720198365.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 01:08:31] [INFO ] Decomposing Gal with order
[2021-05-13 01:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 01:08:31] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2021-05-13 01:08:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 01:08:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17789611105265966199
[2021-05-13 01:08:31] [INFO ] Flatten gal took : 2 ms
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17789611105265966199]
[2021-05-13 01:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 01:08:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality18330540690453422815.gal : 0 ms
[2021-05-13 01:08:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality3451108147372763373.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality18330540690453422815.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3451108147372763373.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality18330540690453422815.gal -t CGAL -LTL /tmp/LTLCardinality3451108147372763373.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(X(("((gu4.P1>=1)||(gu4.P1>=2))")&&(G(F("((gu4.P1>=2)||((gu0.Pback2<=gu0.P3)&&(gu4.P1<1)))")))))))
Formula 0 simplified : !XX("((gu4.P1>=1)||(gu4.P1>=2))" & GF"((gu4.P1>=2)||((gu0.Pback2<=gu0.P3)&&(gu4.P1<1)))")
Compilation finished in 150 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17789611105265966199]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&[](<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17789611105265966199]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: X(X(((LTLAPp0==true)&&[](<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: "X(X(((LTLAPp0==true)&&[](<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.063: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.065: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.065: State length is 17, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.065: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.065: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.065: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.065: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.212: ~1 levels ~960 states ~5328 transitions
pins2lts-mc-linux64( 6/ 8), 0.220: ~1 levels ~1920 states ~12496 transitions
pins2lts-mc-linux64( 6/ 8), 0.223: ~1 levels ~3840 states ~26080 transitions
pins2lts-mc-linux64( 6/ 8), 0.225: ~1 levels ~7680 states ~54688 transitions
pins2lts-mc-linux64( 5/ 8), 0.233: ~1 levels ~15360 states ~107400 transitions
pins2lts-mc-linux64( 6/ 8), 0.249: ~1 levels ~30720 states ~231248 transitions
pins2lts-mc-linux64( 1/ 8), 0.280: ~1 levels ~61440 states ~468400 transitions
pins2lts-mc-linux64( 5/ 8), 0.351: ~1 levels ~122880 states ~1007376 transitions
pins2lts-mc-linux64( 4/ 8), 0.503: ~1 levels ~245760 states ~2014736 transitions
pins2lts-mc-linux64( 1/ 8), 0.859: ~1 levels ~491520 states ~4281088 transitions
pins2lts-mc-linux64( 0/ 8), 1.497: ~1 levels ~983040 states ~8425008 transitions
pins2lts-mc-linux64( 0/ 8), 2.812: ~1 levels ~1966080 states ~17283824 transitions
pins2lts-mc-linux64( 2/ 8), 5.718: ~1 levels ~3932160 states ~37995344 transitions
pins2lts-mc-linux64( 6/ 8), 11.571: ~1 levels ~7864320 states ~78446944 transitions
pins2lts-mc-linux64( 5/ 8), 24.657: ~1 levels ~15728640 states ~167724408 transitions
pins2lts-mc-linux64( 6/ 8), 55.099: ~1 levels ~31457280 states ~330658760 transitions
pins2lts-mc-linux64( 0/ 8), 113.872: ~1 levels ~62914560 states ~635818240 transitions
pins2lts-mc-linux64( 5/ 8), 240.808: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 240.842:
pins2lts-mc-linux64( 0/ 8), 240.843: mean standard work distribution: 2.1% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 240.843:
pins2lts-mc-linux64( 0/ 8), 240.843: Explored 114858781 states 1265891187 transitions, fanout: 11.021
pins2lts-mc-linux64( 0/ 8), 240.843: Total exploration time 240.750 sec (240.710 sec minimum, 240.731 sec on average)
pins2lts-mc-linux64( 0/ 8), 240.843: States per second: 477087, Transitions per second: 5258115
pins2lts-mc-linux64( 0/ 8), 240.843:
pins2lts-mc-linux64( 0/ 8), 240.843: Progress states detected: 134217264
pins2lts-mc-linux64( 0/ 8), 240.843: Redundant explorations: -14.4233
pins2lts-mc-linux64( 0/ 8), 240.843:
pins2lts-mc-linux64( 0/ 8), 240.843: Queue width: 8B, total height: 39449234, memory: 300.97MB
pins2lts-mc-linux64( 0/ 8), 240.843: Tree memory: 1065.6MB, 8.3 B/state, compr.: 11.9%
pins2lts-mc-linux64( 0/ 8), 240.843: Tree fill ratio (roots/leafs): 99.0%/16.0%
pins2lts-mc-linux64( 0/ 8), 240.843: Stored 17 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 240.843: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 240.843: Est. total memory use: 1366.6MB (~1325.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&[](<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17789611105265966199]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&[](<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17789611105265966199]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 01:29:16] [INFO ] Flatten gal took : 64 ms
[2021-05-13 01:29:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality4356914985712344015.gal : 15 ms
[2021-05-13 01:29:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality3111427466524986815.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality4356914985712344015.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3111427466524986815.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality4356914985712344015.gal -t CGAL -LTL /tmp/LTLCardinality3111427466524986815.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(X(("((P1>=1)||(P1>=2))")&&(G(F("((P1>=2)||((Pback2<=P3)&&(P1<1)))")))))))
Formula 0 simplified : !XX("((P1>=1)||(P1>=2))" & GF"((P1>=2)||((Pback2<=P3)&&(P1<1)))")
Detected timeout of ITS tools.
[2021-05-13 01:50:00] [INFO ] Flatten gal took : 64 ms
[2021-05-13 01:50:01] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-13 01:50:01] [INFO ] Transformed 16 places.
[2021-05-13 01:50:01] [INFO ] Transformed 16 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 01:50:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality16898461254693532563.gal : 3 ms
[2021-05-13 01:50:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality7536657300873858905.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality16898461254693532563.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7536657300873858905.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality16898461254693532563.gal -t CGAL -LTL /tmp/LTLCardinality7536657300873858905.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(("((P1>=1)||(P1>=2))")&&(G(F("((P1>=2)||((Pback2<=P3)&&(P1<1)))")))))))
Formula 0 simplified : !XX("((P1>=1)||(P1>=2))" & GF"((P1>=2)||((Pback2<=P3)&&(P1<1)))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-05000"
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-4028"
echo " Executing tool itstools"
echo " Input is Kanban-PT-05000, 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 r121-tall-162075407100556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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