About the Execution of ITS-Tools for Kanban-PT-10000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.224 | 3600000.00 | 3705967.00 | 35825.20 | FFF?FFTFTTTTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407100564.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-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407100564
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-10000-00
FORMULA_NAME Kanban-PT-10000-01
FORMULA_NAME Kanban-PT-10000-02
FORMULA_NAME Kanban-PT-10000-03
FORMULA_NAME Kanban-PT-10000-04
FORMULA_NAME Kanban-PT-10000-05
FORMULA_NAME Kanban-PT-10000-06
FORMULA_NAME Kanban-PT-10000-07
FORMULA_NAME Kanban-PT-10000-08
FORMULA_NAME Kanban-PT-10000-09
FORMULA_NAME Kanban-PT-10000-10
FORMULA_NAME Kanban-PT-10000-11
FORMULA_NAME Kanban-PT-10000-12
FORMULA_NAME Kanban-PT-10000-13
FORMULA_NAME Kanban-PT-10000-14
FORMULA_NAME Kanban-PT-10000-15
=== Now, execution of the tool begins
BK_START 1620869521092
Running Version 0
[2021-05-13 01:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 01:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 01:32:02] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 01:32:02] [INFO ] Transformed 16 places.
[2021-05-13 01:32:02] [INFO ] Transformed 16 transitions.
[2021-05-13 01:32:02] [INFO ] Parsed PT model containing 16 places and 16 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 01:32:02] [INFO ] Initial state test concluded for 3 properties.
FORMULA Kanban-PT-10000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:32:02] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-13 01:32:02] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:32:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 01:32:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:32:03] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 01:32:03] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-13 01:32:03] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-13 01:32:03] [INFO ] Flatten gal took : 22 ms
FORMULA Kanban-PT-10000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 01:32:03] [INFO ] Flatten gal took : 4 ms
[2021-05-13 01:32:03] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100012 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=1111 ) properties (out of 18) seen :12
Running SMT prover for 6 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 01:32:03] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 01:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-13 01:32:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 01:32:03] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 01:32:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 01:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 01:32:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 01:32:03] [INFO ] Added : 14 causal constraints over 4 iterations in 15 ms. Result :sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 01:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 01:32:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 01:32:03] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 01:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:32:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-13 01:32:03] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 01:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 01:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 01:32:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 01:32:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 01:32:03] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
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 2 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 824 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-13 01:32:04] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 01:32:04] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 01:32:04] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-13 01:32:04] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 01:32:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:04] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-13 01:32:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:32:04] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 01:32:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:04] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-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:(GT s0 s10)], 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-10000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-00 finished in 1097 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((F((p0&&X(G(p1))))&&X((!p0&&X(!p0))))||G((F(p0)&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:32:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:04] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:32:04] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 01:32:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 01:32:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:04] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s13 s1), p1:(LEQ 1 s0)], 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 225 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA Kanban-PT-10000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-01 finished in 420 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&F(p1)))||(p2 U ((p2&&G(!p1))||G(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.
Graph (trivial) has 9 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
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 791 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-13 01:32:06] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 01:32:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-13 01:32:06] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 01:32:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:06] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-13 01:32:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:32:06] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 01:32:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : Kanban-PT-10000-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s6), p0:(LEQ 1 s8), p2:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 21 ms.
FORMULA Kanban-PT-10000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-02 finished in 1048 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(p1 U 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.
Graph (trivial) has 8 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 812 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 01:32:07] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-13 01:32:07] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:07] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 01:32:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-13 01:32:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:32:07] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:07] [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 172 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ 2 s3), p1:(GT s7 s8), p0:(OR (GT s7 s8) (LEQ s4 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 9618 reset in 206 ms.
Product exploration explored 100000 steps with 9483 reset in 169 ms.
Knowledge obtained : [(NOT p2), p1, p0]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 9440 reset in 129 ms.
Product exploration explored 100000 steps with 9389 reset in 121 ms.
[2021-05-13 01:32:08] [INFO ] Flatten gal took : 3 ms
[2021-05-13 01:32:08] [INFO ] Flatten gal took : 5 ms
[2021-05-13 01:32:08] [INFO ] Time to serialize gal into /tmp/LTL6990455342691979212.gal : 1 ms
[2021-05-13 01:32:08] [INFO ] Time to serialize properties into /tmp/LTL4792974039197501582.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/LTL6990455342691979212.gal, -t, CGAL, -LTL, /tmp/LTL4792974039197501582.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/LTL6990455342691979212.gal -t CGAL -LTL /tmp/LTL4792974039197501582.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((P2>Pout2)||(Pm1<=Pout3))"))||(("(P2>Pout2)")U("(Pout4>=2)"))))
Formula 0 simplified : !(G"((P2>Pout2)||(Pm1<=Pout3))" | ("(P2>Pout2)" U "(Pout4>=2)"))
Detected timeout of ITS tools.
[2021-05-13 01:32:23] [INFO ] Flatten gal took : 9 ms
[2021-05-13 01:32:23] [INFO ] Applying decomposition
[2021-05-13 01:32:23] [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/graph4153604417861355726.txt, -o, /tmp/graph4153604417861355726.bin, -w, /tmp/graph4153604417861355726.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/graph4153604417861355726.bin, -l, -1, -v, -w, /tmp/graph4153604417861355726.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 01:32:23] [INFO ] Decomposing Gal with order
[2021-05-13 01:32:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 01:32:23] [INFO ] Flatten gal took : 46 ms
[2021-05-13 01:32:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 01:32:23] [INFO ] Time to serialize gal into /tmp/LTL2203947784755152078.gal : 1 ms
[2021-05-13 01:32:23] [INFO ] Time to serialize properties into /tmp/LTL14767843845682403559.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/LTL2203947784755152078.gal, -t, CGAL, -LTL, /tmp/LTL14767843845682403559.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/LTL2203947784755152078.gal -t CGAL -LTL /tmp/LTL14767843845682403559.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((gu2.P2>gu2.Pout2)||(gu1.Pm1<=gu1.Pout3))"))||(("(gu2.P2>gu2.Pout2)")U("(gu0.Pout4>=2)"))))
Formula 0 simplified : !(G"((gu2.P2>gu2.Pout2)||(gu1.Pm1<=gu1.Pout3))" | ("(gu2.P2>gu2.Pout2)" U "(gu0.Pout4>=2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5903001224164301473
[2021-05-13 01:32:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5903001224164301473
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/ltsmin5903001224164301473]
Compilation finished in 172 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5903001224164301473]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5903001224164301473]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-10000-03 finished in 47152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
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-13 01:32:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:53] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 01:32:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:53] [INFO ] Implicit Places using invariants and state equation in 14 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-13 01:32:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Kanban-PT-10000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s11), p0:(LEQ s0 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1054 steps with 189 reset in 2 ms.
FORMULA Kanban-PT-10000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-04 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 10 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
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 796 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-13 01:32:54] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 01:32:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:54] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-13 01:32:54] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 01:32:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:54] [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.
[2021-05-13 01:32:54] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 01:32:54] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 01:32:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:54] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-05 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:(LEQ s3 s7)], 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 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-05 finished in 899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&G((G(p1) U 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 7 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
Applied a total of 1 rules in 1 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
[2021-05-13 01:32:54] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-13 01:32:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:54] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-13 01:32:54] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-13 01:32:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:54] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-13 01:32:54] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:32:54] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-13 01:32:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/16 places, 14/16 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-07 automaton TGBA [mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s5 s8), p1:(LEQ s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 248 ms.
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-07 finished in 431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((p1||F(p2))))))], 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 10 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 780 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 01:32:55] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-13 01:32:55] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-13 01:32:55] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:32:55] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Kanban-PT-10000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s2 s7), p2:(GT s4 s0), p0:(GT 2 s0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 3 reset in 0 ms.
FORMULA Kanban-PT-10000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-14 finished in 935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(!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.
Graph (trivial) has 10 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 752 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 01:32:56] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-13 01:32:56] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 01:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 01:32:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-13 01:32:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 01:32:56] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 01:32:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 01:32:56] [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 51 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-10000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-15 finished in 878 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-13 01:32:56] [INFO ] Applying decomposition
[2021-05-13 01:32:56] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin735793353428927431
[2021-05-13 01:32:56] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2021-05-13 01:32:56] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 01:32:56] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2021-05-13 01:32:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 01:32:56] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2021-05-13 01:32:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 01:32:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin735793353428927431
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/ltsmin735793353428927431]
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/graph8625100996594449729.txt, -o, /tmp/graph8625100996594449729.bin, -w, /tmp/graph8625100996594449729.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/graph8625100996594449729.bin, -l, -1, -v, -w, /tmp/graph8625100996594449729.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 01:32:56] [INFO ] Decomposing Gal with order
[2021-05-13 01:32:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 01:32:56] [INFO ] Flatten gal took : 2 ms
[2021-05-13 01:32:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 01:32:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality3067177500456532690.gal : 0 ms
[2021-05-13 01:32:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality1367730532226762230.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/LTLCardinality3067177500456532690.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1367730532226762230.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/LTLCardinality3067177500456532690.gal -t CGAL -LTL /tmp/LTLCardinality1367730532226762230.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((gu4.P2>gu4.Pout2)||(gu1.Pm1<=gu1.Pout3))"))||(("(gu4.P2>gu4.Pout2)")U("(gi1.gi1.gu2.Pout4>=2)"))))
Formula 0 simplified : !(G"((gu4.P2>gu4.Pout2)||(gu1.Pm1<=gu1.Pout3))" | ("(gu4.P2>gu4.Pout2)" U "(gi1.gi1.gu2.Pout4>=2)"))
Compilation finished in 168 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin735793353428927431]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin735793353428927431]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: ([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: "([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 19, guards 16
pins2lts-mc-linux64( 6/ 8), 0.003: 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( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: 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( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.010: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.014: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.014: State length is 17, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.014: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.014: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.014: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.014: Visible groups: 8 / 25, labels: 3 / 21
pins2lts-mc-linux64( 0/ 8), 0.014: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.014: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.132: [Blue] ~120 levels ~960 states ~5696 transitions
pins2lts-mc-linux64( 7/ 8), 0.144: [Blue] ~240 levels ~1920 states ~9344 transitions
pins2lts-mc-linux64( 7/ 8), 0.145: [Blue] ~480 levels ~3840 states ~18064 transitions
pins2lts-mc-linux64( 7/ 8), 0.147: [Blue] ~960 levels ~7680 states ~33424 transitions
pins2lts-mc-linux64( 0/ 8), 0.159: [Blue] ~1920 levels ~15360 states ~118816 transitions
pins2lts-mc-linux64( 3/ 8), 0.174: [Blue] ~3840 levels ~30720 states ~125136 transitions
pins2lts-mc-linux64( 3/ 8), 0.218: [Blue] ~7679 levels ~61440 states ~267896 transitions
pins2lts-mc-linux64( 2/ 8), 0.292: [Blue] ~13485 levels ~122880 states ~501480 transitions
pins2lts-mc-linux64( 2/ 8), 0.399: [Blue] ~21165 levels ~245760 states ~747240 transitions
pins2lts-mc-linux64( 4/ 8), 0.774: [Blue] ~61368 levels ~491520 states ~2450448 transitions
pins2lts-mc-linux64( 4/ 8), 1.476: [Blue] ~122735 levels ~983040 states ~4902792 transitions
pins2lts-mc-linux64( 4/ 8), 2.969: [Blue] ~245512 levels ~1966080 states ~9810576 transitions
pins2lts-mc-linux64( 4/ 8), 5.999: [Blue] ~491127 levels ~3932160 states ~19630536 transitions
pins2lts-mc-linux64( 4/ 8), 12.865: [Blue] ~982441 levels ~7864320 states ~39276520 transitions
pins2lts-mc-linux64( 4/ 8), 22.717: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 22.758:
pins2lts-mc-linux64( 0/ 8), 22.758: Explored 10156485 states 64730096 transitions, fanout: 6.373
pins2lts-mc-linux64( 0/ 8), 22.758: Total exploration time 22.740 sec (22.680 sec minimum, 22.701 sec on average)
pins2lts-mc-linux64( 0/ 8), 22.758: States per second: 446635, Transitions per second: 2846530
pins2lts-mc-linux64( 0/ 8), 22.758:
pins2lts-mc-linux64( 0/ 8), 22.758: State space has 35973885 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 22.758: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 22.758: blue states: 10156485 (28.23%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 22.758: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 22.758: all-red states: 332766 (0.93%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 22.758:
pins2lts-mc-linux64( 0/ 8), 22.758: Total memory used for local state coloring: 147.4MB
pins2lts-mc-linux64( 0/ 8), 22.758:
pins2lts-mc-linux64( 0/ 8), 22.758: Queue width: 8B, total height: 9657625, memory: 73.68MB
pins2lts-mc-linux64( 0/ 8), 22.758: Tree memory: 530.5MB, 15.5 B/state, compr.: 22.1%
pins2lts-mc-linux64( 0/ 8), 22.758: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 22.758: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 22.758: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 22.758: Est. total memory use: 604.1MB (~1097.7MB 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, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin735793353428927431]
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, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin735793353428927431]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 01:53:16] [INFO ] Flatten gal took : 102 ms
[2021-05-13 01:53:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality4915234209296173540.gal : 29 ms
[2021-05-13 01:53:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality4816073408192179708.ltl : 6 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/LTLCardinality4915234209296173540.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4816073408192179708.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/LTLCardinality4915234209296173540.gal -t CGAL -LTL /tmp/LTLCardinality4816073408192179708.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((P2>Pout2)||(Pm1<=Pout3))"))||(("(P2>Pout2)")U("(Pout4>=2)"))))
Formula 0 simplified : !(G"((P2>Pout2)||(Pm1<=Pout3))" | ("(P2>Pout2)" U "(Pout4>=2)"))
Detected timeout of ITS tools.
[2021-05-13 02:13:34] [INFO ] Flatten gal took : 58 ms
[2021-05-13 02:13:35] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-13 02:13:35] [INFO ] Transformed 16 places.
[2021-05-13 02:13:35] [INFO ] Transformed 16 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 02:13:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality10362846060156025495.gal : 2 ms
[2021-05-13 02:13:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality11535812186871910178.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10362846060156025495.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11535812186871910178.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10362846060156025495.gal -t CGAL -LTL /tmp/LTLCardinality11535812186871910178.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((P2>Pout2)||(Pm1<=Pout3))"))||(("(P2>Pout2)")U("(Pout4>=2)"))))
Formula 0 simplified : !(G"((P2>Pout2)||(Pm1<=Pout3))" | ("(P2>Pout2)" U "(Pout4>=2)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-10000"
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-10000, 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-162075407100564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-10000.tgz
mv Kanban-PT-10000 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 '
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 ;