Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820700307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
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 r132-tall-165271820700307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.8K Apr 29 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 29 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 17:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:34 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-LTLCardinality-00
FORMULA_NAME Kanban-PT-05000-LTLCardinality-01
FORMULA_NAME Kanban-PT-05000-LTLCardinality-02
FORMULA_NAME Kanban-PT-05000-LTLCardinality-03
FORMULA_NAME Kanban-PT-05000-LTLCardinality-04
FORMULA_NAME Kanban-PT-05000-LTLCardinality-05
FORMULA_NAME Kanban-PT-05000-LTLCardinality-06
FORMULA_NAME Kanban-PT-05000-LTLCardinality-07
FORMULA_NAME Kanban-PT-05000-LTLCardinality-08
FORMULA_NAME Kanban-PT-05000-LTLCardinality-09
FORMULA_NAME Kanban-PT-05000-LTLCardinality-10
FORMULA_NAME Kanban-PT-05000-LTLCardinality-11
FORMULA_NAME Kanban-PT-05000-LTLCardinality-12
FORMULA_NAME Kanban-PT-05000-LTLCardinality-13
FORMULA_NAME Kanban-PT-05000-LTLCardinality-14
FORMULA_NAME Kanban-PT-05000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652770862722

Running Version 202205111006
[2022-05-17 07:01:03] [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]
[2022-05-17 07:01:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:01:04] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2022-05-17 07:01:04] [INFO ] Transformed 16 places.
[2022-05-17 07:01:04] [INFO ] Transformed 16 transitions.
[2022-05-17 07:01:04] [INFO ] Parsed PT model containing 16 places and 16 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Kanban-PT-05000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 9 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:01:04] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-17 07:01:04] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:01:04] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-17 07:01:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:01:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 07:01:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Support contains 14 out of 16 places after structural reductions.
[2022-05-17 07:01:04] [INFO ] Flatten gal took : 15 ms
[2022-05-17 07:01:04] [INFO ] Flatten gal took : 3 ms
[2022-05-17 07:01:04] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:01:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 07:01:04] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-17 07:01:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:01:04] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 07:01:04] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 07:01:04] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 07:01:04] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 99158 steps, including 1 resets, run visited all 1 properties in 97 ms. (steps per millisecond=1022 )
Parikh walk visited 11 properties in 1816 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(p0)))||((G(p1)||F(p2))&&p3))))'
Support contains 7 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:01:07] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:01:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:01:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 539 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 8}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=true, acceptance={} source=8 dest: 3}], [{ cond=(NOT p2), acceptance={} source=9 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 5}]], initial=7, aps=[p2:(LEQ s12 s0), p3:(OR (LEQ s14 s9) (LEQ s5 s3)), p1:(LEQ s9 s10), p0:(LEQ s5 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 277 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 p1 p0), (X (AND p3 p1 (NOT p2))), (X p3), (X (NOT (AND p3 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 11 states, 20 edges and 4 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:01:09] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 07:01:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 07:01:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:01:09] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 07:01:09] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 07:01:09] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 59997 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=1034 )
Parikh walk visited 5 properties in 451 ms.
Knowledge obtained : [(AND (NOT p2) p3 p1 p0), (X (AND p3 p1 (NOT p2))), (X p3), (X (NOT (AND p3 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 464 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 6 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 07:01:10] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 07:01:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 07:01:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:01:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:01:11] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 07:01:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:01:11] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 07:01:11] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-17 07:01:11] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 64706 steps, including 0 resets, run visited all 1 properties in 76 ms. (steps per millisecond=851 )
Parikh walk visited 5 properties in 1292 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), true]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F p2), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0 p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 4 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 8 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
[2022-05-17 07:01:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:01:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:01:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Built C files in :
/tmp/ltsmin5924923576995628016
[2022-05-17 07:01:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5924923576995628016
Running compilation step : cd /tmp/ltsmin5924923576995628016;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin5924923576995628016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5924923576995628016;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4113086756502679875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:01:30] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:01:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:01:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:01:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin11763407303773180420
[2022-05-17 07:01:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11763407303773180420
Running compilation step : cd /tmp/ltsmin11763407303773180420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin11763407303773180420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin11763407303773180420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased567664867631174510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 07:01:45] [INFO ] Flatten gal took : 2 ms
[2022-05-17 07:01:45] [INFO ] Flatten gal took : 4 ms
[2022-05-17 07:01:45] [INFO ] Time to serialize gal into /tmp/LTL13919804696485919832.gal : 5 ms
[2022-05-17 07:01:45] [INFO ] Time to serialize properties into /tmp/LTL2166493727998248865.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13919804696485919832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2166493727998248865.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1391980...267
Read 1 LTL properties
Checking formula 0 : !((X((G(X(X("(Pback4<=P4)"))))||(((G("(Pout1<=Pback1)"))||(F("(P2<=Pm3)")))&&("((Pback2<=Pout1)||(Pback4<=P4))")))))
Formula 0 simplified : !X(GXX"(Pback4<=P4)" | ("((Pback2<=Pout1)||(Pback4<=P4))" & (G"(Pout1<=Pback1)" | F"(P2<=Pm3)")))
Detected timeout of ITS tools.
[2022-05-17 07:02:00] [INFO ] Flatten gal took : 2 ms
[2022-05-17 07:02:00] [INFO ] Applying decomposition
[2022-05-17 07:02:00] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph385086821280398941.txt' '-o' '/tmp/graph385086821280398941.bin' '-w' '/tmp/graph385086821280398941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph385086821280398941.bin' '-l' '-1' '-v' '-w' '/tmp/graph385086821280398941.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:02:00] [INFO ] Decomposing Gal with order
[2022-05-17 07:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:02:00] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 07:02:00] [INFO ] Flatten gal took : 26 ms
[2022-05-17 07:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 07:02:00] [INFO ] Time to serialize gal into /tmp/LTL17110367731668757844.gal : 0 ms
[2022-05-17 07:02:00] [INFO ] Time to serialize properties into /tmp/LTL4252176675795793875.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17110367731668757844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4252176675795793875.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1711036...267
Read 1 LTL properties
Checking formula 0 : !((X((G(X(X("(gu0.Pback4<=gu0.P4)"))))||(((G("(gi2.gu1.Pout1<=gi2.gu1.Pback1)"))||(F("(gu2.P2<=gu2.Pm3)")))&&("((gi2.gu1.Pback2<=gi2.g...193
Formula 0 simplified : !X(GXX"(gu0.Pback4<=gu0.P4)" | ("((gi2.gu1.Pback2<=gi2.gu1.Pout1)||(gu0.Pback4<=gu0.P4))" & (G"(gi2.gu1.Pout1<=gi2.gu1.Pback1)" | F"...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17413652935080579559
[2022-05-17 07:02:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17413652935080579559
Running compilation step : cd /tmp/ltsmin17413652935080579559;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin17413652935080579559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17413652935080579559;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](X(X((LTLAPp0==true))))||(([]((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-05000-LTLCardinality-00 finished in 83838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:30] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 3 s11), p0:(OR (LEQ 3 s11) (LEQ s6 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-05000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-05000-LTLCardinality-01 finished in 574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(((F(p0) U p1)&&p2)))||G(p3))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
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
[2022-05-17 07:02:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:31] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(LEQ 3 s7), p2:(LEQ 2 s2), p1:(OR (LEQ s4 s11) (LEQ 2 s2)), p0:(GT s4 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1822 reset in 134 ms.
Product exploration explored 100000 steps with 1884 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p1 (NOT p0)), (X p3), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 578 ms. Reduced automaton from 8 states, 21 edges and 4 AP to 8 states, 20 edges and 4 AP.
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:02:33] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:5
[2022-05-17 07:02:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:02:33] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :5
[2022-05-17 07:02:33] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :5
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 07:02:33] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :5
Fused 14 Parikh solutions to 5 different solutions.
Finished Parikh walk after 55279 steps, including 0 resets, run visited all 1 properties in 49 ms. (steps per millisecond=1128 )
Parikh walk visited 5 properties in 946 ms.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) p1 (NOT p0)), (X p3), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p1) p2 p3))), (G (NOT (AND (NOT p1) (NOT p0) p2 p3))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p1) p2 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p1) (NOT p0) p3))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)))), (F (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F p2), (F (AND (NOT p1) p3)), (F (NOT p1))]
Knowledge based reduction with 20 factoid took 1036 ms. Reduced automaton from 8 states, 20 edges and 4 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 2 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:35] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:35] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:02:36] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 07:02:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:02:36] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 07:02:36] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 07:02:36] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35567 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=1077 )
Parikh walk visited 1 properties in 34 ms.
Knowledge obtained : [(AND (NOT p2) p3), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1884 reset in 123 ms.
Product exploration explored 100000 steps with 1855 reset in 108 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 8 / 14 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 4 ms. Remains 10 /14 variables (removed 4) and now considering 11/15 (removed 4) transitions.
[2022-05-17 07:02:37] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:02:37] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 07:02:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/14 places, 11/15 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/14 places, 11/15 transitions.
Product exploration explored 100000 steps with 5151 reset in 147 ms.
Product exploration explored 100000 steps with 5174 reset in 129 ms.
Built C files in :
/tmp/ltsmin16679029561416742233
[2022-05-17 07:02:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16679029561416742233
Running compilation step : cd /tmp/ltsmin16679029561416742233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin16679029561416742233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16679029561416742233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7047241782434343778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:52] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:02:52] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:02:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:02:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin7552583927857791764
[2022-05-17 07:02:52] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7552583927857791764
Running compilation step : cd /tmp/ltsmin7552583927857791764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin7552583927857791764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7552583927857791764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6265686849175763236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 07:03:07] [INFO ] Flatten gal took : 3 ms
[2022-05-17 07:03:07] [INFO ] Flatten gal took : 2 ms
[2022-05-17 07:03:07] [INFO ] Time to serialize gal into /tmp/LTL3054031262976793467.gal : 0 ms
[2022-05-17 07:03:07] [INFO ] Time to serialize properties into /tmp/LTL15547779756954558368.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3054031262976793467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15547779756954558368.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3054031...267
Read 1 LTL properties
Checking formula 0 : !((X((F(X(((F("(Pm4>P2)"))U("((Pm4<=P2)||(Pout3>=2))"))&&("(Pout3>=2)"))))||(G("(P1>=3)")))))
Formula 0 simplified : !X(FX("(Pout3>=2)" & (F"(Pm4>P2)" U "((Pm4<=P2)||(Pout3>=2))")) | G"(P1>=3)")
Detected timeout of ITS tools.
[2022-05-17 07:03:22] [INFO ] Flatten gal took : 4 ms
[2022-05-17 07:03:22] [INFO ] Applying decomposition
[2022-05-17 07:03:22] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12102918526216181815.txt' '-o' '/tmp/graph12102918526216181815.bin' '-w' '/tmp/graph12102918526216181815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12102918526216181815.bin' '-l' '-1' '-v' '-w' '/tmp/graph12102918526216181815.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:03:22] [INFO ] Decomposing Gal with order
[2022-05-17 07:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:03:22] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 07:03:22] [INFO ] Flatten gal took : 2 ms
[2022-05-17 07:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-05-17 07:03:22] [INFO ] Time to serialize gal into /tmp/LTL16599966680205134835.gal : 0 ms
[2022-05-17 07:03:22] [INFO ] Time to serialize properties into /tmp/LTL1166776248104591769.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16599966680205134835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1166776248104591769.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1659996...267
Read 1 LTL properties
Checking formula 0 : !((X((F(X(((F("(gu2.Pm4>gu2.P2)"))U("((gu2.Pm4<=gu2.P2)||(gi1.gi0.gu0.Pout3>=2))"))&&("(gi1.gi0.gu0.Pout3>=2)"))))||(G("(gi1.gi1.gu4.P...166
Formula 0 simplified : !X(FX("(gi1.gi0.gu0.Pout3>=2)" & (F"(gu2.Pm4>gu2.P2)" U "((gu2.Pm4<=gu2.P2)||(gi1.gi0.gu0.Pout3>=2))")) | G"(gi1.gi1.gu4.P1>=3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16265338566456604806
[2022-05-17 07:03:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16265338566456604806
Running compilation step : cd /tmp/ltsmin16265338566456604806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin16265338566456604806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16265338566456604806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(X(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&(LTLAPp2==true))))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-05000-LTLCardinality-02 finished in 81657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-05000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-LTLCardinality-05 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
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
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT 2 s0) (AND (GT 2 s4) (GT 3 s14)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Kanban-PT-05000-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-05000-LTLCardinality-07 finished in 301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-05000-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-05000-LTLCardinality-09 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(X((X(p0)&&p1)) U (F(p1)||F(!p0))))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Applied a total of 3 rules in 5 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2022-05-17 07:03:53] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-17 07:03:53] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 07:03:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-17 07:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s3), p1:(LEQ s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-05000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-LTLCardinality-12 finished in 139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !F(p1)))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 6 / 16 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.
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-17 07:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 77 ms :[p1, (NOT p0)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s10), p0:(OR (LEQ 3 s6) (LEQ s3 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-05000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-LTLCardinality-13 finished in 165 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-17 07:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s5), p0:(LEQ s4 s7), p1:(LEQ s9 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-05000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-05000-LTLCardinality-14 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 14 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Applied a total of 5 rules in 217 ms. Remains 9 /16 variables (removed 7) and now considering 10/16 (removed 6) transitions.
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-17 07:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:03:54] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2022-05-17 07:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/16 places, 10/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/16 places, 10/16 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-05000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 81415 steps, run visited all 1 properties in 114 ms. (steps per millisecond=714 )
Probabilistic random walk after 81415 steps, saw 45707 distinct states, run finished after 114 ms. (steps per millisecond=714 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2022-05-17 07:03:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2022-05-17 07:03:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:03:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-17 07:03:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2022-05-17 07:03:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:03:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-17 07:03:55] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:03:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2022-05-17 07:03:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:03:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 81415 steps, run visited all 1 properties in 102 ms. (steps per millisecond=798 )
Probabilistic random walk after 81415 steps, saw 45707 distinct states, run finished after 102 ms. (steps per millisecond=798 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Built C files in :
/tmp/ltsmin2841994330466790620
[2022-05-17 07:03:56] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-17 07:03:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:03:56] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-17 07:03:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:03:56] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-17 07:03:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:03:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2841994330466790620
Running compilation step : cd /tmp/ltsmin2841994330466790620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin2841994330466790620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2841994330466790620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11037691480914622888.hoa' '--buchi-type=spotba'
LTSmin run took 960 ms.
FORMULA Kanban-PT-05000-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-05000-LTLCardinality-15 finished in 3280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(p0)))||((G(p1)||F(p2))&&p3))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(((F(p0) U p1)&&p2)))||G(p3))))'
[2022-05-17 07:03:57] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9935599211699784647
[2022-05-17 07:03:57] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2022-05-17 07:03:57] [INFO ] Applying decomposition
[2022-05-17 07:03:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:03:57] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2022-05-17 07:03:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:03:57] [INFO ] Flatten gal took : 1 ms
[2022-05-17 07:03:57] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2022-05-17 07:03:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:03:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9935599211699784647
Running compilation step : cd /tmp/ltsmin9935599211699784647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5643868234975570768.txt' '-o' '/tmp/graph5643868234975570768.bin' '-w' '/tmp/graph5643868234975570768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5643868234975570768.bin' '-l' '-1' '-v' '-w' '/tmp/graph5643868234975570768.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:03:57] [INFO ] Decomposing Gal with order
[2022-05-17 07:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:03:57] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 07:03:57] [INFO ] Flatten gal took : 2 ms
[2022-05-17 07:03:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-05-17 07:03:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality787290419185090849.gal : 0 ms
[2022-05-17 07:03:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality10233290785447767830.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality787290419185090849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10233290785447767830.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((X((G(X(X("(gu1.Pback4<=gu1.P4)"))))||(((G("(gi2.gi0.gu2.Pout1<=gi2.gi0.gu2.Pback1)"))||(F("(gu0.P2<=gu0.Pm3)")))&&("((gi2.gi0.gu2.P...209
Formula 0 simplified : !X(GXX"(gu1.Pback4<=gu1.P4)" | ("((gi2.gi0.gu2.Pback2<=gi2.gi0.gu2.Pout1)||(gu1.Pback4<=gu1.P4))" & (G"(gi2.gi0.gu2.Pout1<=gi2.gi0.g...192
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin9935599211699784647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9935599211699784647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](X(X((LTLAPp0==true))))||(([]((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.203: LTL layer: formula: X(([](X(X((LTLAPp0==true))))||(([]((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp3==true))))
pins2lts-mc-linux64( 4/ 8), 0.203: "X(([](X(X((LTLAPp0==true))))||(([]((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.203: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.213: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.223: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.284: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.285: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.285: State length is 17, there are 36 groups
pins2lts-mc-linux64( 0/ 8), 0.285: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.285: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.285: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.285: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.295: ~1 levels ~960 states ~4232 transitions
pins2lts-mc-linux64( 1/ 8), 0.300: ~1 levels ~1920 states ~8944 transitions
pins2lts-mc-linux64( 1/ 8), 0.326: ~1 levels ~3840 states ~19976 transitions
pins2lts-mc-linux64( 1/ 8), 0.353: ~1 levels ~7680 states ~43184 transitions
pins2lts-mc-linux64( 1/ 8), 0.428: ~1 levels ~15360 states ~90560 transitions
pins2lts-mc-linux64( 1/ 8), 0.554: ~1 levels ~30720 states ~200224 transitions
pins2lts-mc-linux64( 1/ 8), 0.765: ~1 levels ~61440 states ~435160 transitions
pins2lts-mc-linux64( 1/ 8), 1.161: ~1 levels ~122880 states ~936024 transitions
pins2lts-mc-linux64( 1/ 8), 1.843: ~1 levels ~245760 states ~1990976 transitions
pins2lts-mc-linux64( 1/ 8), 2.844: ~1 levels ~491520 states ~4181832 transitions
pins2lts-mc-linux64( 6/ 8), 4.036: ~1 levels ~983040 states ~8671016 transitions
pins2lts-mc-linux64( 5/ 8), 6.064: ~1 levels ~1966080 states ~17152920 transitions
pins2lts-mc-linux64( 5/ 8), 9.564: ~1 levels ~3932160 states ~35217544 transitions
pins2lts-mc-linux64( 5/ 8), 18.258: ~1 levels ~7864320 states ~73202072 transitions
pins2lts-mc-linux64( 5/ 8), 35.796: ~1 levels ~15728640 states ~150067224 transitions
pins2lts-mc-linux64( 5/ 8), 70.862: ~1 levels ~31457280 states ~307200968 transitions
pins2lts-mc-linux64( 5/ 8), 161.457: ~1 levels ~62914560 states ~631065928 transitions
pins2lts-mc-linux64( 3/ 8), 385.406: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 385.486:
pins2lts-mc-linux64( 0/ 8), 385.486: mean standard work distribution: 3.6% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 385.486:
pins2lts-mc-linux64( 0/ 8), 385.486: Explored 113627972 states 1237638411 transitions, fanout: 10.892
pins2lts-mc-linux64( 0/ 8), 385.486: Total exploration time 385.180 sec (385.100 sec minimum, 385.133 sec on average)
pins2lts-mc-linux64( 0/ 8), 385.486: States per second: 295000, Transitions per second: 3213143
pins2lts-mc-linux64( 0/ 8), 385.486:
pins2lts-mc-linux64( 0/ 8), 385.486: Progress states detected: 134216903
pins2lts-mc-linux64( 0/ 8), 385.486: Redundant explorations: -15.3402
pins2lts-mc-linux64( 0/ 8), 385.486:
pins2lts-mc-linux64( 0/ 8), 385.486: Queue width: 8B, total height: 41729428, memory: 318.37MB
pins2lts-mc-linux64( 0/ 8), 385.486: Tree memory: 1068.4MB, 8.3 B/state, compr.: 11.9%
pins2lts-mc-linux64( 0/ 8), 385.486: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 385.486: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 385.486: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 385.486: Est. total memory use: 1386.7MB (~1342.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9935599211699784647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](X(X((LTLAPp0==true))))||(([]((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9935599211699784647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](X(X((LTLAPp0==true))))||(([]((LTLAPp1==true))||<>((LTLAPp2==true)))&&(LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 07:24:56] [INFO ] Flatten gal took : 2 ms
[2022-05-17 07:24:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality6944388714682894956.gal : 1 ms
[2022-05-17 07:24:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality6316460294216980046.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6944388714682894956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6316460294216980046.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((X((G(X(X("(Pback4<=P4)"))))||(((G("(Pout1<=Pback1)"))||(F("(P2<=Pm3)")))&&("((Pback2<=Pout1)||(Pback4<=P4))")))))
Formula 0 simplified : !X(GXX"(Pback4<=P4)" | ("((Pback2<=Pout1)||(Pback4<=P4))" & (G"(Pout1<=Pback1)" | F"(P2<=Pm3)")))
Detected timeout of ITS tools.
[2022-05-17 07:45:55] [INFO ] Flatten gal took : 151 ms
[2022-05-17 07:45:56] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-17 07:45:56] [INFO ] Transformed 16 places.
[2022-05-17 07:45:56] [INFO ] Transformed 16 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 07:45:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality9284315784205990547.gal : 17 ms
[2022-05-17 07:45:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality2243650070026614536.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9284315784205990547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2243650070026614536.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(X(X("(Pback4<=P4)"))))||(((G("(Pout1<=Pback1)"))||(F("(P2<=Pm3)")))&&("((Pback2<=Pout1)||(Pback4<=P4))")))))
Formula 0 simplified : !X(GXX"(Pback4<=P4)" | ("((Pback2<=Pout1)||(Pback4<=P4))" & (G"(Pout1<=Pback1)" | F"(P2<=Pm3)")))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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 r132-tall-165271820700307"
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 ;