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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K 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.6K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:09 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-00100-00
FORMULA_NAME Kanban-PT-00100-01
FORMULA_NAME Kanban-PT-00100-02
FORMULA_NAME Kanban-PT-00100-03
FORMULA_NAME Kanban-PT-00100-04
FORMULA_NAME Kanban-PT-00100-05
FORMULA_NAME Kanban-PT-00100-06
FORMULA_NAME Kanban-PT-00100-07
FORMULA_NAME Kanban-PT-00100-08
FORMULA_NAME Kanban-PT-00100-09
FORMULA_NAME Kanban-PT-00100-10
FORMULA_NAME Kanban-PT-00100-11
FORMULA_NAME Kanban-PT-00100-12
FORMULA_NAME Kanban-PT-00100-13
FORMULA_NAME Kanban-PT-00100-14
FORMULA_NAME Kanban-PT-00100-15

=== Now, execution of the tool begins

BK_START 1620858456192

Running Version 0
[2021-05-12 22:27:37] [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-12 22:27:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:27:37] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 22:27:37] [INFO ] Transformed 16 places.
[2021-05-12 22:27:37] [INFO ] Transformed 16 transitions.
[2021-05-12 22:27:37] [INFO ] Parsed PT model containing 16 places and 16 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 22:27:37] [INFO ] Initial state test concluded for 4 properties.
FORMULA Kanban-PT-00100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 17 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:37] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:38] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:27:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-12 22:27:38] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 22:27:38] [INFO ] Flatten gal took : 18 ms
FORMULA Kanban-PT-00100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 22:27:38] [INFO ] Flatten gal took : 4 ms
[2021-05-12 22:27:38] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 14847 steps, including 0 resets, run visited all 24 properties in 12 ms. (steps per millisecond=1237 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 20 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-12 22:27:38] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-12 22:27:38] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:27:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-12 22:27:38] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-12 22:27:38] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00100-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s9)], 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 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-01 finished in 262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G((p1&&X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, true]
Running random walk in product with property : Kanban-PT-00100-02 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(GT 2 s1), p0:(LEQ s11 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-02 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G((p1||X((p2||X(p0))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:27:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:27:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:27:38] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Kanban-PT-00100-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(LEQ s12 s13), p2:(LEQ s3 s13), p0:(LEQ s13 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-03 finished in 227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((X(p1) U (p2 U X(p3)))||p0))))], workingDir=/home/mcc/execution]
Support contains 7 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 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:27:39] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:27:39] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:27:39] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:27:39] [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 16 rows 15 cols
[2021-05-12 22:27:39] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:27:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p1 (NOT p3)), (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), true]
Running random walk in product with property : Kanban-PT-00100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ s1 s6) (LEQ s2 s0)), p2:(LEQ s1 s6), p1:(LEQ 1 s12), p3:(LEQ s3 s9)], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 288 ms.
Product exploration explored 100000 steps with 4 reset in 276 ms.
Knowledge obtained : [p0, p2, (NOT p1), p3]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p1 (NOT p3)), (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), true]
Product exploration explored 100000 steps with 3 reset in 149 ms.
Product exploration explored 100000 steps with 2 reset in 250 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p2 (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p1 (NOT p3)), (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), true]
Support contains 7 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 5 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
[2021-05-12 22:27:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:27:40] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:27:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Product exploration explored 100000 steps with 2 reset in 150 ms.
Product exploration explored 100000 steps with 2 reset in 290 ms.
[2021-05-12 22:27:41] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:27:41] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:27:41] [INFO ] Time to serialize gal into /tmp/LTL17891428179105825477.gal : 1 ms
[2021-05-12 22:27:41] [INFO ] Time to serialize properties into /tmp/LTL16018325555007248828.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/LTL17891428179105825477.gal, -t, CGAL, -LTL, /tmp/LTL16018325555007248828.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/LTL17891428179105825477.gal -t CGAL -LTL /tmp/LTL16018325555007248828.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Pm3<=Pback4)||(Pback3<=P3))")||((X("(Pm2>=1)"))U(("(Pm3<=Pback4)")U(X("(Pout3<=P1)"))))))))
Formula 0 simplified : !XG("((Pm3<=Pback4)||(Pback3<=P3))" | (X"(Pm2>=1)" U ("(Pm3<=Pback4)" U X"(Pout3<=P1)")))
Detected timeout of ITS tools.
[2021-05-12 22:27:56] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:27:56] [INFO ] Applying decomposition
[2021-05-12 22:27:56] [INFO ] Flatten gal took : 17 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/graph835453997945910790.txt, -o, /tmp/graph835453997945910790.bin, -w, /tmp/graph835453997945910790.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/graph835453997945910790.bin, -l, -1, -v, -w, /tmp/graph835453997945910790.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:27:56] [INFO ] Decomposing Gal with order
[2021-05-12 22:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:27:56] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-12 22:27:56] [INFO ] Flatten gal took : 72 ms
[2021-05-12 22:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 22:27:56] [INFO ] Time to serialize gal into /tmp/LTL16509309606294446328.gal : 1 ms
[2021-05-12 22:27:56] [INFO ] Time to serialize properties into /tmp/LTL12196608165734584771.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/LTL16509309606294446328.gal, -t, CGAL, -LTL, /tmp/LTL12196608165734584771.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/LTL16509309606294446328.gal -t CGAL -LTL /tmp/LTL12196608165734584771.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gu2.Pm3<=gu2.Pback4)||(gu0.Pback3<=gu0.P3))")||((X("(gi3.gu5.Pm2>=1)"))U(("(gu2.Pm3<=gu2.Pback4)")U(X("(gu4.Pout3<=gu4.P1)"))))))))
Formula 0 simplified : !XG("((gu2.Pm3<=gu2.Pback4)||(gu0.Pback3<=gu0.P3))" | (X"(gi3.gu5.Pm2>=1)" U ("(gu2.Pm3<=gu2.Pback4)" U X"(gu4.Pout3<=gu4.P1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7800015760163368826
[2021-05-12 22:28:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7800015760163368826
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/ltsmin7800015760163368826]
Compilation finished in 206 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7800015760163368826]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((X((LTLAPp1==true)) U ((LTLAPp2==true) U X((LTLAPp3==true))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7800015760163368826]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-00100-04 finished in 47707 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(F(p0))&&(F(!p0)||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:28:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:28:26] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:28:26] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:28:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:28:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:28:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : Kanban-PT-00100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1 s3), p1:(LEQ s5 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 133 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Kanban-PT-00100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-07 finished in 290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:28:27] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:27] [INFO ] Implicit Places using invariants and state equation in 21 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-12 22:28:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:27] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00100-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 17796 reset in 74 ms.
Stack based approach found an accepted trace after 7 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Kanban-PT-00100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-09 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(F(p0))||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:27] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:27] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-00100-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(OR (LEQ 1 s10) (GT s4 s13)), p0:(GT 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27242 reset in 65 ms.
Product exploration explored 100000 steps with 27267 reset in 74 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 27264 reset in 64 ms.
Product exploration explored 100000 steps with 27286 reset in 75 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-12 22:28:27] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:28:27] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-12 22:28:27] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:28:27] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/14 places, 13/15 transitions.
Product exploration explored 100000 steps with 27254 reset in 171 ms.
Product exploration explored 100000 steps with 27240 reset in 90 ms.
[2021-05-12 22:28:28] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:28:28] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:28:28] [INFO ] Time to serialize gal into /tmp/LTL2524389703904710345.gal : 0 ms
[2021-05-12 22:28:28] [INFO ] Time to serialize properties into /tmp/LTL9128235171204118437.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/LTL2524389703904710345.gal, -t, CGAL, -LTL, /tmp/LTL9128235171204118437.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/LTL2524389703904710345.gal -t CGAL -LTL /tmp/LTL9128235171204118437.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X(F("(P1<2)")))||(F("((Pm2>=1)||(Pm4>Pback2))"))))))
Formula 0 simplified : !XX(XF"(P1<2)" | F"((Pm2>=1)||(Pm4>Pback2))")
Detected timeout of ITS tools.
[2021-05-12 22:28:43] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:28:43] [INFO ] Applying decomposition
[2021-05-12 22:28:43] [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/graph4271437408664183324.txt, -o, /tmp/graph4271437408664183324.bin, -w, /tmp/graph4271437408664183324.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/graph4271437408664183324.bin, -l, -1, -v, -w, /tmp/graph4271437408664183324.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:28:43] [INFO ] Decomposing Gal with order
[2021-05-12 22:28:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:28:43] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-12 22:28:43] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:28:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2021-05-12 22:28:43] [INFO ] Time to serialize gal into /tmp/LTL447278687820432817.gal : 0 ms
[2021-05-12 22:28:43] [INFO ] Time to serialize properties into /tmp/LTL9138961828626850096.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/LTL447278687820432817.gal, -t, CGAL, -LTL, /tmp/LTL9138961828626850096.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/LTL447278687820432817.gal -t CGAL -LTL /tmp/LTL9138961828626850096.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X(F("(gi0.gi1.gu3.P1<2)")))||(F("((gi0.gi0.gu5.Pm2>=1)||(gu2.Pm4>gu2.Pback2))"))))))
Formula 0 simplified : !XX(XF"(gi0.gi1.gu3.P1<2)" | F"((gi0.gi0.gu5.Pm2>=1)||(gu2.Pm4>gu2.Pback2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11681782158913697376
[2021-05-12 22:28:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11681782158913697376
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/ltsmin11681782158913697376]
Compilation finished in 117 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11681782158913697376]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((X(<>((LTLAPp0==true)))||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11681782158913697376]
LTSmin run took 511 ms.
FORMULA Kanban-PT-00100-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-00100-10 finished in 31786 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:59] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:28:59] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:28:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:59] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), p0]
Running random walk in product with property : Kanban-PT-00100-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s4 s6)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), p0]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), p0]
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, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 7 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 12 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-12 22:28:59] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:28:59] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-12 22:28:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:28:59] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/14 places, 13/15 transitions.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
[2021-05-12 22:28:59] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:28:59] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:28:59] [INFO ] Time to serialize gal into /tmp/LTL12815066642087158553.gal : 1 ms
[2021-05-12 22:28:59] [INFO ] Time to serialize properties into /tmp/LTL9662817817876542981.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/LTL12815066642087158553.gal, -t, CGAL, -LTL, /tmp/LTL9662817817876542981.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/LTL12815066642087158553.gal -t CGAL -LTL /tmp/LTL9662817817876542981.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(Pm4>Pm1)")))&&(F("(Pm4<=Pm1)"))))
Formula 0 simplified : !(XF"(Pm4>Pm1)" & F"(Pm4<=Pm1)")
Detected timeout of ITS tools.
[2021-05-12 22:29:14] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:29:14] [INFO ] Applying decomposition
[2021-05-12 22:29:14] [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/graph17090153305532000193.txt, -o, /tmp/graph17090153305532000193.bin, -w, /tmp/graph17090153305532000193.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/graph17090153305532000193.bin, -l, -1, -v, -w, /tmp/graph17090153305532000193.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:29:14] [INFO ] Decomposing Gal with order
[2021-05-12 22:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:29:14] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-12 22:29:14] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 0 ms.
[2021-05-12 22:29:14] [INFO ] Time to serialize gal into /tmp/LTL14654333407821851329.gal : 1 ms
[2021-05-12 22:29:14] [INFO ] Time to serialize properties into /tmp/LTL3693144639940206156.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/LTL14654333407821851329.gal, -t, CGAL, -LTL, /tmp/LTL3693144639940206156.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/LTL14654333407821851329.gal -t CGAL -LTL /tmp/LTL3693144639940206156.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(gu2.Pm4>gu2.Pm1)")))&&(F("(gu2.Pm4<=gu2.Pm1)"))))
Formula 0 simplified : !(XF"(gu2.Pm4>gu2.Pm1)" & F"(gu2.Pm4<=gu2.Pm1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1270962602127774225
[2021-05-12 22:29:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1270962602127774225
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/ltsmin1270962602127774225]
Compilation finished in 114 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1270962602127774225]
Link finished in 38 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)))&&<>(!(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1270962602127774225]
LTSmin run took 360 ms.
FORMULA Kanban-PT-00100-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-00100-11 finished in 31547 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||((p0 U p1) U G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:29:30] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:29:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:29:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Kanban-PT-00100-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s8), p1:(GT s4 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-13 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G((F(p1) U (!p0&&(p2||G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 4 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-12 22:29:30] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:29:30] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-12 22:29:30] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:29:30] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-12 22:29:30] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:29:30] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:29:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR p0 (AND (NOT p2) (NOT p3))), (OR p0 (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-00100-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 (AND (NOT p2) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(OR p0 (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND p0 (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p3) (AND (NOT p2) p3)), acceptance={1} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 p3 (NOT p1)) (AND (NOT p2) p3 (NOT p1))), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) p3 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={1} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p3) (NOT p1))), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 p3 (NOT p1)) (AND (NOT p2) p3 (NOT p1))), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s1 s5), p2:(LEQ 3 s1), p3:(LEQ 2 s0), p1:(LEQ s2 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-14 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p0 U X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:29:30] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:29:31] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:29:31] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:29:31] [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.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:29:31] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:29:31] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-00100-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8133 reset in 79 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Kanban-PT-00100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00100-15 finished in 205 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9748745718172711155
[2021-05-12 22:29:31] [INFO ] Applying decomposition
[2021-05-12 22:29:31] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:29:31] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2021-05-12 22:29:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 22:29:31] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2021-05-12 22:29:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 22:29:31] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2021-05-12 22:29:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 22:29:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9748745718172711155
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/ltsmin9748745718172711155]
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/graph687491190880497789.txt, -o, /tmp/graph687491190880497789.bin, -w, /tmp/graph687491190880497789.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/graph687491190880497789.bin, -l, -1, -v, -w, /tmp/graph687491190880497789.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:29:31] [INFO ] Decomposing Gal with order
[2021-05-12 22:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:29:31] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-12 22:29:31] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 22:29:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality6885078580806614286.gal : 1 ms
[2021-05-12 22:29:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality4949637149727655177.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/LTLCardinality6885078580806614286.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4949637149727655177.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/LTLCardinality6885078580806614286.gal -t CGAL -LTL /tmp/LTLCardinality4949637149727655177.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gu2.Pm3<=gu2.Pback4)||(gu0.Pback3<=gu0.P3))")||((X("(gi3.gu5.Pm2>=1)"))U(("(gu2.Pm3<=gu2.Pback4)")U(X("(gu4.Pout3<=gu4.P1)"))))))))
Formula 0 simplified : !XG("((gu2.Pm3<=gu2.Pback4)||(gu0.Pback3<=gu0.P3))" | (X"(gi3.gu5.Pm2>=1)" U ("(gu2.Pm3<=gu2.Pback4)" U X"(gu4.Pout3<=gu4.P1)")))
Compilation finished in 148 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9748745718172711155]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((X((LTLAPp1==true)) U ((LTLAPp2==true) U X((LTLAPp3==true))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9748745718172711155]
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( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: X([](((X((LTLAPp1==true)) U ((LTLAPp2==true) U X((LTLAPp3==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.002: "X([](((X((LTLAPp1==true)) U ((LTLAPp2==true) U X((LTLAPp3==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: buchi has 8 states
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.057: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.057: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.057: State length is 17, there are 31 groups
pins2lts-mc-linux64( 0/ 8), 0.057: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.057: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.057: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.057: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.201: ~1 levels ~960 states ~4976 transitions
pins2lts-mc-linux64( 0/ 8), 0.217: ~1 levels ~1920 states ~10856 transitions
pins2lts-mc-linux64( 4/ 8), 0.221: ~1 levels ~3840 states ~24376 transitions
pins2lts-mc-linux64( 4/ 8), 0.223: ~1 levels ~7680 states ~51400 transitions
pins2lts-mc-linux64( 4/ 8), 0.227: ~1 levels ~15360 states ~108880 transitions
pins2lts-mc-linux64( 4/ 8), 0.247: ~1 levels ~30720 states ~223728 transitions
pins2lts-mc-linux64( 7/ 8), 0.284: ~1 levels ~61440 states ~497888 transitions
pins2lts-mc-linux64( 2/ 8), 0.358: ~1 levels ~122880 states ~996000 transitions
pins2lts-mc-linux64( 7/ 8), 0.529: ~1 levels ~245760 states ~2157520 transitions
pins2lts-mc-linux64( 5/ 8), 0.745: ~1 levels ~491520 states ~4295488 transitions
pins2lts-mc-linux64( 5/ 8), 1.466: ~1 levels ~983040 states ~8941536 transitions
pins2lts-mc-linux64( 5/ 8), 2.693: ~1 levels ~1966080 states ~17961584 transitions
pins2lts-mc-linux64( 5/ 8), 5.871: ~1 levels ~3932160 states ~37242576 transitions
pins2lts-mc-linux64( 5/ 8), 11.982: ~1 levels ~7864320 states ~76432344 transitions
pins2lts-mc-linux64( 6/ 8), 25.598: ~1 levels ~15728640 states ~155882520 transitions
pins2lts-mc-linux64( 6/ 8), 51.264: ~1 levels ~31457280 states ~316195888 transitions
pins2lts-mc-linux64( 6/ 8), 113.101: ~1 levels ~62914560 states ~648766720 transitions
pins2lts-mc-linux64( 3/ 8), 254.154: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 254.162:
pins2lts-mc-linux64( 0/ 8), 254.162: mean standard work distribution: 3.4% (states) 3.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 254.162:
pins2lts-mc-linux64( 0/ 8), 254.162: Explored 115117916 states 1267588026 transitions, fanout: 11.011
pins2lts-mc-linux64( 0/ 8), 254.162: Total exploration time 254.100 sec (254.080 sec minimum, 254.090 sec on average)
pins2lts-mc-linux64( 0/ 8), 254.162: States per second: 453042, Transitions per second: 4988540
pins2lts-mc-linux64( 0/ 8), 254.162:
pins2lts-mc-linux64( 0/ 8), 254.162: Progress states detected: 134216017
pins2lts-mc-linux64( 0/ 8), 254.162: Redundant explorations: -14.2294
pins2lts-mc-linux64( 0/ 8), 254.162:
pins2lts-mc-linux64( 0/ 8), 254.162: Queue width: 8B, total height: 40028786, memory: 305.40MB
pins2lts-mc-linux64( 0/ 8), 254.162: Tree memory: 1066.4MB, 8.3 B/state, compr.: 11.9%
pins2lts-mc-linux64( 0/ 8), 254.162: Tree fill ratio (roots/leafs): 99.0%/16.0%
pins2lts-mc-linux64( 0/ 8), 254.162: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 254.162: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 254.162: Est. total memory use: 1371.8MB (~1329.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, X([](((X((LTLAPp1==true)) U ((LTLAPp2==true) U X((LTLAPp3==true))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9748745718172711155]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((X((LTLAPp1==true)) U ((LTLAPp2==true) U X((LTLAPp3==true))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9748745718172711155]
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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
26262 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,262.621,2346536,1,0,10,1.5528e+07,18,0,1840,1.72767e+07,9
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Kanban-PT-00100-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620858976680

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

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