About the Execution of ITS-Tools for Kanban-PT-01000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.571 | 3600000.00 | 4758981.00 | 135622.70 | FTF?FTFFFFFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413000291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Kanban-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413000291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 11:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 11:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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-01000-LTLCardinality-00
FORMULA_NAME Kanban-PT-01000-LTLCardinality-01
FORMULA_NAME Kanban-PT-01000-LTLCardinality-02
FORMULA_NAME Kanban-PT-01000-LTLCardinality-03
FORMULA_NAME Kanban-PT-01000-LTLCardinality-04
FORMULA_NAME Kanban-PT-01000-LTLCardinality-05
FORMULA_NAME Kanban-PT-01000-LTLCardinality-06
FORMULA_NAME Kanban-PT-01000-LTLCardinality-07
FORMULA_NAME Kanban-PT-01000-LTLCardinality-08
FORMULA_NAME Kanban-PT-01000-LTLCardinality-09
FORMULA_NAME Kanban-PT-01000-LTLCardinality-10
FORMULA_NAME Kanban-PT-01000-LTLCardinality-11
FORMULA_NAME Kanban-PT-01000-LTLCardinality-12
FORMULA_NAME Kanban-PT-01000-LTLCardinality-13
FORMULA_NAME Kanban-PT-01000-LTLCardinality-14
FORMULA_NAME Kanban-PT-01000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679462561857
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-01000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 05:22:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 05:22:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:22:43] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 05:22:43] [INFO ] Transformed 16 places.
[2023-03-22 05:22:43] [INFO ] Transformed 16 transitions.
[2023-03-22 05:22:43] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-01000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 9 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 05:22:43] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-22 05:22:43] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 05:22:43] [INFO ] Invariant cache hit.
[2023-03-22 05:22:43] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-22 05:22:43] [INFO ] Invariant cache hit.
[2023-03-22 05:22:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 15 out of 16 places after structural reductions.
[2023-03-22 05:22:44] [INFO ] Flatten gal took : 23 ms
[2023-03-22 05:22:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 05:22:44] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 31) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 05:22:44] [INFO ] Invariant cache hit.
[2023-03-22 05:22:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 05:22:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 05:22:44] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 05:22:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 05:22:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 05:22:44] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 05:22:44] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 05:22:44] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 5140 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=342 )
Parikh walk visited 5 properties in 235 ms.
FORMULA Kanban-PT-01000-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U p1))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 05:22:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:22:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 05:22:45] [INFO ] Invariant cache hit.
[2023-03-22 05:22:45] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-22 05:22:45] [INFO ] Invariant cache hit.
[2023-03-22 05:22:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 3 s9), p0:(GT s10 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA Kanban-PT-01000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-00 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 05:22:45] [INFO ] Invariant cache hit.
[2023-03-22 05:22:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 05:22:45] [INFO ] Invariant cache hit.
[2023-03-22 05:22:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 05:22:45] [INFO ] Invariant cache hit.
[2023-03-22 05:22:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s13 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-01000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-01000-LTLCardinality-01 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(G(p1)))))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 05:22:46] [INFO ] Invariant cache hit.
[2023-03-22 05:22:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 05:22:46] [INFO ] Invariant cache hit.
[2023-03-22 05:22:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 05:22:46] [INFO ] Invariant cache hit.
[2023-03-22 05:22:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(OR (LEQ 3 s1) (LEQ s13 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Kanban-PT-01000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-02 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1)))||G(F(p2)))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 05:22:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:22:46] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 05:22:46] [INFO ] Invariant cache hit.
[2023-03-22 05:22:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-22 05:22:46] [INFO ] Invariant cache hit.
[2023-03-22 05:22:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s0 s5), p2:(LEQ s6 s9), p1:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2380 reset in 109 ms.
Product exploration explored 100000 steps with 2479 reset in 246 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Finished random walk after 6008 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=1502 )
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 05:22:48] [INFO ] Invariant cache hit.
[2023-03-22 05:22:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 05:22:48] [INFO ] Invariant cache hit.
[2023-03-22 05:22:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 05:22:48] [INFO ] Invariant cache hit.
[2023-03-22 05:22:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 15/15 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:22:49] [INFO ] Invariant cache hit.
[2023-03-22 05:22:49] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:22:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 05:22:49] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:22:49] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 05:22:49] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7169 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=651 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2658 reset in 106 ms.
Product exploration explored 100000 steps with 2798 reset in 110 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 5 edges and 15 vertex of which 4 / 15 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.
Applied a total of 1 rules in 8 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2023-03-22 05:22:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:22:50] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2023-03-22 05:22:50] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:22:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/15 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 13/15 places, 14/16 transitions.
Built C files in :
/tmp/ltsmin13419080228772930049
[2023-03-22 05:22:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13419080228772930049
Running compilation step : cd /tmp/ltsmin13419080228772930049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin13419080228772930049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13419080228772930049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7840244628610691856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 05:23:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:23:06] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-22 05:23:06] [INFO ] Invariant cache hit.
[2023-03-22 05:23:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-22 05:23:06] [INFO ] Invariant cache hit.
[2023-03-22 05:23:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 15/15 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin2917471006823495708
[2023-03-22 05:23:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2917471006823495708
Running compilation step : cd /tmp/ltsmin2917471006823495708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin2917471006823495708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2917471006823495708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18107595226177561997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 05:23:21] [INFO ] Flatten gal took : 3 ms
[2023-03-22 05:23:21] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:23:21] [INFO ] Time to serialize gal into /tmp/LTL6714759417627669287.gal : 1 ms
[2023-03-22 05:23:21] [INFO ] Time to serialize properties into /tmp/LTL177753278524191317.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6714759417627669287.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4500464268341877441.hoa' '-atoms' '/tmp/LTL177753278524191317.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL177753278524191317.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4500464268341877441.hoa
Detected timeout of ITS tools.
[2023-03-22 05:23:36] [INFO ] Flatten gal took : 3 ms
[2023-03-22 05:23:36] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:23:36] [INFO ] Time to serialize gal into /tmp/LTL12588927702653920289.gal : 1 ms
[2023-03-22 05:23:36] [INFO ] Time to serialize properties into /tmp/LTL1724933082409051579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12588927702653920289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1724933082409051579.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(("(Pm3<=Pback4)")||(X("(P4>=1)"))))||(G(F("(Pout4<=Pout1)"))))))
Formula 0 simplified : X(F(!"(Pm3<=Pback4)" & X!"(P4>=1)") & FG!"(Pout4<=Pout1)")
Detected timeout of ITS tools.
[2023-03-22 05:23:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 05:23:51] [INFO ] Applying decomposition
[2023-03-22 05:23:51] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15662141728471008947.txt' '-o' '/tmp/graph15662141728471008947.bin' '-w' '/tmp/graph15662141728471008947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15662141728471008947.bin' '-l' '-1' '-v' '-w' '/tmp/graph15662141728471008947.weights' '-q' '0' '-e' '0.001'
[2023-03-22 05:23:51] [INFO ] Decomposing Gal with order
[2023-03-22 05:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 05:23:51] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-22 05:23:51] [INFO ] Flatten gal took : 25 ms
[2023-03-22 05:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-22 05:23:51] [INFO ] Time to serialize gal into /tmp/LTL14870785769579909544.gal : 1 ms
[2023-03-22 05:23:51] [INFO ] Time to serialize properties into /tmp/LTL18330395178785684295.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14870785769579909544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18330395178785684295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(("(gu1.Pm3<=gu1.Pback4)")||(X("(gi2.gu0.P4>=1)"))))||(G(F("(gu2.Pout4<=gu2.Pout1)"))))))
Formula 0 simplified : X(F(!"(gu1.Pm3<=gu1.Pback4)" & X!"(gi2.gu0.P4>=1)") & FG!"(gu2.Pout4<=gu2.Pout1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3256344240487276744
[2023-03-22 05:24:06] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3256344240487276744
Running compilation step : cd /tmp/ltsmin3256344240487276744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin3256344240487276744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3256344240487276744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-01000-LTLCardinality-03 finished in 94946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 05:24:21] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:24:21] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 05:24:21] [INFO ] Invariant cache hit.
[2023-03-22 05:24:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-22 05:24:21] [INFO ] Invariant cache hit.
[2023-03-22 05:24:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 1 s1) (LEQ s7 s11)), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1223 reset in 111 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Kanban-PT-01000-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-04 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((!(p0 U p1)&&p2)))||G(p0)))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 05:24:21] [INFO ] Invariant cache hit.
[2023-03-22 05:24:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 05:24:21] [INFO ] Invariant cache hit.
[2023-03-22 05:24:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 05:24:21] [INFO ] Invariant cache hit.
[2023-03-22 05:24:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), p1, (AND (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s7 s5), p2:(GT 2 s5), p1:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (OR (NOT p2) p1))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 (NOT p1))
Knowledge based reduction with 9 factoid took 426 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-01000-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-01000-LTLCardinality-05 finished in 898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 7 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 05:24:22] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 05:24:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:24:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 05:24:22] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:22] [INFO ] Invariant cache hit.
[2023-03-22 05:24:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:24:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 05:24:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:24:22] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:22] [INFO ] Invariant cache hit.
[2023-03-22 05:24:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s5 s4) (GT s7 s0)), p0:(GT s7 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-01000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-06 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 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
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
Applied a total of 3 rules in 4 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 05:24:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 05:24:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:24:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:24:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:23] [INFO ] Invariant cache hit.
[2023-03-22 05:24:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:24:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 05:24:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:24:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:23] [INFO ] Invariant cache hit.
[2023-03-22 05:24:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LEQ 3 s3) (LEQ 1 s2)), p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10827 reset in 122 ms.
Product exploration explored 100000 steps with 10759 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2002 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=667 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 05:24:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:23] [INFO ] Invariant cache hit.
[2023-03-22 05:24:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 05:24:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:23] [INFO ] Invariant cache hit.
[2023-03-22 05:24:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:24:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 05:24:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:24:23] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 05:24:23] [INFO ] Invariant cache hit.
[2023-03-22 05:24:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 12/12 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2002 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2002 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10673 reset in 87 ms.
Product exploration explored 100000 steps with 10753 reset in 87 ms.
Built C files in :
/tmp/ltsmin9660103817175452684
[2023-03-22 05:24:24] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2023-03-22 05:24:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 05:24:24] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2023-03-22 05:24:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 05:24:24] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2023-03-22 05:24:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 05:24:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9660103817175452684
Running compilation step : cd /tmp/ltsmin9660103817175452684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin9660103817175452684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9660103817175452684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15965357418534588397.hoa' '--buchi-type=spotba'
LTSmin run took 411 ms.
FORMULA Kanban-PT-01000-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-01000-LTLCardinality-07 finished in 2198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 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 24 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 05:24:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 05:24:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:24:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 05:24:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 05:24:25] [INFO ] Invariant cache hit.
[2023-03-22 05:24:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:24:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 05:24:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:24:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 05:24:25] [INFO ] Invariant cache hit.
[2023-03-22 05:24:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s10 s3), p1:(GT 2 s7)], nbAcceptance=1, 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 56 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-01000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-08 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
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 4 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 05:24:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 05:24:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:24:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 05:24:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 05:24:25] [INFO ] Invariant cache hit.
[2023-03-22 05:24:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:24:25] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-22 05:24:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:24:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 05:24:25] [INFO ] Invariant cache hit.
[2023-03-22 05:24:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 3 s4) (GT s3 s5))], 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 89 steps with 0 reset in 2 ms.
FORMULA Kanban-PT-01000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-10 finished in 149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p1)&&X(p2))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 05:24:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:24:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:24:25] [INFO ] Invariant cache hit.
[2023-03-22 05:24:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 05:24:25] [INFO ] Invariant cache hit.
[2023-03-22 05:24:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s8 s2), p0:(GT 2 s14), p2:(GT s11 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Kanban-PT-01000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-12 finished in 477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&p1))||X((F(p0)&&!p1))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 05:24:26] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:24:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 05:24:26] [INFO ] Invariant cache hit.
[2023-03-22 05:24:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 05:24:26] [INFO ] Invariant cache hit.
[2023-03-22 05:24:26] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (OR (NOT p0) p1), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(LEQ 3 s6), p1:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-01000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-13 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 05:24:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:24:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 05:24:26] [INFO ] Invariant cache hit.
[2023-03-22 05:24:26] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 05:24:26] [INFO ] Invariant cache hit.
[2023-03-22 05:24:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 34301 steps, run visited all 1 properties in 59 ms. (steps per millisecond=581 )
Probabilistic random walk after 34301 steps, saw 25498 distinct states, run finished after 59 ms. (steps per millisecond=581 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 05:24:27] [INFO ] Invariant cache hit.
[2023-03-22 05:24:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 05:24:27] [INFO ] Invariant cache hit.
[2023-03-22 05:24:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 05:24:27] [INFO ] Invariant cache hit.
[2023-03-22 05:24:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 14/14 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 3003 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1501 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 134 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 13 edges and 14 vertex of which 8 / 14 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 11/15 (removed 4) transitions.
[2023-03-22 05:24:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:24:28] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2023-03-22 05:24:28] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:24:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/14 places, 11/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 10/14 places, 11/15 transitions.
Built C files in :
/tmp/ltsmin8471528234827772397
[2023-03-22 05:24:28] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8471528234827772397
Running compilation step : cd /tmp/ltsmin8471528234827772397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 63 ms.
Running link step : cd /tmp/ltsmin8471528234827772397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8471528234827772397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9323429287308056424.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 05:24:43] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-22 05:24:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 05:24:43] [INFO ] Invariant cache hit.
[2023-03-22 05:24:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-22 05:24:43] [INFO ] Invariant cache hit.
[2023-03-22 05:24:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 14/14 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin9320805792531626398
[2023-03-22 05:24:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9320805792531626398
Running compilation step : cd /tmp/ltsmin9320805792531626398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin9320805792531626398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9320805792531626398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7219836630895680354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 05:24:58] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:24:59] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:24:59] [INFO ] Time to serialize gal into /tmp/LTL5016013640850821365.gal : 1 ms
[2023-03-22 05:24:59] [INFO ] Time to serialize properties into /tmp/LTL9725902012493937958.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5016013640850821365.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6702663064594792674.hoa' '-atoms' '/tmp/LTL9725902012493937958.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9725902012493937958.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6702663064594792674.hoa
Detected timeout of ITS tools.
[2023-03-22 05:25:14] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:25:14] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:25:14] [INFO ] Time to serialize gal into /tmp/LTL15949911430056111193.gal : 1 ms
[2023-03-22 05:25:14] [INFO ] Time to serialize properties into /tmp/LTL8524613331387503639.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15949911430056111193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8524613331387503639.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(P3>=2)"))))
Formula 0 simplified : XF!"(P3>=2)"
Detected timeout of ITS tools.
[2023-03-22 05:25:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:25:29] [INFO ] Applying decomposition
[2023-03-22 05:25:29] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph118089968629761872.txt' '-o' '/tmp/graph118089968629761872.bin' '-w' '/tmp/graph118089968629761872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph118089968629761872.bin' '-l' '-1' '-v' '-w' '/tmp/graph118089968629761872.weights' '-q' '0' '-e' '0.001'
[2023-03-22 05:25:29] [INFO ] Decomposing Gal with order
[2023-03-22 05:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 05:25:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-22 05:25:29] [INFO ] Time to serialize gal into /tmp/LTL8145693107965947641.gal : 1 ms
[2023-03-22 05:25:29] [INFO ] Time to serialize properties into /tmp/LTL8320957128575013551.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8145693107965947641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8320957128575013551.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(u0.P3>=2)"))))
Formula 0 simplified : XF!"(u0.P3>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4262778044895939448
[2023-03-22 05:25:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4262778044895939448
Running compilation step : cd /tmp/ltsmin4262778044895939448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin4262778044895939448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4262778044895939448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-01000-LTLCardinality-14 finished in 92871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||X((p1&&G(p2))))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 05:25:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:25:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 05:25:59] [INFO ] Invariant cache hit.
[2023-03-22 05:25:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 05:25:59] [INFO ] Invariant cache hit.
[2023-03-22 05:25:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s3), p2:(GT s6 s11), p1:(LEQ 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-01000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-01000-LTLCardinality-15 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1)))||G(F(p2)))))'
Found a Lengthening insensitive property : Kanban-PT-01000-LTLCardinality-03
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 5 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 2 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
[2023-03-22 05:25:59] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2023-03-22 05:25:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:25:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:25:59] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:25:59] [INFO ] Invariant cache hit.
[2023-03-22 05:25:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:25:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 05:25:59] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:25:59] [INFO ] Invariant cache hit.
[2023-03-22 05:25:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/16 places, 14/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 74 ms. Remains : 13/16 places, 14/16 transitions.
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s0 s5), p2:(LEQ s6 s8), p1:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2719 reset in 93 ms.
Product exploration explored 100000 steps with 3066 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Finished random walk after 6008 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=3004 )
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 360 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-22 05:26:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:01] [INFO ] Invariant cache hit.
[2023-03-22 05:26:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 05:26:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:01] [INFO ] Invariant cache hit.
[2023-03-22 05:26:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:26:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 05:26:01] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:01] [INFO ] Invariant cache hit.
[2023-03-22 05:26:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 13/13 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Finished random walk after 6010 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=1502 )
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3014 reset in 139 ms.
Product exploration explored 100000 steps with 2545 reset in 112 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-22 05:26:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:26:03] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:03] [INFO ] Invariant cache hit.
[2023-03-22 05:26:03] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32 ms. Remains : 13/13 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin12583619693681327244
[2023-03-22 05:26:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12583619693681327244
Running compilation step : cd /tmp/ltsmin12583619693681327244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 66 ms.
Running link step : cd /tmp/ltsmin12583619693681327244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12583619693681327244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2805022299918307082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-22 05:26:18] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:18] [INFO ] Invariant cache hit.
[2023-03-22 05:26:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 05:26:18] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:18] [INFO ] Invariant cache hit.
[2023-03-22 05:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:26:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 05:26:18] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 05:26:18] [INFO ] Invariant cache hit.
[2023-03-22 05:26:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 13/13 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin5397153818571157809
[2023-03-22 05:26:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5397153818571157809
Running compilation step : cd /tmp/ltsmin5397153818571157809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin5397153818571157809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5397153818571157809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2730698211922518800.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 05:26:33] [INFO ] Flatten gal took : 3 ms
[2023-03-22 05:26:33] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:26:33] [INFO ] Time to serialize gal into /tmp/LTL3583298126975161349.gal : 1 ms
[2023-03-22 05:26:33] [INFO ] Time to serialize properties into /tmp/LTL16819187172673614852.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3583298126975161349.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1561578239693752689.hoa' '-atoms' '/tmp/LTL16819187172673614852.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16819187172673614852.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1561578239693752689.hoa
Detected timeout of ITS tools.
[2023-03-22 05:26:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:26:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:26:48] [INFO ] Time to serialize gal into /tmp/LTL6921361928543770733.gal : 1 ms
[2023-03-22 05:26:48] [INFO ] Time to serialize properties into /tmp/LTL8822777753527779537.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6921361928543770733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8822777753527779537.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(("(Pm3<=Pback4)")||(X("(P4>=1)"))))||(G(F("(Pout4<=Pout1)"))))))
Formula 0 simplified : X(F(!"(Pm3<=Pback4)" & X!"(P4>=1)") & FG!"(Pout4<=Pout1)")
Detected timeout of ITS tools.
[2023-03-22 05:27:03] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:27:03] [INFO ] Applying decomposition
[2023-03-22 05:27:03] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7525572311908249810.txt' '-o' '/tmp/graph7525572311908249810.bin' '-w' '/tmp/graph7525572311908249810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7525572311908249810.bin' '-l' '-1' '-v' '-w' '/tmp/graph7525572311908249810.weights' '-q' '0' '-e' '0.001'
[2023-03-22 05:27:03] [INFO ] Decomposing Gal with order
[2023-03-22 05:27:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 05:27:03] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-22 05:27:03] [INFO ] Time to serialize gal into /tmp/LTL3896002755242032926.gal : 1 ms
[2023-03-22 05:27:03] [INFO ] Time to serialize properties into /tmp/LTL9551196369595151460.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3896002755242032926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9551196369595151460.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(("(gu0.Pm3<=gu0.Pback4)")||(X("(gu0.P4>=1)"))))||(G(F("(gu1.Pout4<=gu1.Pout1)"))))))
Formula 0 simplified : X(F(!"(gu0.Pm3<=gu0.Pback4)" & X!"(gu0.P4>=1)") & FG!"(gu1.Pout4<=gu1.Pout1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin903841465092589684
[2023-03-22 05:27:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin903841465092589684
Running compilation step : cd /tmp/ltsmin903841465092589684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin903841465092589684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin903841465092589684;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-01000-LTLCardinality-03 finished in 94381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : Kanban-PT-01000-LTLCardinality-14
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 14 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Applied a total of 5 rules in 17 ms. Remains 9 /16 variables (removed 7) and now considering 10/16 (removed 6) transitions.
[2023-03-22 05:27:34] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2023-03-22 05:27:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:27:34] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 05:27:34] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:34] [INFO ] Invariant cache hit.
[2023-03-22 05:27:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 05:27:34] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:34] [INFO ] Invariant cache hit.
[2023-03-22 05:27:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/16 places, 10/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 91 ms. Remains : 9/16 places, 10/16 transitions.
Running random walk in product with property : Kanban-PT-01000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 2002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1001 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-22 05:27:34] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:34] [INFO ] Invariant cache hit.
[2023-03-22 05:27:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 05:27:34] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:34] [INFO ] Invariant cache hit.
[2023-03-22 05:27:34] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 05:27:34] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:34] [INFO ] Invariant cache hit.
[2023-03-22 05:27:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 9/9 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 2002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1001 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-22 05:27:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:27:36] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:36] [INFO ] Invariant cache hit.
[2023-03-22 05:27:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 9/9 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin13565959102923434436
[2023-03-22 05:27:36] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13565959102923434436
Running compilation step : cd /tmp/ltsmin13565959102923434436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin13565959102923434436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13565959102923434436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10097888889420503330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-22 05:27:51] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:51] [INFO ] Invariant cache hit.
[2023-03-22 05:27:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 05:27:51] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:51] [INFO ] Invariant cache hit.
[2023-03-22 05:27:51] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 05:27:51] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 05:27:51] [INFO ] Invariant cache hit.
[2023-03-22 05:27:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 9/9 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin5821195382997241852
[2023-03-22 05:27:51] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5821195382997241852
Running compilation step : cd /tmp/ltsmin5821195382997241852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin5821195382997241852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5821195382997241852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13086600294161097625.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 05:28:06] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:28:06] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:28:06] [INFO ] Time to serialize gal into /tmp/LTL7033720244116535939.gal : 1 ms
[2023-03-22 05:28:06] [INFO ] Time to serialize properties into /tmp/LTL1626146725872734397.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7033720244116535939.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4775871430913509315.hoa' '-atoms' '/tmp/LTL1626146725872734397.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1626146725872734397.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4775871430913509315.hoa
Detected timeout of ITS tools.
[2023-03-22 05:28:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:28:21] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:28:21] [INFO ] Time to serialize gal into /tmp/LTL17778395247762086321.gal : 1 ms
[2023-03-22 05:28:21] [INFO ] Time to serialize properties into /tmp/LTL10727414240230129886.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17778395247762086321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10727414240230129886.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("(P3>=2)"))))
Formula 0 simplified : XF!"(P3>=2)"
Detected timeout of ITS tools.
[2023-03-22 05:28:36] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:28:36] [INFO ] Applying decomposition
[2023-03-22 05:28:36] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3250940457848572996.txt' '-o' '/tmp/graph3250940457848572996.bin' '-w' '/tmp/graph3250940457848572996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3250940457848572996.bin' '-l' '-1' '-v' '-w' '/tmp/graph3250940457848572996.weights' '-q' '0' '-e' '0.001'
[2023-03-22 05:28:36] [INFO ] Decomposing Gal with order
[2023-03-22 05:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 05:28:36] [INFO ] Flatten gal took : 1 ms
[2023-03-22 05:28:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-22 05:28:36] [INFO ] Time to serialize gal into /tmp/LTL15794691389069745638.gal : 0 ms
[2023-03-22 05:28:36] [INFO ] Time to serialize properties into /tmp/LTL4358124159204829530.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15794691389069745638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4358124159204829530.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(u0.P3>=2)"))))
Formula 0 simplified : XF!"(u0.P3>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2045439781908830546
[2023-03-22 05:28:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2045439781908830546
Running compilation step : cd /tmp/ltsmin2045439781908830546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin2045439781908830546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2045439781908830546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-01000-LTLCardinality-14 finished in 92754 ms.
[2023-03-22 05:29:06] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17003412584359693679
[2023-03-22 05:29:06] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2023-03-22 05:29:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 05:29:06] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2023-03-22 05:29:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 05:29:06] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2023-03-22 05:29:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 05:29:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17003412584359693679
Running compilation step : cd /tmp/ltsmin17003412584359693679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-22 05:29:06] [INFO ] Applying decomposition
[2023-03-22 05:29:06] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4428928321432730755.txt' '-o' '/tmp/graph4428928321432730755.bin' '-w' '/tmp/graph4428928321432730755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4428928321432730755.bin' '-l' '-1' '-v' '-w' '/tmp/graph4428928321432730755.weights' '-q' '0' '-e' '0.001'
[2023-03-22 05:29:06] [INFO ] Decomposing Gal with order
[2023-03-22 05:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 05:29:06] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-22 05:29:06] [INFO ] Flatten gal took : 2 ms
[2023-03-22 05:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-22 05:29:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality9821814061102388552.gal : 0 ms
[2023-03-22 05:29:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality13566595581939419384.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9821814061102388552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13566595581939419384.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X((G(("(gu0.Pm3<=gu0.Pback4)")||(X("(gi2.gu1.P4>=1)"))))||(G(F("(gu2.Pout4<=gu2.Pout1)"))))))
Formula 0 simplified : X(F(!"(gu0.Pm3<=gu0.Pback4)" & X!"(gi2.gu1.P4>=1)") & FG!"(gu2.Pout4<=gu2.Pout1)")
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin17003412584359693679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin17003412584359693679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: LTL layer: formula: X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))
pins2lts-mc-linux64( 0/ 8), 0.004: "X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed 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( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.018: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.102: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.102: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.102: State length is 17, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.102: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.102: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.102: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.102: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.106: ~1 levels ~960 states ~3192 transitions
pins2lts-mc-linux64( 1/ 8), 0.111: ~1 levels ~1920 states ~7320 transitions
pins2lts-mc-linux64( 1/ 8), 0.510: ~1 levels ~3840 states ~16296 transitions
pins2lts-mc-linux64( 1/ 8), 0.551: ~1 levels ~7680 states ~32776 transitions
pins2lts-mc-linux64( 1/ 8), 0.661: ~1 levels ~15360 states ~72496 transitions
pins2lts-mc-linux64( 4/ 8), 0.912: ~1 levels ~30720 states ~176192 transitions
pins2lts-mc-linux64( 4/ 8), 1.285: ~1 levels ~61440 states ~381472 transitions
pins2lts-mc-linux64( 4/ 8), 2.106: ~1 levels ~122880 states ~811040 transitions
pins2lts-mc-linux64( 4/ 8), 4.125: ~1 levels ~245760 states ~1699480 transitions
pins2lts-mc-linux64( 4/ 8), 6.845: ~1 levels ~491520 states ~3671968 transitions
pins2lts-mc-linux64( 4/ 8), 9.448: ~1 levels ~983040 states ~7705648 transitions
pins2lts-mc-linux64( 4/ 8), 15.126: ~1 levels ~1966080 states ~16202648 transitions
pins2lts-mc-linux64( 4/ 8), 19.466: ~1 levels ~3932160 states ~33796728 transitions
pins2lts-mc-linux64( 1/ 8), 26.883: ~1 levels ~7864320 states ~65250064 transitions
pins2lts-mc-linux64( 1/ 8), 42.306: ~1 levels ~15728640 states ~134417992 transitions
pins2lts-mc-linux64( 1/ 8), 72.161: ~1 levels ~31457280 states ~280666800 transitions
pins2lts-mc-linux64( 1/ 8), 132.776: ~1 levels ~62914560 states ~573696600 transitions
pins2lts-mc-linux64( 3/ 8), 271.890: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 271.953:
pins2lts-mc-linux64( 0/ 8), 271.953: mean standard work distribution: 3.5% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 271.953:
pins2lts-mc-linux64( 0/ 8), 271.953: Explored 113906243 states 1139550158 transitions, fanout: 10.004
pins2lts-mc-linux64( 0/ 8), 271.953: Total exploration time 271.810 sec (271.760 sec minimum, 271.781 sec on average)
pins2lts-mc-linux64( 0/ 8), 271.953: States per second: 419066, Transitions per second: 4192452
pins2lts-mc-linux64( 0/ 8), 271.953:
pins2lts-mc-linux64( 0/ 8), 271.953: Progress states detected: 134216782
pins2lts-mc-linux64( 0/ 8), 271.953: Redundant explorations: -15.1330
pins2lts-mc-linux64( 0/ 8), 271.953:
pins2lts-mc-linux64( 0/ 8), 271.953: Queue width: 8B, total height: 42995088, memory: 328.03MB
pins2lts-mc-linux64( 0/ 8), 271.953: Tree memory: 1082.1MB, 8.5 B/state, compr.: 12.1%
pins2lts-mc-linux64( 0/ 8), 271.953: Tree fill ratio (roots/leafs): 99.0%/22.0%
pins2lts-mc-linux64( 0/ 8), 271.953: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 271.953: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 271.953: Est. total memory use: 1410.1MB (~1352.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17003412584359693679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17003412584359693679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](((LTLAPp0==true)||X((LTLAPp1==true))))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-22 05:51:14] [INFO ] Flatten gal took : 82 ms
[2023-03-22 05:51:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality10158333912084586467.gal : 22 ms
[2023-03-22 05:51:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality9451610531871083987.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10158333912084586467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9451610531871083987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X((G(("(Pm3<=Pback4)")||(X("(P4>=1)"))))||(G(F("(Pout4<=Pout1)"))))))
Formula 0 simplified : X(F(!"(Pm3<=Pback4)" & X!"(P4>=1)") & FG!"(Pout4<=Pout1)")
Detected timeout of ITS tools.
[2023-03-22 06:13:23] [INFO ] Flatten gal took : 78 ms
[2023-03-22 06:13:24] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:13:24] [INFO ] Transformed 16 places.
[2023-03-22 06:13:24] [INFO ] Transformed 16 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-22 06:13:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality2298005871488744607.gal : 7 ms
[2023-03-22 06:13:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality14845508749214103138.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2298005871488744607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14845508749214103138.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(("(Pm3<=Pback4)")||(X("(P4>=1)"))))||(G(F("(Pout4<=Pout1)"))))))
Formula 0 simplified : X(F(!"(Pm3<=Pback4)" & X!"(P4>=1)") & FG!"(Pout4<=Pout1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7150828 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16123332 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-01000"
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-5348"
echo " Executing tool itstools"
echo " Input is Kanban-PT-01000, 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 r229-tall-167856413000291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-01000.tgz
mv Kanban-PT-01000 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 ;