About the Execution of ITS-Tools for ResAllocation-PT-R003C020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 679.235 | 32990.00 | 51060.00 | 122.40 | FFTFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416300757.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ResAllocation-PT-R003C020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416300757
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K 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.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 143K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R003C020-00
FORMULA_NAME ResAllocation-PT-R003C020-01
FORMULA_NAME ResAllocation-PT-R003C020-02
FORMULA_NAME ResAllocation-PT-R003C020-03
FORMULA_NAME ResAllocation-PT-R003C020-04
FORMULA_NAME ResAllocation-PT-R003C020-05
FORMULA_NAME ResAllocation-PT-R003C020-06
FORMULA_NAME ResAllocation-PT-R003C020-07
FORMULA_NAME ResAllocation-PT-R003C020-08
FORMULA_NAME ResAllocation-PT-R003C020-09
FORMULA_NAME ResAllocation-PT-R003C020-10
FORMULA_NAME ResAllocation-PT-R003C020-11
FORMULA_NAME ResAllocation-PT-R003C020-12
FORMULA_NAME ResAllocation-PT-R003C020-13
FORMULA_NAME ResAllocation-PT-R003C020-14
FORMULA_NAME ResAllocation-PT-R003C020-15
=== Now, execution of the tool begins
BK_START 1621265661003
Running Version 0
[2021-05-17 15:34:22] [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 15:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:34:22] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-17 15:34:22] [INFO ] Transformed 120 places.
[2021-05-17 15:34:22] [INFO ] Transformed 80 transitions.
[2021-05-17 15:34:22] [INFO ] Parsed PT model containing 120 places and 80 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:34:22] [INFO ] Initial state test concluded for 3 properties.
FORMULA ResAllocation-PT-R003C020-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 120 cols
[2021-05-17 15:34:23] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-17 15:34:23] [INFO ] Implicit Places using invariants in 170 ms returned [117, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:23] [INFO ] Computed 58 place invariants in 12 ms
[2021-05-17 15:34:23] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 118/120 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:23] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-17 15:34:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 118/120 places, 80/80 transitions.
[2021-05-17 15:34:23] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 15:34:23] [INFO ] Flatten gal took : 35 ms
FORMULA ResAllocation-PT-R003C020-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:34:23] [INFO ] Flatten gal took : 13 ms
[2021-05-17 15:34:23] [INFO ] Input system was already deterministic with 80 transitions.
Finished random walk after 43179 steps, including 980 resets, run visited all 24 properties in 146 ms. (steps per millisecond=295 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U (G(p1)&&(p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 101 transition count 64
Applied a total of 33 rules in 22 ms. Remains 101 /118 variables (removed 17) and now considering 64/80 (removed 16) transitions.
// Phase 1: matrix 64 rows 101 cols
[2021-05-17 15:34:23] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-17 15:34:24] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 64 rows 101 cols
[2021-05-17 15:34:24] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-17 15:34:24] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2021-05-17 15:34:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 101 cols
[2021-05-17 15:34:24] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 101/118 places, 64/80 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ResAllocation-PT-R003C020-01 automaton TGBA [mat=[[{ cond=(OR (AND p1 p3) (AND p1 p2) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={1} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LT s17 1), p3:(AND (LT s17 1) (OR (LT s62 1) (LT s65 1) (LT s68 1))), p2:(OR (LT s62 1) (LT s65 1) (LT s68 1)), p0:(AND (GEQ s4 1) (OR (LT s5 1) (LT s10 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 3867 steps with 92 reset in 45 ms.
FORMULA ResAllocation-PT-R003C020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-01 finished in 758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:24] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:24] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:24] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-17 15:34:24] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:24] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:25] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 118/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C020-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s109 1) (LT s115 1) (LT s116 1)), p2:(AND (OR (LT s109 1) (LT s115 1) (LT s116 1) (LT s49 1) (LT s55 1) (LT s56 1)) (OR (LT s55 1) (LT s61 1))), p1:(OR (LT s55 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 7 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 118 transition count 80
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 17 rules in 22 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2021-05-17 15:34:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:27] [INFO ] Computed 58 place invariants in 15 ms
[2021-05-17 15:34:27] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 118/118 places, 80/80 transitions.
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
[2021-05-17 15:34:28] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:34:28] [INFO ] Flatten gal took : 41 ms
[2021-05-17 15:34:28] [INFO ] Time to serialize gal into /tmp/LTL1540374969975955624.gal : 6 ms
[2021-05-17 15:34:28] [INFO ] Time to serialize properties into /tmp/LTL14859436704071352252.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/LTL1540374969975955624.gal, -t, CGAL, -LTL, /tmp/LTL14859436704071352252.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/LTL1540374969975955624.gal -t CGAL -LTL /tmp/LTL14859436704071352252.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(((r_18_0<1)||(r_19_0<1))||(p_19_1<1))"))||(X(("((r_9_0<1)||(r_10_0<1))")U(("(((((((r_18_0<1)||(r_19_0<1))||(p_19_1<1))||(r_8_0<1))||(r_9_0<1))||(p_9_1<1))&&((r_9_0<1)||(r_10_0<1)))")||(G("((r_9_0<1)||(r_10_0<1))"))))))))
Formula 0 simplified : !X(F"(((r_18_0<1)||(r_19_0<1))||(p_19_1<1))" | X("((r_9_0<1)||(r_10_0<1))" U ("(((((((r_18_0<1)||(r_19_0<1))||(p_19_1<1))||(r_8_0<1))||(r_9_0<1))||(p_9_1<1))&&((r_9_0<1)||(r_10_0<1)))" | G"((r_9_0<1)||(r_10_0<1))")))
Detected timeout of ITS tools.
[2021-05-17 15:34:43] [INFO ] Flatten gal took : 24 ms
[2021-05-17 15:34:43] [INFO ] Applying decomposition
[2021-05-17 15:34:43] [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/graph8539448959641689581.txt, -o, /tmp/graph8539448959641689581.bin, -w, /tmp/graph8539448959641689581.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/graph8539448959641689581.bin, -l, -1, -v, -w, /tmp/graph8539448959641689581.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:34:43] [INFO ] Decomposing Gal with order
[2021-05-17 15:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:34:43] [INFO ] Flatten gal took : 43 ms
[2021-05-17 15:34:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 15:34:43] [INFO ] Time to serialize gal into /tmp/LTL14841625842372421762.gal : 9 ms
[2021-05-17 15:34:43] [INFO ] Time to serialize properties into /tmp/LTL3773107831137604908.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/LTL14841625842372421762.gal, -t, CGAL, -LTL, /tmp/LTL3773107831137604908.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/LTL14841625842372421762.gal -t CGAL -LTL /tmp/LTL3773107831137604908.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i6.u43.r_18_0<1)||(i6.u43.r_19_0<1))||(i6.u42.p_19_1<1))"))||(X(("((i3.i0.u19.r_9_0<1)||(i3.i0.u22.r_10_0<1))")U(("(((((((i6.u43.r_18_0<1)||(i6.u43.r_19_0<1))||(i6.u42.p_19_1<1))||(i3.i0.u19.r_8_0<1))||(i3.i0.u19.r_9_0<1))||(i3.i0.u19.p_9_1<1))&&((i3.i0.u19.r_9_0<1)||(i3.i0.u22.r_10_0<1)))")||(G("((i3.i0.u19.r_9_0<1)||(i3.i0.u22.r_10_0<1))"))))))))
Formula 0 simplified : !X(F"(((i6.u43.r_18_0<1)||(i6.u43.r_19_0<1))||(i6.u42.p_19_1<1))" | X("((i3.i0.u19.r_9_0<1)||(i3.i0.u22.r_10_0<1))" U ("(((((((i6.u43.r_18_0<1)||(i6.u43.r_19_0<1))||(i6.u42.p_19_1<1))||(i3.i0.u19.r_8_0<1))||(i3.i0.u19.r_9_0<1))||(i3.i0.u19.p_9_1<1))&&((i3.i0.u19.r_9_0<1)||(i3.i0.u22.r_10_0<1)))" | G"((i3.i0.u19.r_9_0<1)||(i3.i0.u22.r_10_0<1))")))
Reverse transition relation is NOT exact ! Due to transitions t11, t27, t28, t44, t52, t68, i0.i0.t4, i0.i1.u2.t3, i1.i0.u10.t19, i1.i1.t12, i2.u11.t20, i3.i0.u19.t36, i3.i1.t35, i4.i0.t43, i4.i2.t51, i5.i0.t60, i5.i1.t59, i5.i2.t67, i6.t75, i6.u43.t76, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/20/80
Computing Next relation with stutter on 265 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
38 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.400994,30784,1,0,27421,649,1584,80243,294,1938,31844
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C020-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResAllocation-PT-R003C020-02 finished in 19541 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0 U p1))&&F(G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 103 transition count 65
Applied a total of 30 rules in 24 ms. Remains 103 /118 variables (removed 15) and now considering 65/80 (removed 15) transitions.
// Phase 1: matrix 65 rows 103 cols
[2021-05-17 15:34:44] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:44] [INFO ] Implicit Places using invariants in 195 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
[2021-05-17 15:34:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 65 rows 102 cols
[2021-05-17 15:34:44] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:45] [INFO ] Dead Transitions using invariants and state equation in 1350 ms returned []
Starting structural reductions, iteration 1 : 102/118 places, 65/80 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2021-05-17 15:34:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 102 cols
[2021-05-17 15:34:45] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:45] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 102/118 places, 65/80 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C020-03 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s89 1) (GEQ s95 1)) (AND (GEQ s67 1) (GEQ s73 1))), p0:(GEQ s24 1), p2:(OR (LT s89 1) (LT s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1086 steps with 25 reset in 6 ms.
FORMULA ResAllocation-PT-R003C020-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-03 finished in 1885 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:46] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:46] [INFO ] Implicit Places using invariants in 111 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:46] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 117/118 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:46] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-17 15:34:47] [INFO ] Dead Transitions using invariants and state equation in 1589 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C020-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s31 1) (GEQ s37 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 5 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-05 finished in 1923 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0) U p1)&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:48] [INFO ] Computed 58 place invariants in 0 ms
[2021-05-17 15:34:48] [INFO ] Implicit Places using invariants in 208 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:48] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:48] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 117/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:48] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ResAllocation-PT-R003C020-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s55 1) (LT s61 1) (GEQ s100 1)), p0:(GEQ s1 1), p2:(OR (LT s91 1) (LT s97 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 2 reset in 0 ms.
FORMULA ResAllocation-PT-R003C020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-06 finished in 609 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0||G(p1)) U !p2) U X(p3)))], workingDir=/home/mcc/execution]
Support contains 9 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:48] [INFO ] Computed 58 place invariants in 5 ms
[2021-05-17 15:34:48] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:48] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-17 15:34:48] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:48] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:48] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 118/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p3), (NOT p3), (AND p2 (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), true, (NOT p1), p2]
Running random walk in product with property : ResAllocation-PT-R003C020-08 automaton TGBA [mat=[[{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LT s109 1) (LT s115 1) (LT s116 1)), p0:(AND (GEQ s75 1) (GEQ s81 1) (GEQ s82 1)), p1:(GEQ s28 1), p3:(AND (GEQ s41 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 83 steps with 41 reset in 0 ms.
FORMULA ResAllocation-PT-R003C020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-08 finished in 718 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 98 transition count 61
Applied a total of 39 rules in 4 ms. Remains 98 /118 variables (removed 20) and now considering 61/80 (removed 19) transitions.
// Phase 1: matrix 61 rows 98 cols
[2021-05-17 15:34:49] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-17 15:34:49] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 61 rows 98 cols
[2021-05-17 15:34:49] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-17 15:34:50] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2021-05-17 15:34:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 98 cols
[2021-05-17 15:34:50] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-17 15:34:51] [INFO ] Dead Transitions using invariants and state equation in 907 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/118 places, 61/80 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C020-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s69 1) (GEQ s72 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-09 finished in 1825 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p1 U (((X(p3)||G(p4))&&p2)||G(p1)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 0 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:51] [INFO ] Computed 58 place invariants in 0 ms
[2021-05-17 15:34:51] [INFO ] Implicit Places using invariants in 74 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:51] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-17 15:34:51] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Starting structural reductions, iteration 1 : 117/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:51] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-17 15:34:51] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 446 ms :[true, (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p4) (NOT p3)), (NOT p4), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)))]
Running random walk in product with property : ResAllocation-PT-R003C020-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p4) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p4 p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p4) p1), acceptance={} source=3 dest: 6}, { cond=(AND p2 p4 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 (NOT p4) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p4 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p4) p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 p2 p4 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p4) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p4) p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p4 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p4) p1 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p4 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) p4 p1 (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p4) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p4 p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p4) p1 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p4 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND p4 (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p4), acceptance={} source=8 dest: 0}, { cond=p4, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND p2 (NOT p4) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p4) p1), acceptance={} source=9 dest: 3}, { cond=(AND p2 p4 p1), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p4) p1), acceptance={} source=9 dest: 6}, { cond=(AND p2 p4 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p4 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p4 p1), acceptance={} source=9 dest: 9}]], initial=2, aps=[p3:(GEQ s1 1), p2:(AND (LT s1 1) (GEQ s11 1) (GEQ s14 1) (GEQ s17 1)), p1:(AND (LT s1 1) (GEQ s11 1) (GEQ s14 1) (GEQ s17 1)), p4:(OR (LT s11 1) (LT s14 1) (LT s17 1)), p0:(AND (GEQ s81 1) (GEQ s84 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, 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 ResAllocation-PT-R003C020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-11 finished in 798 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:51] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-17 15:34:52] [INFO ] Implicit Places using invariants in 55 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:52] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:52] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 117/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:52] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-17 15:34:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C020-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 330 steps with 121 reset in 2 ms.
FORMULA ResAllocation-PT-R003C020-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-12 finished in 323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 118 cols
[2021-05-17 15:34:52] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:52] [INFO ] Implicit Places using invariants in 59 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:52] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:52] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 117/118 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2021-05-17 15:34:52] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:52] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 2 iterations. Remains : 117/118 places, 80/80 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C020-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s33 1) (GEQ s36 1) (GEQ s39 1)), p1:(OR (AND (GEQ s59 1) (GEQ s62 1) (GEQ s65 1)) (LT s65 1) (LT s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2281 reset in 376 ms.
Stack based approach found an accepted trace after 10944 steps with 247 reset with depth 58 and stack size 53 in 51 ms.
FORMULA ResAllocation-PT-R003C020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-14 finished in 720 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 100 transition count 62
Applied a total of 36 rules in 7 ms. Remains 100 /118 variables (removed 18) and now considering 62/80 (removed 18) transitions.
// Phase 1: matrix 62 rows 100 cols
[2021-05-17 15:34:53] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-17 15:34:53] [INFO ] Implicit Places using invariants in 87 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
[2021-05-17 15:34:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 99 cols
[2021-05-17 15:34:53] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-17 15:34:53] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 99/118 places, 62/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-17 15:34:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 99 cols
[2021-05-17 15:34:53] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-17 15:34:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 99/118 places, 62/80 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C020-15 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:(AND (GEQ s96 1) (GEQ s78 1) (GEQ s81 1) (GEQ s84 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-15 finished in 338 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621265693993
--------------------
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="ResAllocation-PT-R003C020"
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 ResAllocation-PT-R003C020, 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 r178-tajo-162089416300757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C020.tgz
mv ResAllocation-PT-R003C020 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 ;