About the Execution of ITS-Tools for TCPcondis-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
639.123 | 39647.00 | 47850.00 | 315.50 | FFTTFFFFTTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746500804.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TCPcondis-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746500804
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 24K May 5 16:52 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 TCPcondis-PT-10-00
FORMULA_NAME TCPcondis-PT-10-01
FORMULA_NAME TCPcondis-PT-10-02
FORMULA_NAME TCPcondis-PT-10-03
FORMULA_NAME TCPcondis-PT-10-04
FORMULA_NAME TCPcondis-PT-10-05
FORMULA_NAME TCPcondis-PT-10-06
FORMULA_NAME TCPcondis-PT-10-07
FORMULA_NAME TCPcondis-PT-10-08
FORMULA_NAME TCPcondis-PT-10-09
FORMULA_NAME TCPcondis-PT-10-10
FORMULA_NAME TCPcondis-PT-10-11
FORMULA_NAME TCPcondis-PT-10-12
FORMULA_NAME TCPcondis-PT-10-13
FORMULA_NAME TCPcondis-PT-10-14
FORMULA_NAME TCPcondis-PT-10-15
=== Now, execution of the tool begins
BK_START 1621284117169
Running Version 0
[2021-05-17 20:41:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:41:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:41:58] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 20:41:58] [WARNING] Unknown XML tag in source file: size
[2021-05-17 20:41:58] [WARNING] Unknown XML tag in source file: color
[2021-05-17 20:41:58] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-17 20:41:58] [INFO ] Transformed 30 places.
[2021-05-17 20:41:58] [INFO ] Transformed 32 transitions.
[2021-05-17 20:41:58] [INFO ] Parsed PT model containing 30 places and 32 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:41:58] [INFO ] Initial state test concluded for 4 properties.
FORMULA TCPcondis-PT-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-10-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:41:58] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 20:41:58] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:41:58] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:41:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:41:58] [INFO ] Computed 9 place invariants in 11 ms
[2021-05-17 20:41:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 20:41:59] [INFO ] Flatten gal took : 21 ms
[2021-05-17 20:41:59] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:41:59] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 1076 steps, including 0 resets, run visited all 21 properties in 8 ms. (steps per millisecond=134 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||X(p1)))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:41:59] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:41:59] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:41:59] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 20:41:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:41:59] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:41:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-10-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s8 s2), p0:(LEQ 3 s11), p1:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2127 reset in 316 ms.
Product exploration explored 100000 steps with 2102 reset in 244 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2120 reset in 185 ms.
Stack based approach found an accepted trace after 89884 steps with 1926 reset with depth 19 and stack size 19 in 176 ms.
FORMULA TCPcondis-PT-10-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-00 finished in 1495 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 15 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:42:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:00] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:42:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-17 20:42:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 20:42:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 2815 steps with 0 reset with depth 2816 and stack size 1938 in 12 ms.
FORMULA TCPcondis-PT-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-01 finished in 346 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-10-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s24), p1:(GT s12 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99 steps with 6 reset in 1 ms.
FORMULA TCPcondis-PT-10-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-04 finished in 178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 5 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-17 20:42:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LEQ s1 s2) (LEQ s4 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-10-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-06 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(p0)||(p0&&(!p0||F(G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s4 s10), p1:(LEQ s23 s20)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 259 ms.
Stack based approach found an accepted trace after 49286 steps with 0 reset with depth 49287 and stack size 49287 in 155 ms.
FORMULA TCPcondis-PT-10-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-07 finished in 585 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:42:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:01] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 5 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 20:42:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 20:42:02] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:02] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
[2021-05-17 20:42:02] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:42:02] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:42:02] [INFO ] Time to serialize gal into /tmp/LTL2488767107866658848.gal : 2 ms
[2021-05-17 20:42:02] [INFO ] Time to serialize properties into /tmp/LTL12366315344619685251.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2488767107866658848.gal, -t, CGAL, -LTL, /tmp/LTL12366315344619685251.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2488767107866658848.gal -t CGAL -LTL /tmp/LTL12366315344619685251.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(FIN<1)"))))
Formula 0 simplified : !XF"(FIN<1)"
Detected timeout of ITS tools.
[2021-05-17 20:42:17] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:42:17] [INFO ] Applying decomposition
[2021-05-17 20:42:17] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5168033720877193144.txt, -o, /tmp/graph5168033720877193144.bin, -w, /tmp/graph5168033720877193144.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5168033720877193144.bin, -l, -1, -v, -w, /tmp/graph5168033720877193144.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:42:18] [INFO ] Decomposing Gal with order
[2021-05-17 20:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:42:18] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 20:42:18] [INFO ] Flatten gal took : 49 ms
[2021-05-17 20:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 20:42:18] [INFO ] Time to serialize gal into /tmp/LTL16066710643331460656.gal : 2 ms
[2021-05-17 20:42:18] [INFO ] Time to serialize properties into /tmp/LTL11038938083964525511.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16066710643331460656.gal, -t, CGAL, -LTL, /tmp/LTL11038938083964525511.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16066710643331460656.gal -t CGAL -LTL /tmp/LTL11038938083964525511.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i2.u6.FIN<1)"))))
Formula 0 simplified : !XF"(i2.u6.FIN<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16859125178086955840
[2021-05-17 20:42:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16859125178086955840
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16859125178086955840]
Compilation finished in 230 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16859125178086955840]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16859125178086955840]
LTSmin run took 259 ms.
FORMULA TCPcondis-PT-10-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-10-08 finished in 31776 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 5 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:42:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:33] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:42:33] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:42:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-17 20:42:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 20:42:33] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 20:42:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2726 reset in 161 ms.
Stack based approach found an accepted trace after 11792 steps with 318 reset with depth 14 and stack size 14 in 21 ms.
FORMULA TCPcondis-PT-10-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-10 finished in 292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:33] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-10-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s4 s27), p2:(AND (GT 3 s19) (GT s28 s15)), p1:(GT s28 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1706 reset in 175 ms.
Product exploration explored 100000 steps with 1699 reset in 188 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1673 reset in 174 ms.
Stack based approach found an accepted trace after 40375 steps with 707 reset with depth 147 and stack size 147 in 77 ms.
FORMULA TCPcondis-PT-10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-11 finished in 961 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 4 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:42:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:34] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:42:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-17 20:42:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 20:42:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-10-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 782 steps with 0 reset with depth 783 and stack size 783 in 2 ms.
FORMULA TCPcondis-PT-10-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-13 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U (p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 7 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 20:42:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:35] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 20:42:35] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 20:42:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-17 20:42:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 20:42:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-10-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s20 s16), p2:(LEQ 3 s1), p0:(LEQ 2 s16)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 218 reset in 232 ms.
Stack based approach found an accepted trace after 10077 steps with 21 reset with depth 730 and stack size 730 in 24 ms.
FORMULA TCPcondis-PT-10-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-14 finished in 436 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:35] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:42:35] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 20:42:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:42:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-10-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s3), p1:(LEQ s2 s7), p2:(LEQ 2 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-10-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-10-15 finished in 175 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621284156816
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-10, 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 r254-tall-162106746500804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-10.tgz
mv TCPcondis-PT-10 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 ;