fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075407100548
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16231.279 3600000.00 4341402.00 90687.10 FFTF?TFFTTFTFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620865706135

Running Version 0
[2021-05-13 00:28:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 00:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 00:28:27] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 00:28:27] [INFO ] Transformed 16 places.
[2021-05-13 00:28:27] [INFO ] Transformed 16 transitions.
[2021-05-13 00:28:27] [INFO ] Parsed PT model containing 16 places and 16 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 00:28:27] [INFO ] Initial state test concluded for 4 properties.
FORMULA Kanban-PT-02000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 8 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 00:28:27] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-13 00:28:27] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 00:28:27] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 00:28:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 00:28:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:28:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
[2021-05-13 00:28:27] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 00:28:27] [INFO ] Flatten gal took : 17 ms
FORMULA Kanban-PT-02000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 00:28:28] [INFO ] Flatten gal took : 4 ms
[2021-05-13 00:28:28] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100050 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=2128 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 00:28:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:28:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 00:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 00:28:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 00:28:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 00:28:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 00:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 00:28:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 00:28:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 00:28:28] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 54 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 00:28:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 00:28:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:28:28] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-13 00:28:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 00:28:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 00:28:28] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-13 00:28:28] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 00:28:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 00:28:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:28:28] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-02000-00 automaton TGBA [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 s4)], 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 213 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 125 ms.
[2021-05-13 00:28:29] [INFO ] Flatten gal took : 1 ms
[2021-05-13 00:28:29] [INFO ] Flatten gal took : 2 ms
[2021-05-13 00:28:29] [INFO ] Time to serialize gal into /tmp/LTL5324370157500965096.gal : 1 ms
[2021-05-13 00:28:29] [INFO ] Time to serialize properties into /tmp/LTL16206213578367405320.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5324370157500965096.gal, -t, CGAL, -LTL, /tmp/LTL16206213578367405320.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5324370157500965096.gal -t CGAL -LTL /tmp/LTL16206213578367405320.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(P1>=1)"))))
Formula 0 simplified : !GF"(P1>=1)"
Detected timeout of ITS tools.
[2021-05-13 00:28:44] [INFO ] Flatten gal took : 1 ms
[2021-05-13 00:28:44] [INFO ] Applying decomposition
[2021-05-13 00:28:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1926949334491318872.txt, -o, /tmp/graph1926949334491318872.bin, -w, /tmp/graph1926949334491318872.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1926949334491318872.bin, -l, -1, -v, -w, /tmp/graph1926949334491318872.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 00:28:44] [INFO ] Decomposing Gal with order
[2021-05-13 00:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 00:28:44] [INFO ] Flatten gal took : 22 ms
[2021-05-13 00:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 00:28:44] [INFO ] Time to serialize gal into /tmp/LTL17533705794015077257.gal : 1 ms
[2021-05-13 00:28:44] [INFO ] Time to serialize properties into /tmp/LTL463708793573686781.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17533705794015077257.gal, -t, CGAL, -LTL, /tmp/LTL463708793573686781.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17533705794015077257.gal -t CGAL -LTL /tmp/LTL463708793573686781.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(u2.P1>=1)"))))
Formula 0 simplified : !GF"(u2.P1>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14537014891054112207
[2021-05-13 00:28:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14537014891054112207
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14537014891054112207]
Compilation finished in 161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14537014891054112207]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14537014891054112207]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-02000-00 finished in 46140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F((p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:29:14] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:29:14] [INFO ] Implicit Places using invariants and state equation in 38 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
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 00:29:14] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-02000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s13), p2:(AND (OR (GT 1 s0) (GT 1 s13)) (GT 3 s7)), p1:(GT 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Kanban-PT-02000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-01 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((F(p1) U p2)&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:29:14] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:29:14] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 00:29:14] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Kanban-PT-02000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ s11 s12) (LEQ 2 s5) (LEQ s6 s2)), p2:(LEQ 2 s5), p1:(LEQ s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-03 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1)||X(G(p2))||(!p1&&G(!p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:29:14] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:29:14] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:29:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:29:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 196 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), false, false, true, (NOT p1), p2, (AND (NOT p1) p2)]
Running random walk in product with property : Kanban-PT-02000-04 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s10), p0:(LEQ s2 s7), p2:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31838 reset in 213 ms.
Product exploration explored 100000 steps with 32086 reset in 158 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 181 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), false, false, true, (NOT p1), p2, (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 31988 reset in 106 ms.
Product exploration explored 100000 steps with 32020 reset in 114 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 195 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), false, false, true, (NOT p1), p2, (AND (NOT p1) p2)]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 8 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 00:29:16] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 00:29:16] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 00:29:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:29:16] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 32111 reset in 183 ms.
Product exploration explored 100000 steps with 31965 reset in 187 ms.
[2021-05-13 00:29:16] [INFO ] Flatten gal took : 2 ms
[2021-05-13 00:29:16] [INFO ] Flatten gal took : 2 ms
[2021-05-13 00:29:16] [INFO ] Time to serialize gal into /tmp/LTL2445471317144323561.gal : 1 ms
[2021-05-13 00:29:16] [INFO ] Time to serialize properties into /tmp/LTL9333816080213449391.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2445471317144323561.gal, -t, CGAL, -LTL, /tmp/LTL9333816080213449391.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12470309341777379252.gal -t CGAL -LTL /tmp/LTL15157892161547834620.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(((("(gu1.Pout3<=gu1.P1)")U("(gi1.gi1.gu4.Pm2>=1)"))||(X(G("(gi1.gi1.gu4.P2>=1)"))))||(("(gi1.gi1.gu4.Pm2<1)")&&(G("(gi1.gi1.gu4.P2<1)"))))))
Formula 0 simplified : !G(("(gu1.Pout3<=gu1.P1)" U "(gi1.gi1.gu4.Pm2>=1)") | XG"(gi1.gi1.gu4.P2>=1)" | ("(gi1.gi1.gu4.Pm2<1)" & G"(gi1.gi1.gu4.P2<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin555066834327775799
[2021-05-13 00:29:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin555066834327775799
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin555066834327775799]
Compilation finished in 110 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin555066834327775799]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((((LTLAPp0==true) U (LTLAPp1==true))||X([]((LTLAPp2==true)))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin555066834327775799]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-02000-04 finished in 46898 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:01] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:01] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-02000-06 automaton TGBA [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 s6 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-06 finished in 118 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 11 transition count 12
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2021-05-13 00:30:01] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:01] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-13 00:30:01] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 00:30:01] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-13 00:30:01] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 00:30:01] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:01] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/15 places, 12/16 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-02000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s4)], 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 73 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-02000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-07 finished in 74 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(!p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:01] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:01] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:01] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : Kanban-PT-02000-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s7), p1:(LEQ 1 s10)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Kanban-PT-02000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-10 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 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
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 10 transition count 11
Applied a total of 5 rules in 42 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 00:30:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:02] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 00:30:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 00:30:02] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-13 00:30:02] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 00:30:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:02] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 22 ms :[false]
Running random walk in product with property : Kanban-PT-02000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Stack based approach found an accepted trace after 291 steps with 0 reset with depth 292 and stack size 241 in 0 ms.
FORMULA Kanban-PT-02000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-13 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0&&(p1 U (p2||G(p1))))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 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.
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
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 10 transition count 11
Applied a total of 5 rules in 39 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 00:30:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:02] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-13 00:30:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 00:30:02] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-13 00:30:02] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 00:30:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 00:30:02] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Kanban-PT-02000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s2 s7), p2:(AND (OR (GT s2 s7) (GT 2 s0)) (GT s4 s0)), p1:(GT s4 s0), p3:(OR (GT s4 s0) (AND (OR (GT s2 s7) (GT 2 s0)) (GT s4 s0)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-14 finished in 173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X((p1 U X(G((p2 U p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:02] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:02] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 00:30:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:02] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Running random walk in product with property : Kanban-PT-02000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=11 dest: 12}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=12 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(LEQ 1 s11), p2:(LEQ 2 s4), p0:(LEQ 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 163 ms.
Knowledge obtained : [p1, (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 176 ms.
Applying partial POR strategy [false, true, false, true, true, false, false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 3 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 00:30:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 00:30:04] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 00:30:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 00:30:04] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
[2021-05-13 00:30:04] [INFO ] Flatten gal took : 1 ms
[2021-05-13 00:30:04] [INFO ] Flatten gal took : 2 ms
[2021-05-13 00:30:04] [INFO ] Time to serialize gal into /tmp/LTL12572305762652851023.gal : 0 ms
[2021-05-13 00:30:04] [INFO ] Time to serialize properties into /tmp/LTL13779282740815863428.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12572305762652851023.gal, -t, CGAL, -LTL, /tmp/LTL13779282740815863428.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15430277310569306223.gal -t CGAL -LTL /tmp/LTL1126104391500936325.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("(u1.Pout4>=2)"))U(X(("(u0.P2>=1)")U(X(G(("(u1.Pm4>=2)")U("(u0.P2>=1)")))))))))
Formula 0 simplified : !X(G"(u1.Pout4>=2)" U X("(u0.P2>=1)" U XG("(u1.Pm4>=2)" U "(u0.P2>=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8404037930839174093
[2021-05-13 00:30:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8404037930839174093
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8404037930839174093]
Compilation finished in 111 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8404037930839174093]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true)) U X(((LTLAPp1==true) U X([](((LTLAPp2==true) U (LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8404037930839174093]
LTSmin run took 306 ms.
FORMULA Kanban-PT-02000-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-02000-15 finished in 32495 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10323298132758107882
[2021-05-13 00:30:35] [INFO ] Applying decomposition
[2021-05-13 00:30:35] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2021-05-13 00:30:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 00:30:35] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2021-05-13 00:30:35] [INFO ] Flatten gal took : 1 ms
[2021-05-13 00:30:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 00:30:35] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2021-05-13 00:30:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 00:30:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10323298132758107882
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10323298132758107882]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17756768284072386481.txt, -o, /tmp/graph17756768284072386481.bin, -w, /tmp/graph17756768284072386481.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17756768284072386481.bin, -l, -1, -v, -w, /tmp/graph17756768284072386481.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 00:30:35] [INFO ] Decomposing Gal with order
[2021-05-13 00:30:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 00:30:35] [INFO ] Flatten gal took : 2 ms
[2021-05-13 00:30:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 00:30:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality13689032515556259167.gal : 1 ms
[2021-05-13 00:30:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality5383401736412821970.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality13689032515556259167.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5383401736412821970.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality13689032515556259167.gal -t CGAL -LTL /tmp/LTLCardinality5383401736412821970.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(("(gu3.P1>=1)")||(X(F(("(gu3.P1>=1)")&&(F(("(gu3.P1>=1)")||(G("(gu3.Pback2<=gu3.Pout3)"))))))))))
Formula 0 simplified : !G("(gu3.P1>=1)" | XF("(gu3.P1>=1)" & F("(gu3.P1>=1)" | G"(gu3.Pback2<=gu3.Pout3)")))
Compilation finished in 150 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10323298132758107882]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10323298132758107882]
LTSmin run took 356 ms.
FORMULA Kanban-PT-02000-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((((LTLAPp1==true) U (LTLAPp2==true))||X([]((LTLAPp3==true)))||(!(LTLAPp2==true)&&[](!(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10323298132758107882]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: []((((LTLAPp1==true) U (LTLAPp2==true))||X([]((LTLAPp3==true)))||(!(LTLAPp2==true)&&[](!(LTLAPp3==true)))))
pins2lts-mc-linux64( 1/ 8), 0.001: "[]((((LTLAPp1==true) U (LTLAPp2==true))||X([]((LTLAPp3==true)))||(!(LTLAPp2==true)&&[](!(LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.053: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.053: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.053: State length is 16, there are 37 groups
pins2lts-mc-linux64( 0/ 8), 0.053: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.053: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.053: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.053: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.195: ~1 levels ~960 states ~5488 transitions
pins2lts-mc-linux64( 5/ 8), 0.205: ~1 levels ~1920 states ~12112 transitions
pins2lts-mc-linux64( 4/ 8), 0.211: ~1 levels ~3840 states ~23248 transitions
pins2lts-mc-linux64( 3/ 8), 0.213: ~1 levels ~7680 states ~53840 transitions
pins2lts-mc-linux64( 4/ 8), 0.217: ~1 levels ~15360 states ~117296 transitions
pins2lts-mc-linux64( 4/ 8), 0.237: ~1 levels ~30720 states ~243920 transitions
pins2lts-mc-linux64( 4/ 8), 0.264: ~1 levels ~61440 states ~496512 transitions
pins2lts-mc-linux64( 4/ 8), 0.332: ~1 levels ~122880 states ~1005728 transitions
pins2lts-mc-linux64( 4/ 8), 0.473: ~1 levels ~245760 states ~2136240 transitions
pins2lts-mc-linux64( 4/ 8), 0.792: ~1 levels ~491520 states ~4662896 transitions
pins2lts-mc-linux64( 4/ 8), 1.422: ~1 levels ~983040 states ~9407296 transitions
pins2lts-mc-linux64( 4/ 8), 2.900: ~1 levels ~1966080 states ~20903408 transitions
pins2lts-mc-linux64( 3/ 8), 6.011: ~1 levels ~3932160 states ~45566240 transitions
pins2lts-mc-linux64( 3/ 8), 12.655: ~1 levels ~7864320 states ~94579632 transitions
pins2lts-mc-linux64( 1/ 8), 26.479: ~1 levels ~15728640 states ~202792848 transitions
pins2lts-mc-linux64( 1/ 8), 56.616: ~1 levels ~31457280 states ~420744656 transitions
pins2lts-mc-linux64( 1/ 8), 117.322: ~1 levels ~62914560 states ~856022112 transitions
pins2lts-mc-linux64( 4/ 8), 264.588: ~1 levels ~125829120 states ~1771061072 transitions
pins2lts-mc-linux64( 0/ 8), 274.867: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 274.876:
pins2lts-mc-linux64( 0/ 8), 274.876: mean standard work distribution: 8.6% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 274.876:
pins2lts-mc-linux64( 0/ 8), 274.876: Explored 115116881 states 1835364267 transitions, fanout: 15.943
pins2lts-mc-linux64( 0/ 8), 274.876: Total exploration time 274.810 sec (274.780 sec minimum, 274.793 sec on average)
pins2lts-mc-linux64( 0/ 8), 274.876: States per second: 418896, Transitions per second: 6678666
pins2lts-mc-linux64( 0/ 8), 274.876:
pins2lts-mc-linux64( 0/ 8), 274.876: Progress states detected: 134215459
pins2lts-mc-linux64( 0/ 8), 274.876: Redundant explorations: -14.2299
pins2lts-mc-linux64( 0/ 8), 274.876:
pins2lts-mc-linux64( 0/ 8), 274.876: Queue width: 8B, total height: 37796825, memory: 288.37MB
pins2lts-mc-linux64( 0/ 8), 274.876: Tree memory: 1035.6MB, 8.1 B/state, compr.: 12.3%
pins2lts-mc-linux64( 0/ 8), 274.876: Tree fill ratio (roots/leafs): 99.0%/4.0%
pins2lts-mc-linux64( 0/ 8), 274.876: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 274.876: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 274.876: Est. total memory use: 1323.9MB (~1312.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((((LTLAPp1==true) U (LTLAPp2==true))||X([]((LTLAPp3==true)))||(!(LTLAPp2==true)&&[](!(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10323298132758107882]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((((LTLAPp1==true) U (LTLAPp2==true))||X([]((LTLAPp3==true)))||(!(LTLAPp2==true)&&[](!(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10323298132758107882]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 00:51:18] [INFO ] Flatten gal took : 52 ms
[2021-05-13 00:51:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality1180404905922041527.gal : 12 ms
[2021-05-13 00:51:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality6221537121880237660.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality1180404905922041527.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6221537121880237660.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

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

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-02000"
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-02000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407100548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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