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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 102K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.8K Mar 25 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-00050-00
FORMULA_NAME Kanban-PT-00050-01
FORMULA_NAME Kanban-PT-00050-02
FORMULA_NAME Kanban-PT-00050-03
FORMULA_NAME Kanban-PT-00050-04
FORMULA_NAME Kanban-PT-00050-05
FORMULA_NAME Kanban-PT-00050-06
FORMULA_NAME Kanban-PT-00050-07
FORMULA_NAME Kanban-PT-00050-08
FORMULA_NAME Kanban-PT-00050-09
FORMULA_NAME Kanban-PT-00050-10
FORMULA_NAME Kanban-PT-00050-11
FORMULA_NAME Kanban-PT-00050-12
FORMULA_NAME Kanban-PT-00050-13
FORMULA_NAME Kanban-PT-00050-14
FORMULA_NAME Kanban-PT-00050-15

=== Now, execution of the tool begins

BK_START 1620858365064

Running Version 0
[2021-05-12 22:26:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:26:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:26:07] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-12 22:26:07] [INFO ] Transformed 16 places.
[2021-05-12 22:26:07] [INFO ] Transformed 16 transitions.
[2021-05-12 22:26:07] [INFO ] Parsed PT model containing 16 places and 16 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 22:26:07] [INFO ] Initial state test concluded for 1 properties.
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 8 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:26:07] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-12 22:26:07] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:26:07] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 22:26:07] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:26:07] [INFO ] Computed 5 place invariants in 9 ms
[2021-05-12 22:26:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-12 22:26:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 22:26:07] [INFO ] Flatten gal took : 17 ms
FORMULA Kanban-PT-00050-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00050-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 22:26:07] [INFO ] Flatten gal took : 4 ms
[2021-05-12 22:26:07] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 2703 steps, including 0 resets, run visited all 17 properties in 9 ms. (steps per millisecond=300 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(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.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 14 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-12 22:26:07] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:26:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:26:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-12 22:26:07] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:26:07] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:26:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-12 22:26:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:07] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:26:07] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:26:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00050-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:(OR (GEQ s7 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-00 finished in 278 ms.
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 13 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-12 22:26:07] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:07] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-12 22:26:07] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:07] [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.
[2021-05-12 22:26:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:07] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:07] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00050-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], 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 5612 steps with 0 reset in 34 ms.
FORMULA Kanban-PT-00050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-01 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||G(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.
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
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 10 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-12 22:26:08] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:26:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:26:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-12 22:26:08] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:26:08] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 22:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-12 22:26:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:08] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:26:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-00050-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s3 1), p0:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 28 ms :[true, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
[2021-05-12 22:26:08] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:26:08] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:26:08] [INFO ] Time to serialize gal into /tmp/LTL1161919519861328430.gal : 1 ms
[2021-05-12 22:26:08] [INFO ] Time to serialize properties into /tmp/LTL14373929091869099161.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/LTL1161919519861328430.gal, -t, CGAL, -LTL, /tmp/LTL14373929091869099161.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/LTL1161919519861328430.gal -t CGAL -LTL /tmp/LTL14373929091869099161.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(Pback1<1)")U(("(Pm4>=1)")||(G("(Pback1<1)")))))
Formula 0 simplified : !("(Pback1<1)" U ("(Pm4>=1)" | G"(Pback1<1)"))
Detected timeout of ITS tools.
[2021-05-12 22:26:23] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:26:23] [INFO ] Applying decomposition
[2021-05-12 22:26:23] [INFO ] Flatten gal took : 2 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/graph6487216967397406817.txt, -o, /tmp/graph6487216967397406817.bin, -w, /tmp/graph6487216967397406817.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/graph6487216967397406817.bin, -l, -1, -v, -w, /tmp/graph6487216967397406817.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:26:24] [INFO ] Decomposing Gal with order
[2021-05-12 22:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:26:24] [INFO ] Flatten gal took : 32 ms
[2021-05-12 22:26:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 22:26:24] [INFO ] Time to serialize gal into /tmp/LTL6521708912201538956.gal : 1 ms
[2021-05-12 22:26:24] [INFO ] Time to serialize properties into /tmp/LTL11087312586065386448.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/LTL6521708912201538956.gal, -t, CGAL, -LTL, /tmp/LTL11087312586065386448.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/LTL6521708912201538956.gal -t CGAL -LTL /tmp/LTL11087312586065386448.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("(u2.Pback1<1)")U(("(u1.Pm4>=1)")||(G("(u2.Pback1<1)")))))
Formula 0 simplified : !("(u2.Pback1<1)" U ("(u1.Pm4>=1)" | G"(u2.Pback1<1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
23 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,0.238194,20576,1,0,1199,8695,118,8273,231,40742,875
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Kanban-PT-00050-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Kanban-PT-00050-03 finished in 16251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 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:26:24] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:26:24] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:24] [INFO ] Computed 4 place invariants in 13 ms
[2021-05-12 22:26:24] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:24] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Kanban-PT-00050-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 2 / 14 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
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 14/15 (removed 1) transitions.
[2021-05-12 22:26:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2021-05-12 22:26:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:26:25] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/14 places, 14/15 transitions.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
[2021-05-12 22:26:25] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:26:25] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:26:25] [INFO ] Time to serialize gal into /tmp/LTL2817497522356716113.gal : 1 ms
[2021-05-12 22:26:25] [INFO ] Time to serialize properties into /tmp/LTL4509721702837762271.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/LTL2817497522356716113.gal, -t, CGAL, -LTL, /tmp/LTL4509721702837762271.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/LTL2817497522356716113.gal -t CGAL -LTL /tmp/LTL4509721702837762271.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(Pm4>=1)")||(X(G("((Pm3>=1)&&(Pback2>=1))"))))))
Formula 0 simplified : !X("(Pm4>=1)" | XG"((Pm3>=1)&&(Pback2>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
953 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,9.54015,224412,1,0,6,1.49555e+06,14,0,991,1.65041e+06,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Kanban-PT-00050-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Kanban-PT-00050-05 finished in 10515 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
Graph (trivial) has 11 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
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 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-12 22:26:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:34] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-12 22:26:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-12 22:26:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : Kanban-PT-00050-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}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s4 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 8 ms.
FORMULA Kanban-PT-00050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-06 finished in 104 ms.
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 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 5 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-12 22:26:34] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:26:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:34] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-12 22:26:34] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:26:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-12 22:26:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:34] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:26:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00050-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], 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 0 ms.
FORMULA Kanban-PT-00050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-07 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-12 22:26:35] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-12 22:26:35] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:35] [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.
[2021-05-12 22:26:35] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:35] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00050-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-08 finished in 94 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(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
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:26:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:26:35] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Implicit Places using invariants and state equation in 12 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:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00050-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1) (LT s13 1))], 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 3844 reset in 98 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Kanban-PT-00050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-09 finished in 211 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 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:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:26:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s7 1) (LT s12 1))], 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 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 8 / 14 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 1 ms. Remains 10 /14 variables (removed 4) and now considering 11/15 (removed 4) transitions.
[2021-05-12 22:26:35] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:35] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 22:26:35] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:26:35] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/14 places, 11/15 transitions.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
[2021-05-12 22:26:36] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:26:36] [INFO ] Flatten gal took : 5 ms
[2021-05-12 22:26:36] [INFO ] Time to serialize gal into /tmp/LTL10772837692220089530.gal : 1 ms
[2021-05-12 22:26:36] [INFO ] Time to serialize properties into /tmp/LTL7548410137104987546.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/LTL10772837692220089530.gal, -t, CGAL, -LTL, /tmp/LTL7548410137104987546.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/LTL10772837692220089530.gal -t CGAL -LTL /tmp/LTL7548410137104987546.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((Pout3<1)||(P1<1))||(Pout2<1))"))))
Formula 0 simplified : !XF"(((Pout3<1)||(P1<1))||(Pout2<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
949 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,9.50487,224828,1,0,6,1.49555e+06,20,0,996,1.65041e+06,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Kanban-PT-00050-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Kanban-PT-00050-10 finished in 10597 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 0 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:45] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:26:45] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:26:45] [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-12 22:26:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:45] [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 91 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00050-11 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-11 finished in 137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||X(((F(!p1)&&F(p2)) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:26:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:46] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:26:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:26:46] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:26:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : Kanban-PT-00050-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s10 1), p1:(GEQ s3 1), p2:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 121 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p2) p0)]
Support contains 3 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 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.
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 13 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2021-05-12 22:26:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:26:47] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-12 22:26:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:47] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 14/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
[2021-05-12 22:26:47] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:26:47] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:26:47] [INFO ] Time to serialize gal into /tmp/LTL6918178960611651676.gal : 1 ms
[2021-05-12 22:26:47] [INFO ] Time to serialize properties into /tmp/LTL5606496560720913958.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/LTL6918178960611651676.gal, -t, CGAL, -LTL, /tmp/LTL5606496560720913958.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/LTL6918178960611651676.gal -t CGAL -LTL /tmp/LTL5606496560720913958.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(Pback1>=1)"))||(X(((F("(P4<1)"))&&(F("(Pm3<1)")))U("(P4>=1)")))))
Formula 0 simplified : !(G"(Pback1>=1)" | X((F"(P4<1)" & F"(Pm3<1)") U "(P4>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
933 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,9.33797,226552,1,0,6,1.48962e+06,26,0,1064,1.63928e+06,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Kanban-PT-00050-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Kanban-PT-00050-12 finished in 10631 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F((!p1&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-12 22:26:56] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 22:26:56] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-12 22:26:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:26:56] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 15 cols
[2021-05-12 22:26:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:26:56] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : Kanban-PT-00050-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s6 1) (GEQ s12 1)) (GEQ s1 1)) (GEQ s5 1)), p1:(LT s1 1), p2:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s12 1))], 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 0 reset in 143 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-00050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-13 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(G((p1||F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:26:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:57] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:26:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:57] [INFO ] Implicit Places using invariants and state equation in 19 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:26:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:57] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-00050-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GEQ s11 1), p2:(AND (GEQ s7 1) (GEQ s5 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2499 reset in 112 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA Kanban-PT-00050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-14 finished in 446 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((G(p1)||G(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.
Graph (trivial) has 9 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 11 transition count 12
Applied a total of 3 rules in 2 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-12 22:26:57] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-12 22:26:57] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 22:26:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-12 22:26:57] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-12 22:26:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:26:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-12 22:26:57] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-12 22:26:57] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-12 22:26:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:26:57] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-00050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s0 1) (OR (LT s2 1) (LT s5 1) (LT s9 1))), p1:(OR (LT s2 1) (LT s5 1) (LT s9 1) (LT s2 1) (LT s5 1) (LT s9 1))], 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 5 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00050-15 finished in 160 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620858418573

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-00050"
export BK_EXAMINATION="LTLFireability"
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-00050, examination is LTLFireability"
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-162075407100509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00050.tgz
mv Kanban-PT-00050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;