About the Execution of ITS-Tools for TCPcondis-PT-40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.672 | 3600000.00 | 3867603.00 | 92495.30 | FFFFFTFFF?FFTFFF | 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-162106746600853.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-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746600853
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.5K Mar 28 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-40-00
FORMULA_NAME TCPcondis-PT-40-01
FORMULA_NAME TCPcondis-PT-40-02
FORMULA_NAME TCPcondis-PT-40-03
FORMULA_NAME TCPcondis-PT-40-04
FORMULA_NAME TCPcondis-PT-40-05
FORMULA_NAME TCPcondis-PT-40-06
FORMULA_NAME TCPcondis-PT-40-07
FORMULA_NAME TCPcondis-PT-40-08
FORMULA_NAME TCPcondis-PT-40-09
FORMULA_NAME TCPcondis-PT-40-10
FORMULA_NAME TCPcondis-PT-40-11
FORMULA_NAME TCPcondis-PT-40-12
FORMULA_NAME TCPcondis-PT-40-13
FORMULA_NAME TCPcondis-PT-40-14
FORMULA_NAME TCPcondis-PT-40-15
=== Now, execution of the tool begins
BK_START 1621293163014
Running Version 0
[2021-05-17 23:12:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 23:12:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 23:12:44] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 23:12:44] [WARNING] Unknown XML tag in source file: size
[2021-05-17 23:12:44] [WARNING] Unknown XML tag in source file: color
[2021-05-17 23:12:44] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-17 23:12:44] [INFO ] Transformed 30 places.
[2021-05-17 23:12:44] [INFO ] Transformed 32 transitions.
[2021-05-17 23:12:44] [INFO ] Parsed PT model containing 30 places and 32 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 23:12:44] [INFO ] Initial state test concluded for 1 properties.
Support contains 21 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 9 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 23:12:44] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 23:12:44] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:44] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 23:12:44] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:44] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:12:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 23:12:45] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 23:12:45] [INFO ] Flatten gal took : 24 ms
FORMULA TCPcondis-PT-40-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-40-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 23:12:45] [INFO ] Flatten gal took : 13 ms
[2021-05-17 23:12:45] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 58590 steps, including 1 resets, run visited all 23 properties in 47 ms. (steps per millisecond=1246 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&F(G(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 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 23:12:45] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 23:12:45] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:45] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:12:45] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:45] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:12:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1), p1:(AND (GEQ s6 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-40-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-00 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(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 23:12:45] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:12:45] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:45] [INFO ] Computed 9 place invariants in 9 ms
[2021-05-17 23:12:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:45] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:12:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-40-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-02 finished in 183 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X((p0&&X(!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 23:12:45] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:12:45] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:45] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 23:12:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:12:45] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:12:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, true, (NOT p0), (NOT p0), true]
Running random walk in product with property : TCPcondis-PT-40-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-03 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 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 0 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
Applied a total of 12 rules in 12 ms. Remains 24 /30 variables (removed 6) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 24 cols
[2021-05-17 23:12:46] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:12:46] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 26 rows 24 cols
[2021-05-17 23:12:46] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:12:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-17 23:12:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 24 cols
[2021-05-17 23:12:46] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:12:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3244 reset in 282 ms.
Stack based approach found an accepted trace after 74104 steps with 2510 reset with depth 97 and stack size 97 in 182 ms.
FORMULA TCPcondis-PT-40-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-04 finished in 629 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||G(p0))))], 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
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 9 place count 26 transition count 27
Applied a total of 9 rules in 6 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2021-05-17 23:12:46] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:12:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2021-05-17 23:12:46] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:12:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-17 23:12:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2021-05-17 23:12:46] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:12:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-40-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s17 1) (GEQ s12 1)), p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3117 reset in 226 ms.
Product exploration explored 100000 steps with 3084 reset in 230 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 28 ms :[true, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3129 reset in 176 ms.
Product exploration explored 100000 steps with 3088 reset in 185 ms.
[2021-05-17 23:12:47] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:12:47] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:12:47] [INFO ] Time to serialize gal into /tmp/LTL4370522918028403180.gal : 1 ms
[2021-05-17 23:12:47] [INFO ] Time to serialize properties into /tmp/LTL6707353551184572821.ltl : 10 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/LTL4370522918028403180.gal, -t, CGAL, -LTL, /tmp/LTL6707353551184572821.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/LTL4370522918028403180.gal -t CGAL -LTL /tmp/LTL6707353551184572821.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(xCLOSED>=1)")U((G("(xCLOSED>=1)"))||("(((FIN>=1)&&(xFINWAIT1>=1))&&(xCLOSED>=1))"))))
Formula 0 simplified : !("(xCLOSED>=1)" U ("(((FIN>=1)&&(xFINWAIT1>=1))&&(xCLOSED>=1))" | G"(xCLOSED>=1)"))
Detected timeout of ITS tools.
[2021-05-17 23:13:02] [INFO ] Flatten gal took : 3 ms
[2021-05-17 23:13:02] [INFO ] Applying decomposition
[2021-05-17 23:13:02] [INFO ] Flatten gal took : 15 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/graph10100215741976699098.txt, -o, /tmp/graph10100215741976699098.bin, -w, /tmp/graph10100215741976699098.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/graph10100215741976699098.bin, -l, -1, -v, -w, /tmp/graph10100215741976699098.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:13:02] [INFO ] Decomposing Gal with order
[2021-05-17 23:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:13:02] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:13:03] [INFO ] Flatten gal took : 86 ms
[2021-05-17 23:13:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-17 23:13:03] [INFO ] Time to serialize gal into /tmp/LTL2992651349875397685.gal : 1 ms
[2021-05-17 23:13:03] [INFO ] Time to serialize properties into /tmp/LTL16654034079028424205.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/LTL2992651349875397685.gal, -t, CGAL, -LTL, /tmp/LTL16654034079028424205.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/LTL2992651349875397685.gal -t CGAL -LTL /tmp/LTL16654034079028424205.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("(u5.xCLOSED>=1)")U((G("(u5.xCLOSED>=1)"))||("(((i0.u1.FIN>=1)&&(i3.u7.xFINWAIT1>=1))&&(u5.xCLOSED>=1))"))))
Formula 0 simplified : !("(u5.xCLOSED>=1)" U ("(((i0.u1.FIN>=1)&&(i3.u7.xFINWAIT1>=1))&&(u5.xCLOSED>=1))" | G"(u5.xCLOSED>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5547711773949511286
[2021-05-17 23:13:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5547711773949511286
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/ltsmin5547711773949511286]
Compilation finished in 243 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5547711773949511286]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5547711773949511286]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-40-06 finished in 46442 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(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 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 23:13:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:13:33] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:13:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:13:33] [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.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:13:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:13:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-40-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s18 1), p1:(AND (GEQ s6 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 228 ms.
Product exploration explored 100000 steps with 0 reset in 314 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 0 reset in 403 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 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 23:13:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 23:13:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:13:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 0 reset in 311 ms.
Stack based approach found an accepted trace after 13687 steps with 0 reset with depth 13688 and stack size 13687 in 38 ms.
FORMULA TCPcondis-PT-40-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-07 finished in 2030 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(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 23:13:35] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:13:35] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:13:35] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 23:13:35] [INFO ] Implicit Places using invariants and state equation in 31 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 23:13:35] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 23:13:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-40-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s20 1)) (GEQ s15 1)), p1:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1298 reset in 216 ms.
Stack based approach found an accepted trace after 85071 steps with 1111 reset with depth 60 and stack size 60 in 222 ms.
FORMULA TCPcondis-PT-40-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-08 finished in 648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||X((X(p2)&&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 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 23:13:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:13:35] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:13:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:13:35] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:13:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:13:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-40-09 automaton TGBA [mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(AND (GEQ s7 1) (GEQ s19 1)), p2:(AND (GEQ s5 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1367 reset in 225 ms.
Product exploration explored 100000 steps with 1388 reset in 222 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 1337 reset in 204 ms.
Product exploration explored 100000 steps with 1363 reset in 218 ms.
[2021-05-17 23:13:37] [INFO ] Flatten gal took : 3 ms
[2021-05-17 23:13:37] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:13:37] [INFO ] Time to serialize gal into /tmp/LTL15154154299874996614.gal : 1 ms
[2021-05-17 23:13:37] [INFO ] Time to serialize properties into /tmp/LTL13814445878447980183.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/LTL15154154299874996614.gal, -t, CGAL, -LTL, /tmp/LTL13814445878447980183.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/LTL15154154299874996614.gal -t CGAL -LTL /tmp/LTL13814445878447980183.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(("((FINWAIT2>=1)&&(xFIN>=1))")&&(X("((FINACK>=1)&&(xFINWAIT1>=1))"))))||("((FINWAIT2>=1)&&(xFIN>=1))"))))
Formula 0 simplified : !F("((FINWAIT2>=1)&&(xFIN>=1))" | X("((FINWAIT2>=1)&&(xFIN>=1))" & X"((FINACK>=1)&&(xFINWAIT1>=1))"))
Detected timeout of ITS tools.
[2021-05-17 23:13:52] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:13:52] [INFO ] Applying decomposition
[2021-05-17 23:13:52] [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/graph11963618215150830128.txt, -o, /tmp/graph11963618215150830128.bin, -w, /tmp/graph11963618215150830128.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/graph11963618215150830128.bin, -l, -1, -v, -w, /tmp/graph11963618215150830128.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:13:52] [INFO ] Decomposing Gal with order
[2021-05-17 23:13:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:13:52] [INFO ] Removed a total of 22 redundant transitions.
[2021-05-17 23:13:52] [INFO ] Flatten gal took : 20 ms
[2021-05-17 23:13:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 23:13:52] [INFO ] Time to serialize gal into /tmp/LTL9268786051238959279.gal : 1 ms
[2021-05-17 23:13:52] [INFO ] Time to serialize properties into /tmp/LTL13073977639864119067.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/LTL9268786051238959279.gal, -t, CGAL, -LTL, /tmp/LTL13073977639864119067.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/LTL9268786051238959279.gal -t CGAL -LTL /tmp/LTL13073977639864119067.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((X(("((i0.u1.FINWAIT2>=1)&&(i2.i0.u0.xFIN>=1))")&&(X("((i2.i0.u0.FINACK>=1)&&(i2.i1.u6.xFINWAIT1>=1))"))))||("((i0.u1.FINWAIT2>=1)&&(i2.i0.u0.xFIN>=1))"))))
Formula 0 simplified : !F("((i0.u1.FINWAIT2>=1)&&(i2.i0.u0.xFIN>=1))" | X("((i0.u1.FINWAIT2>=1)&&(i2.i0.u0.xFIN>=1))" & X"((i2.i0.u0.FINACK>=1)&&(i2.i1.u6.xFINWAIT1>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13127076352758293798
[2021-05-17 23:14:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13127076352758293798
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/ltsmin13127076352758293798]
Compilation finished in 186 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13127076352758293798]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((X((X((LTLAPp1==true))&&(LTLAPp0==true)))||(LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13127076352758293798]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-40-09 finished in 46405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((!p1||F(p2))))))], 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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 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 5 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 23:14:22] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 23:14:22] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-17 23:14:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-05-17 23:14:22] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:22] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-40-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s14 1)), p1:(OR (LT s7 1) (LT s16 1)), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3138 reset in 180 ms.
Stack based approach found an accepted trace after 35237 steps with 1102 reset with depth 23 and stack size 23 in 69 ms.
FORMULA TCPcondis-PT-40-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-10 finished in 385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((X(G(p1))||p0)) U p2)))], workingDir=/home/mcc/execution]
Support contains 6 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 23:14:22] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:22] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:22] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-40-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s20 1) (GEQ s9 1) (GEQ s25 1)), p0:(OR (LT s4 1) (LT s18 1)), p1:(OR (LT s9 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-40-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-11 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0)) U (X(p2)||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 23:14:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:22] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:22] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 23:14:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-40-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s21 1)), p2:(OR (LT s13 1) (LT s25 1) (LT s26 1)), p0:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Knowledge obtained : [p1, p2, (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Support contains 5 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
Applied a total of 7 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 23:14:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 23:14:23] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:23] [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 74 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
[2021-05-17 23:14:23] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:14:23] [INFO ] Flatten gal took : 3 ms
[2021-05-17 23:14:23] [INFO ] Time to serialize gal into /tmp/LTL1169709653758970833.gal : 1 ms
[2021-05-17 23:14:23] [INFO ] Time to serialize properties into /tmp/LTL10980874254819946611.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/LTL1169709653758970833.gal, -t, CGAL, -LTL, /tmp/LTL10980874254819946611.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/LTL1169709653758970833.gal -t CGAL -LTL /tmp/LTL10980874254819946611.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((FIN>=1)&&(xFINWAIT1>=1))")))U(("((FIN<1)||(xFINWAIT1<1))")||(X("(((SYNSENT<1)||(xSYN<1))||(xSYNACK<1))"))))))
Formula 0 simplified : !X(XG"((FIN>=1)&&(xFINWAIT1>=1))" U ("((FIN<1)||(xFINWAIT1<1))" | X"(((SYNSENT<1)||(xSYN<1))||(xSYNACK<1))"))
Detected timeout of ITS tools.
[2021-05-17 23:14:38] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:14:38] [INFO ] Applying decomposition
[2021-05-17 23:14:38] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph336258878405557297.txt, -o, /tmp/graph336258878405557297.bin, -w, /tmp/graph336258878405557297.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/graph336258878405557297.bin, -l, -1, -v, -w, /tmp/graph336258878405557297.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:14:38] [INFO ] Decomposing Gal with order
[2021-05-17 23:14:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:14:38] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:14:38] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:14:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 23:14:38] [INFO ] Time to serialize gal into /tmp/LTL10417070470973065438.gal : 13 ms
[2021-05-17 23:14:38] [INFO ] Time to serialize properties into /tmp/LTL5665560634297936709.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/LTL10417070470973065438.gal, -t, CGAL, -LTL, /tmp/LTL5665560634297936709.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/LTL10417070470973065438.gal -t CGAL -LTL /tmp/LTL5665560634297936709.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((i3.i0.u7.FIN>=1)&&(i2.i1.u8.xFINWAIT1>=1))")))U(("((i3.i0.u7.FIN<1)||(i2.i1.u8.xFINWAIT1<1))")||(X("(((u3.SYNSENT<1)||(u5.xSYN<1))||(i3.i1.u9.xSYNACK<1))"))))))
Formula 0 simplified : !X(XG"((i3.i0.u7.FIN>=1)&&(i2.i1.u8.xFINWAIT1>=1))" U ("((i3.i0.u7.FIN<1)||(i2.i1.u8.xFINWAIT1<1))" | X"(((u3.SYNSENT<1)||(u5.xSYN<1))||(i3.i1.u9.xSYNACK<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11765169554857962341
[2021-05-17 23:14:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11765169554857962341
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/ltsmin11765169554857962341]
Compilation finished in 187 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11765169554857962341]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X([]((LTLAPp0==true))) U (X((LTLAPp2==true))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11765169554857962341]
LTSmin run took 216 ms.
FORMULA TCPcondis-PT-40-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-12 finished in 31640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X((p1&&F(G(!p2))))&&p0)) U G(p3)))], workingDir=/home/mcc/execution]
Support contains 6 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 23:14:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:54] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:54] [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 247 ms :[(NOT p3), (OR (NOT p1) (NOT p0) p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), true, (OR (NOT p1) p2), p2, (AND (NOT p3) p0), (OR (AND p0 (NOT p1) (NOT p3)) (AND p1 p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : TCPcondis-PT-40-13 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p3 p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 3}, { cond=(AND p3 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 5}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p1), acceptance={} source=7 dest: 8}], [{ cond=(NOT p3), acceptance={} source=8 dest: 5}, { cond=p3, acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(AND (GEQ s4 1) (GEQ s18 1)), p0:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(GEQ s3 1), p2:(OR (LT s13 1) (LT s25 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, 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-40-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-13 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0 U X(!p0))&&F(G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 7 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 23:14:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:54] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) p0), p0, (NOT p2), p0, (NOT p2), true]
Running random walk in product with property : TCPcondis-PT-40-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s25 1) (LT s26 1)), p2:(AND (GEQ s8 1) (GEQ s20 1)), p1:(AND (GEQ s5 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 0 ms.
FORMULA TCPcondis-PT-40-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-40-14 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F((!p1&&X(!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 23:14:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:14:55] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:14:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:14:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p2 p1), true, (OR p2 p1), p2]
Running random walk in product with property : TCPcondis-PT-40-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s15 1), p1:(GEQ s1 1), p2:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29199 reset in 112 ms.
Product exploration explored 100000 steps with 32846 reset in 114 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) p2 p1), true, (OR p2 p1), p2]
Product exploration explored 100000 steps with 31829 reset in 97 ms.
Product exploration explored 100000 steps with 29294 reset in 158 ms.
[2021-05-17 23:14:56] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:14:56] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:14:56] [INFO ] Time to serialize gal into /tmp/LTL5425043110763925667.gal : 1 ms
[2021-05-17 23:14:56] [INFO ] Time to serialize properties into /tmp/LTL10828842050672273612.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/LTL5425043110763925667.gal, -t, CGAL, -LTL, /tmp/LTL10828842050672273612.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/LTL5425043110763925667.gal -t CGAL -LTL /tmp/LTL10828842050672273612.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(xCLOSED>=1)")&&(F(("(CLOSEWAIT<1)")&&(X("(ESTAB<1)")))))))
Formula 0 simplified : !G("(xCLOSED>=1)" & F("(CLOSEWAIT<1)" & X"(ESTAB<1)"))
Detected timeout of ITS tools.
[2021-05-17 23:15:11] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:15:11] [INFO ] Applying decomposition
[2021-05-17 23:15:11] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13923701381316314326.txt, -o, /tmp/graph13923701381316314326.bin, -w, /tmp/graph13923701381316314326.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/graph13923701381316314326.bin, -l, -1, -v, -w, /tmp/graph13923701381316314326.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:15:11] [INFO ] Decomposing Gal with order
[2021-05-17 23:15:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:15:11] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:15:11] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:15:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2021-05-17 23:15:11] [INFO ] Time to serialize gal into /tmp/LTL10406291861707971935.gal : 7 ms
[2021-05-17 23:15:11] [INFO ] Time to serialize properties into /tmp/LTL12154924247574022262.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10406291861707971935.gal, -t, CGAL, -LTL, /tmp/LTL12154924247574022262.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/LTL10406291861707971935.gal -t CGAL -LTL /tmp/LTL12154924247574022262.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(u5.xCLOSED>=1)")&&(F(("(i1.u1.CLOSEWAIT<1)")&&(X("(i1.u2.ESTAB<1)")))))))
Formula 0 simplified : !G("(u5.xCLOSED>=1)" & F("(i1.u1.CLOSEWAIT<1)" & X"(i1.u2.ESTAB<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2697005905967850749
[2021-05-17 23:15:26] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2697005905967850749
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/ltsmin2697005905967850749]
Compilation finished in 184 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2697005905967850749]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2697005905967850749]
LTSmin run took 1043 ms.
FORMULA TCPcondis-PT-40-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-40-15 finished in 32548 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin83194689790329970
[2021-05-17 23:15:27] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2021-05-17 23:15:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:15:27] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2021-05-17 23:15:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:15:27] [INFO ] Applying decomposition
[2021-05-17 23:15:27] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2021-05-17 23:15:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:15:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin83194689790329970
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/ltsmin83194689790329970]
[2021-05-17 23:15:27] [INFO ] Flatten gal took : 9 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/graph5840392411233027912.txt, -o, /tmp/graph5840392411233027912.bin, -w, /tmp/graph5840392411233027912.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/graph5840392411233027912.bin, -l, -1, -v, -w, /tmp/graph5840392411233027912.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:15:27] [INFO ] Decomposing Gal with order
[2021-05-17 23:15:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:15:27] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:15:27] [INFO ] Flatten gal took : 8 ms
[2021-05-17 23:15:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2021-05-17 23:15:27] [INFO ] Time to serialize gal into /tmp/LTLFireability7088114448191667294.gal : 18 ms
[2021-05-17 23:15:27] [INFO ] Time to serialize properties into /tmp/LTLFireability331789666584291080.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/LTLFireability7088114448191667294.gal, -t, CGAL, -LTL, /tmp/LTLFireability331789666584291080.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/LTLFireability7088114448191667294.gal -t CGAL -LTL /tmp/LTLFireability331789666584291080.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((("(u6.xCLOSED>=1)")U(("(((i4.u1.FIN>=1)&&(i2.u4.xFINWAIT1>=1))&&(u6.xCLOSED>=1))")||(G("(u6.xCLOSED>=1)")))))
Formula 0 simplified : !("(u6.xCLOSED>=1)" U ("(((i4.u1.FIN>=1)&&(i2.u4.xFINWAIT1>=1))&&(u6.xCLOSED>=1))" | G"(u6.xCLOSED>=1)"))
Compilation finished in 209 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin83194689790329970]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin83194689790329970]
LTSmin run took 405 ms.
FORMULA TCPcondis-PT-40-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, <>((!(LTLAPp2==true)||X((X((LTLAPp4==true))&&(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin83194689790329970]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: LTL layer: formula: <>((!(LTLAPp2==true)||X((X((LTLAPp4==true))&&(LTLAPp3==true)))))
pins2lts-mc-linux64( 1/ 8), 0.019: "<>((!(LTLAPp2==true)||X((X((LTLAPp4==true))&&(LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.020: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: 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( 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( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.111: DFS-FIFO for weak LTL, using special progress label 38
pins2lts-mc-linux64( 0/ 8), 0.111: There are 39 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.111: State length is 31, there are 37 groups
pins2lts-mc-linux64( 0/ 8), 0.111: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.111: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.111: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.111: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.339: ~117 levels ~960 states ~12856 transitions
pins2lts-mc-linux64( 5/ 8), 0.322: ~209 levels ~1920 states ~23112 transitions
pins2lts-mc-linux64( 5/ 8), 0.324: ~354 levels ~3840 states ~32784 transitions
pins2lts-mc-linux64( 5/ 8), 0.325: ~354 levels ~7680 states ~38304 transitions
pins2lts-mc-linux64( 2/ 8), 0.352: ~369 levels ~15360 states ~55680 transitions
pins2lts-mc-linux64( 2/ 8), 0.356: ~369 levels ~30720 states ~80152 transitions
pins2lts-mc-linux64( 2/ 8), 0.376: ~380 levels ~61440 states ~131352 transitions
pins2lts-mc-linux64( 5/ 8), 0.404: ~354 levels ~122880 states ~254344 transitions
pins2lts-mc-linux64( 5/ 8), 0.492: ~354 levels ~245760 states ~491808 transitions
pins2lts-mc-linux64( 2/ 8), 0.709: ~380 levels ~491520 states ~940056 transitions
pins2lts-mc-linux64( 2/ 8), 1.078: ~380 levels ~983040 states ~2026640 transitions
pins2lts-mc-linux64( 5/ 8), 1.919: ~354 levels ~1966080 states ~4850576 transitions
pins2lts-mc-linux64( 5/ 8), 3.644: ~354 levels ~3932160 states ~11047408 transitions
pins2lts-mc-linux64( 5/ 8), 7.377: ~354 levels ~7864320 states ~23471096 transitions
pins2lts-mc-linux64( 3/ 8), 15.873: ~386 levels ~15728640 states ~47062720 transitions
pins2lts-mc-linux64( 1/ 8), 30.340: ~376 levels ~31457280 states ~83519744 transitions
pins2lts-mc-linux64( 1/ 8), 64.559: ~376 levels ~62914560 states ~186226040 transitions
pins2lts-mc-linux64( 7/ 8), 130.912: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 130.951:
pins2lts-mc-linux64( 0/ 8), 130.951: mean standard work distribution: 3.2% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 130.951:
pins2lts-mc-linux64( 0/ 8), 130.951: Explored 105190942 states 370202139 transitions, fanout: 3.519
pins2lts-mc-linux64( 0/ 8), 130.951: Total exploration time 130.820 sec (130.780 sec minimum, 130.799 sec on average)
pins2lts-mc-linux64( 0/ 8), 130.951: States per second: 804089, Transitions per second: 2829859
pins2lts-mc-linux64( 0/ 8), 130.951:
pins2lts-mc-linux64( 0/ 8), 130.951: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 130.952: Redundant explorations: -0.0721
pins2lts-mc-linux64( 0/ 8), 130.952:
pins2lts-mc-linux64( 0/ 8), 130.952: Queue width: 8B, total height: 5488, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 130.952: Tree memory: 1059.1MB, 10.6 B/state, compr.: 8.4%
pins2lts-mc-linux64( 0/ 8), 130.952: Tree fill ratio (roots/leafs): 78.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 130.952: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 130.952: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 130.952: Est. total memory use: 1059.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((!(LTLAPp2==true)||X((X((LTLAPp4==true))&&(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin83194689790329970]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((!(LTLAPp2==true)||X((X((LTLAPp4==true))&&(LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin83194689790329970]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 23:36:21] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:36:21] [INFO ] Time to serialize gal into /tmp/LTLFireability11670435640689560421.gal : 1 ms
[2021-05-17 23:36:21] [INFO ] Time to serialize properties into /tmp/LTLFireability5095282250381835931.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/LTLFireability11670435640689560421.gal, -t, CGAL, -LTL, /tmp/LTLFireability5095282250381835931.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/LTLFireability11670435640689560421.gal -t CGAL -LTL /tmp/LTLFireability5095282250381835931.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((!("((FINWAIT2<1)||(xFIN<1))"))||(X((!("((FINWAIT2<1)||(xFIN<1))"))&&(X("((FINACK>=1)&&(xFINWAIT1>=1))")))))))
Formula 0 simplified : !F(!"((FINWAIT2<1)||(xFIN<1))" | X(!"((FINWAIT2<1)||(xFIN<1))" & X"((FINACK>=1)&&(xFINWAIT1>=1))"))
Detected timeout of ITS tools.
[2021-05-17 23:57:22] [INFO ] Flatten gal took : 131 ms
[2021-05-17 23:57:22] [INFO ] Input system was already deterministic with 32 transitions.
[2021-05-17 23:57:22] [INFO ] Transformed 30 places.
[2021-05-17 23:57:22] [INFO ] Transformed 32 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 23:57:22] [INFO ] Time to serialize gal into /tmp/LTLFireability9512974187385000304.gal : 3 ms
[2021-05-17 23:57:22] [INFO ] Time to serialize properties into /tmp/LTLFireability1663769285080496700.ltl : 3 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/LTLFireability9512974187385000304.gal, -t, CGAL, -LTL, /tmp/LTLFireability1663769285080496700.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability9512974187385000304.gal -t CGAL -LTL /tmp/LTLFireability1663769285080496700.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((!("((FINWAIT2<1)||(xFIN<1))"))||(X((!("((FINWAIT2<1)||(xFIN<1))"))&&(X("((FINACK>=1)&&(xFINWAIT1>=1))")))))))
Formula 0 simplified : !F(!"((FINWAIT2<1)||(xFIN<1))" | X(!"((FINWAIT2<1)||(xFIN<1))" & X"((FINACK>=1)&&(xFINWAIT1>=1))"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-40, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746600853"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-40.tgz
mv TCPcondis-PT-40 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;