About the Execution of ITS-Tools for ResAllocation-PT-R003C100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 970.836 | 87658.00 | 113710.00 | 269.90 | FFTFTFFFTFFTFFFF | 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-162089416300773.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-R003C100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416300773
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K 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:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 721K 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-R003C100-00
FORMULA_NAME ResAllocation-PT-R003C100-01
FORMULA_NAME ResAllocation-PT-R003C100-02
FORMULA_NAME ResAllocation-PT-R003C100-03
FORMULA_NAME ResAllocation-PT-R003C100-04
FORMULA_NAME ResAllocation-PT-R003C100-05
FORMULA_NAME ResAllocation-PT-R003C100-06
FORMULA_NAME ResAllocation-PT-R003C100-07
FORMULA_NAME ResAllocation-PT-R003C100-08
FORMULA_NAME ResAllocation-PT-R003C100-09
FORMULA_NAME ResAllocation-PT-R003C100-10
FORMULA_NAME ResAllocation-PT-R003C100-11
FORMULA_NAME ResAllocation-PT-R003C100-12
FORMULA_NAME ResAllocation-PT-R003C100-13
FORMULA_NAME ResAllocation-PT-R003C100-14
FORMULA_NAME ResAllocation-PT-R003C100-15
=== Now, execution of the tool begins
BK_START 1621266406231
Running Version 0
[2021-05-17 15:46:48] [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:46:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:46:49] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2021-05-17 15:46:49] [INFO ] Transformed 600 places.
[2021-05-17 15:46:49] [INFO ] Transformed 400 transitions.
[2021-05-17 15:46:49] [INFO ] Parsed PT model containing 600 places and 400 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:46:49] [INFO ] Initial state test concluded for 3 properties.
FORMULA ResAllocation-PT-R003C100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 71 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2021-05-17 15:46:49] [INFO ] Computed 300 place invariants in 21 ms
[2021-05-17 15:46:50] [INFO ] Implicit Places using invariants in 712 ms returned [595, 597, 599]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 736 ms to find 3 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:50] [INFO ] Computed 297 place invariants in 11 ms
[2021-05-17 15:46:50] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Starting structural reductions, iteration 1 : 597/600 places, 400/400 transitions.
Applied a total of 0 rules in 74 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:50] [INFO ] Computed 297 place invariants in 3 ms
[2021-05-17 15:46:51] [INFO ] Dead Transitions using invariants and state equation in 829 ms returned []
Finished structural reductions, in 2 iterations. Remains : 597/600 places, 400/400 transitions.
[2021-05-17 15:46:51] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 15:46:51] [INFO ] Flatten gal took : 111 ms
FORMULA ResAllocation-PT-R003C100-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:46:51] [INFO ] Flatten gal took : 47 ms
[2021-05-17 15:46:52] [INFO ] Input system was already deterministic with 400 transitions.
Incomplete random walk after 100000 steps, including 480 resets, run finished after 1149 ms. (steps per millisecond=87 ) properties (out of 29) seen :27
Running SMT prover for 2 properties.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:53] [INFO ] Computed 297 place invariants in 10 ms
[2021-05-17 15:46:53] [INFO ] [Real]Absence check using 297 positive place invariants in 507 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA ResAllocation-PT-R003C100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(p1) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:54] [INFO ] Computed 297 place invariants in 6 ms
[2021-05-17 15:46:54] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:54] [INFO ] Computed 297 place invariants in 12 ms
[2021-05-17 15:46:55] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:55] [INFO ] Computed 297 place invariants in 8 ms
[2021-05-17 15:46:55] [INFO ] Dead Transitions using invariants and state equation in 333 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 609 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C100-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s225 1) (GEQ s228 1) (GEQ s231 1)), p1:(AND (GEQ s553 1) (GEQ s559 1) (GEQ s560 1)), p2:(AND (OR (AND (GEQ s553 1) (GEQ s559 1) (GEQ s560 1)) (AND (GEQ s559 1) (GEQ s565 1))) (GEQ s263 1) (GEQ s266 1) (GEQ s269 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R003C100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-00 finished in 2221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||(p1&&G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:56] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:46:56] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:56] [INFO ] Computed 297 place invariants in 6 ms
[2021-05-17 15:46:57] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:57] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:46:57] [INFO ] Dead Transitions using invariants and state equation in 291 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R003C100-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(OR (LT s319 1) (LT s325 1)), p0:(AND (GEQ s463 1) (GEQ s469 1) (GEQ s319 1) (GEQ s325 1)), p2:(GEQ s268 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 234 steps with 0 reset in 6 ms.
FORMULA ResAllocation-PT-R003C100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-01 finished in 1598 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:57] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:46:58] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:58] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:46:58] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:46:58] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:46:59] [INFO ] Dead Transitions using invariants and state equation in 472 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C100-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(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={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s474 1) (AND (GEQ s169 1) (GEQ s175 1) (GEQ s176 1))), p1:(AND (GEQ s169 1) (GEQ s175 1) (GEQ s176 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]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 6 ms.
FORMULA ResAllocation-PT-R003C100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-03 finished in 1857 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 0 with 190 rules applied. Total rules applied 190 place count 502 transition count 305
Applied a total of 190 rules in 81 ms. Remains 502 /597 variables (removed 95) and now considering 305/400 (removed 95) transitions.
// Phase 1: matrix 305 rows 502 cols
[2021-05-17 15:46:59] [INFO ] Computed 297 place invariants in 6 ms
[2021-05-17 15:47:00] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 305 rows 502 cols
[2021-05-17 15:47:00] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:47:00] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2021-05-17 15:47:00] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 305 rows 502 cols
[2021-05-17 15:47:00] [INFO ] Computed 297 place invariants in 4 ms
[2021-05-17 15:47:00] [INFO ] Dead Transitions using invariants and state equation in 299 ms returned []
Finished structural reductions, in 1 iterations. Remains : 502/597 places, 305/400 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C100-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s408 1) (GEQ s413 1)), p2:(OR (LT s161 1) (LT s164 1) (LT s167 1)), p0:(AND (GEQ s5 1) (GEQ s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 508 reset in 925 ms.
Product exploration explored 100000 steps with 513 reset in 1038 ms.
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 510 reset in 984 ms.
Product exploration explored 100000 steps with 511 reset in 868 ms.
[2021-05-17 15:47:04] [INFO ] Flatten gal took : 20 ms
[2021-05-17 15:47:04] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:47:05] [INFO ] Time to serialize gal into /tmp/LTL9489624039749523593.gal : 77 ms
[2021-05-17 15:47:05] [INFO ] Time to serialize properties into /tmp/LTL4038974366754595848.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/LTL9489624039749523593.gal, -t, CGAL, -LTL, /tmp/LTL4038974366754595848.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/LTL9489624039749523593.gal -t CGAL -LTL /tmp/LTL4038974366754595848.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((r_0_2>=1)&&(r_1_2>=1))"))||(G(("((r_80_2>=1)&&(r_81_2>=1))")||(F("(((r_31_2<1)||(p_32_1<1))||(r_32_2<1))")))))))
Formula 0 simplified : !F(G"((r_0_2>=1)&&(r_1_2>=1))" | G("((r_80_2>=1)&&(r_81_2>=1))" | F"(((r_31_2<1)||(p_32_1<1))||(r_32_2<1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t131, t323, t331, t5.t4, t13.t12, t125.t124, t133.t132, t317.t316, t325.t324, t333.t332, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/293/12/305
Detected timeout of ITS tools.
[2021-05-17 15:47:20] [INFO ] Flatten gal took : 20 ms
[2021-05-17 15:47:20] [INFO ] Applying decomposition
[2021-05-17 15:47:20] [INFO ] Flatten gal took : 16 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/graph15802588176061380452.txt, -o, /tmp/graph15802588176061380452.bin, -w, /tmp/graph15802588176061380452.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/graph15802588176061380452.bin, -l, -1, -v, -w, /tmp/graph15802588176061380452.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:47:20] [INFO ] Decomposing Gal with order
[2021-05-17 15:47:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:47:20] [INFO ] Flatten gal took : 70 ms
[2021-05-17 15:47:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 15:47:20] [INFO ] Time to serialize gal into /tmp/LTL8202954571662761645.gal : 14 ms
[2021-05-17 15:47:20] [INFO ] Time to serialize properties into /tmp/LTL7323273773610822825.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/LTL8202954571662761645.gal, -t, CGAL, -LTL, /tmp/LTL7323273773610822825.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/LTL8202954571662761645.gal -t CGAL -LTL /tmp/LTL7323273773610822825.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u2.r_0_2>=1)&&(i0.u3.r_1_2>=1))"))||(G(("((i13.u88.r_80_2>=1)&&(i13.u90.r_81_2>=1))")||(F("(((i5.u36.r_31_2<1)||(i5.u37.p_32_1<1))||(i5.u38.r_32_2<1))")))))))
Formula 0 simplified : !F(G"((i0.u2.r_0_2>=1)&&(i0.u3.r_1_2>=1))" | G("((i13.u88.r_80_2>=1)&&(i13.u90.r_81_2>=1))" | F"(((i5.u36.r_31_2<1)||(i5.u37.p_32_1<1))||(i5.u38.r_32_2<1))"))
Reverse transition relation is NOT exact ! Due to transitions t13_t12, t125_t124, t317_t316, t333_t332, i0.t5_t4, i0.t11, i0.u2.t3, i5.t133_t132, i5.t131, i13.t325_t324, i13.t331, i13.t323, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/293/12/305
Computing Next relation with stutter on 1.55983e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
36 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.434203,31364,1,0,36188,949,5155,51948,995,2545,38289
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R003C100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResAllocation-PT-R003C100-05 finished in 21570 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 14 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:21] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:47:21] [INFO ] Implicit Places using invariants in 442 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:21] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:47:22] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:22] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:47:22] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C100-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s18 1) (OR (LT s235 1) (LT s241 1))), p0:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA ResAllocation-PT-R003C100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-06 finished in 1485 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 497 transition count 300
Applied a total of 200 rules in 34 ms. Remains 497 /597 variables (removed 100) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 497 cols
[2021-05-17 15:47:22] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:47:23] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 300 rows 497 cols
[2021-05-17 15:47:23] [INFO ] Computed 297 place invariants in 3 ms
[2021-05-17 15:47:23] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2021-05-17 15:47:23] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 300 rows 497 cols
[2021-05-17 15:47:23] [INFO ] Computed 297 place invariants in 4 ms
[2021-05-17 15:47:23] [INFO ] Dead Transitions using invariants and state equation in 275 ms returned []
Finished structural reductions, in 1 iterations. Remains : 497/597 places, 300/400 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s453 1) (GEQ s457 1) (GEQ s458 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 13 ms.
FORMULA ResAllocation-PT-R003C100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-07 finished in 1204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:23] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:47:24] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:24] [INFO ] Computed 297 place invariants in 5 ms
[2021-05-17 15:47:24] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:24] [INFO ] Computed 297 place invariants in 4 ms
[2021-05-17 15:47:25] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-09 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 s333 1) (GEQ s336 1) (GEQ s339 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 237 steps with 1 reset in 3 ms.
FORMULA ResAllocation-PT-R003C100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-09 finished in 1203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 499 transition count 302
Applied a total of 196 rules in 22 ms. Remains 499 /597 variables (removed 98) and now considering 302/400 (removed 98) transitions.
// Phase 1: matrix 302 rows 499 cols
[2021-05-17 15:47:25] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:47:25] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 302 rows 499 cols
[2021-05-17 15:47:25] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:47:25] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2021-05-17 15:47:25] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 302 rows 499 cols
[2021-05-17 15:47:25] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:47:25] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 499/597 places, 302/400 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s275 1) (LT s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 496 reset in 805 ms.
Stack based approach found an accepted trace after 304 steps with 1 reset with depth 112 and stack size 112 in 4 ms.
FORMULA ResAllocation-PT-R003C100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-10 finished in 1659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:26] [INFO ] Computed 297 place invariants in 2 ms
[2021-05-17 15:47:27] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:27] [INFO ] Computed 297 place invariants in 3 ms
[2021-05-17 15:47:27] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:27] [INFO ] Computed 297 place invariants in 4 ms
[2021-05-17 15:47:28] [INFO ] Dead Transitions using invariants and state equation in 210 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C100-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(GEQ s592 1), p2:(OR (LT s159 1) (LT s165 1) (LT s166 1)), p1:(LT s162 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 33333 reset in 897 ms.
Product exploration explored 100000 steps with 33333 reset in 1248 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 1051 ms.
Product exploration explored 100000 steps with 33333 reset in 930 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 597 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 597 transition count 400
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 98 rules in 115 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-05-17 15:47:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:47:33] [INFO ] Computed 297 place invariants in 13 ms
[2021-05-17 15:47:33] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Product exploration explored 100000 steps with 33333 reset in 3299 ms.
Product exploration explored 100000 steps with 33333 reset in 3014 ms.
[2021-05-17 15:47:39] [INFO ] Flatten gal took : 23 ms
[2021-05-17 15:47:39] [INFO ] Flatten gal took : 21 ms
[2021-05-17 15:47:39] [INFO ] Time to serialize gal into /tmp/LTL11741325006199114967.gal : 2 ms
[2021-05-17 15:47:39] [INFO ] Time to serialize properties into /tmp/LTL13725297964140034891.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/LTL11741325006199114967.gal, -t, CGAL, -LTL, /tmp/LTL13725297964140034891.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/LTL11741325006199114967.gal -t CGAL -LTL /tmp/LTL13725297964140034891.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p_98_2>=1)")||(X(("(p_27_0<1)")||(F("(((r_26_1<1)||(r_27_1<1))||(p_27_2<1))")))))))
Formula 0 simplified : !X("(p_98_2>=1)" | X("(p_27_0<1)" | F"(((r_26_1<1)||(r_27_1<1))||(p_27_2<1))"))
Detected timeout of ITS tools.
[2021-05-17 15:47:54] [INFO ] Flatten gal took : 20 ms
[2021-05-17 15:47:54] [INFO ] Applying decomposition
[2021-05-17 15:47:54] [INFO ] Flatten gal took : 19 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/graph3368966615005116485.txt, -o, /tmp/graph3368966615005116485.bin, -w, /tmp/graph3368966615005116485.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/graph3368966615005116485.bin, -l, -1, -v, -w, /tmp/graph3368966615005116485.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:47:55] [INFO ] Decomposing Gal with order
[2021-05-17 15:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:47:55] [INFO ] Flatten gal took : 57 ms
[2021-05-17 15:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 15:47:55] [INFO ] Time to serialize gal into /tmp/LTL12394401792671297239.gal : 11 ms
[2021-05-17 15:47:55] [INFO ] Time to serialize properties into /tmp/LTL3024740834389938807.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/LTL12394401792671297239.gal, -t, CGAL, -LTL, /tmp/LTL3024740834389938807.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/LTL12394401792671297239.gal -t CGAL -LTL /tmp/LTL3024740834389938807.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i13.u225.p_98_2>=1)")||(X(("(i3.u60.p_27_0<1)")||(F("(((i3.u62.r_26_1<1)||(i3.u63.r_27_1<1))||(i3.u59.p_27_2<1))")))))))
Formula 0 simplified : !X("(i13.u225.p_98_2>=1)" | X("(i3.u60.p_27_0<1)" | F"(((i3.u62.r_26_1<1)||(i3.u63.r_27_1<1))||(i3.u59.p_27_2<1))"))
Reverse transition relation is NOT exact ! Due to transitions t36, t75, t92, t115, t219, t252, t275, t276, t300, t324, t356, i0.t28, i0.t20, i0.t19, i0.i0.t4, i0.i0.t11, i0.i0.t12, i0.i0.u2.t3, i0.i2.t27, i0.i4.t35, i1.t59, i1.i0.t43, i1.i0.t44, i1.i0.t52, i1.i0.u30.t51, i1.i1.t68, i1.i1.u35.t60, i1.i1.u38.t67, i2.t91, i2.t76, i2.u47.t83, i2.u48.t84, i3.t108, i3.t107, i3.t100, i3.u54.t99, i4.t147, i4.t140, i4.i0.t116, i4.i0.t123, i4.i0.t131, i4.i0.t132, i4.i0.t139, i4.i0.u71.t124, i4.i1.u82.t148, i4.i2.t155, i5.t172, i5.t164, i5.i0.t156, i5.i1.t163, i5.i1.t171, i5.i3.t179, i5.i3.t180, i5.i3.t187, i5.i3.t188, i6.i0.t195, i6.i0.t203, i6.i1.t196, i6.i1.t204, i6.i1.t212, i6.i2.t211, i7.i0.t220, i7.i0.t235, i7.i0.t236, i7.i0.u127.t227, i7.i0.u128.t228, i7.i1.t244, i7.i2.t243, i7.i2.u140.t251, i8.t268, i8.t267, i8.t260, i8.t259, i9.t292, i9.t284, i9.t283, i9.i2.t291, i9.i2.t299, i10.t323, i10.t316, i10.t308, i10.t307, i10.u181.t315, i11.i0.t331, i11.i0.t339, i11.i0.t347, i11.i1.t332, i11.i2.t340, i11.i2.u197.t348, i12.t364, i12.i1.t355, i12.i1.t371, i12.i1.u205.t363, i12.i2.t372, i12.i2.t380, i12.i3.t379, i13.t395, i13.t388, i13.t387, i13.u226.t396, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/300/100/400
Computing Next relation with stutter on 1.55983e+12 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1160 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,11.6626,393540,1,0,740774,4612,6900,2.44859e+06,907,19637,471900
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R003C100-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R003C100-11 finished in 43468 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 498 transition count 301
Applied a total of 198 rules in 56 ms. Remains 498 /597 variables (removed 99) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2021-05-17 15:48:10] [INFO ] Computed 297 place invariants in 3 ms
[2021-05-17 15:48:10] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 301 rows 498 cols
[2021-05-17 15:48:10] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:48:11] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2021-05-17 15:48:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 301 rows 498 cols
[2021-05-17 15:48:11] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:48:11] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 498/597 places, 301/400 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s221 1) (GEQ s226 1) (GEQ s227 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 215 steps with 0 reset in 3 ms.
FORMULA ResAllocation-PT-R003C100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-12 finished in 1221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 498 transition count 301
Applied a total of 198 rules in 27 ms. Remains 498 /597 variables (removed 99) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2021-05-17 15:48:11] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:48:11] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 301 rows 498 cols
[2021-05-17 15:48:11] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:48:12] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2021-05-17 15:48:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 301 rows 498 cols
[2021-05-17 15:48:12] [INFO ] Computed 297 place invariants in 0 ms
[2021-05-17 15:48:12] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Finished structural reductions, in 1 iterations. Remains : 498/597 places, 301/400 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-14 finished in 1007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F((X(p2)&&p1)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 597 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:48:12] [INFO ] Computed 297 place invariants in 1 ms
[2021-05-17 15:48:12] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:48:12] [INFO ] Computed 297 place invariants in 4 ms
[2021-05-17 15:48:13] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 597 cols
[2021-05-17 15:48:13] [INFO ] Computed 297 place invariants in 13 ms
[2021-05-17 15:48:13] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s435 1) (GEQ s441 1) (GEQ s442 1)), p1:(AND (GEQ s435 1) (GEQ s441 1) (GEQ s442 1)), p2:(AND (GEQ s445 1) (GEQ s451 1) (GEQ s452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-15 finished in 1243 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621266493889
--------------------
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-R003C100"
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-R003C100, 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-162089416300773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 ;