About the Execution of ITS-Tools for SquareGrid-PT-020102
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1303.292 | 72759.00 | 84927.00 | 408.00 | FFFFTFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745900357.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SquareGrid-PT-020102, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745900357
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K 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 109K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 19:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 19:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 55K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SquareGrid-PT-020102-00
FORMULA_NAME SquareGrid-PT-020102-01
FORMULA_NAME SquareGrid-PT-020102-02
FORMULA_NAME SquareGrid-PT-020102-03
FORMULA_NAME SquareGrid-PT-020102-04
FORMULA_NAME SquareGrid-PT-020102-05
FORMULA_NAME SquareGrid-PT-020102-06
FORMULA_NAME SquareGrid-PT-020102-07
FORMULA_NAME SquareGrid-PT-020102-08
FORMULA_NAME SquareGrid-PT-020102-09
FORMULA_NAME SquareGrid-PT-020102-10
FORMULA_NAME SquareGrid-PT-020102-11
FORMULA_NAME SquareGrid-PT-020102-12
FORMULA_NAME SquareGrid-PT-020102-13
FORMULA_NAME SquareGrid-PT-020102-14
FORMULA_NAME SquareGrid-PT-020102-15
=== Now, execution of the tool begins
BK_START 1621185912100
Running Version 0
[2021-05-16 17:25:13] [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-16 17:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 17:25:13] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-16 17:25:13] [INFO ] Transformed 68 places.
[2021-05-16 17:25:13] [INFO ] Transformed 72 transitions.
[2021-05-16 17:25:13] [INFO ] Parsed PT model containing 68 places and 72 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 17:25:13] [INFO ] Initial state test concluded for 3 properties.
FORMULA SquareGrid-PT-020102-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:13] [INFO ] Computed 29 place invariants in 12 ms
[2021-05-16 17:25:13] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:13] [INFO ] Computed 29 place invariants in 8 ms
[2021-05-16 17:25:13] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 4 ms
[2021-05-16 17:25:14] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
[2021-05-16 17:25:14] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-16 17:25:14] [INFO ] Flatten gal took : 30 ms
FORMULA SquareGrid-PT-020102-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 17:25:14] [INFO ] Flatten gal took : 11 ms
[2021-05-16 17:25:14] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 23 properties in 4 ms. (steps per millisecond=21 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p0)))&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-16 17:25:14] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 9 ms
[2021-05-16 17:25:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:14] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : SquareGrid-PT-020102-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s43 1) (LT s66 1)), p1:(AND (GEQ s30 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2492 steps with 0 reset in 28 ms.
FORMULA SquareGrid-PT-020102-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-00 finished in 473 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 5 ms
[2021-05-16 17:25:14] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2021-05-16 17:25:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:14] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-16 17:25:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SquareGrid-PT-020102-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s65 1)), p0:(AND (GEQ s0 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-020102-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-01 finished in 221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:15] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:15] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:15] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:15] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:15] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SquareGrid-PT-020102-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s24 1) (LT s66 1)), p1:(OR (LT s10 1) (LT s64 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 6 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-020102-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-02 finished in 225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1)&&(F(p2)||X(F(p3))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:15] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:15] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:15] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-16 17:25:15] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:15] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : SquareGrid-PT-020102-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s56 1)), p2:(OR (LT s44 1) (LT s60 1)), p1:(OR (LT s13 1) (LT s49 1)), p3:(OR (LT s11 1) (LT s65 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4385 reset in 422 ms.
Product exploration explored 100000 steps with 4411 reset in 481 ms.
Knowledge obtained : [(NOT p0), (NOT p2), (NOT p1), p3]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 4336 reset in 326 ms.
Product exploration explored 100000 steps with 4390 reset in 344 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2021-05-16 17:25:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:17] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-16 17:25:17] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Product exploration explored 100000 steps with 4376 reset in 437 ms.
Product exploration explored 100000 steps with 4387 reset in 390 ms.
[2021-05-16 17:25:18] [INFO ] Flatten gal took : 7 ms
[2021-05-16 17:25:18] [INFO ] Flatten gal took : 8 ms
[2021-05-16 17:25:18] [INFO ] Time to serialize gal into /tmp/LTL14971914307456169702.gal : 3 ms
[2021-05-16 17:25:18] [INFO ] Time to serialize properties into /tmp/LTL10007137169011409825.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/LTL14971914307456169702.gal, -t, CGAL, -LTL, /tmp/LTL10007137169011409825.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/LTL14971914307456169702.gal -t CGAL -LTL /tmp/LTL10007137169011409825.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((X("((p1ol_1_2<1)||(pb1_1_2<1))"))&&("((p1il_2_1<1)||(pb3_1_1<1))"))&&((F("((p4ol_1_1<1)||(pb4_1_1<1))"))||(X(F("((p1o_2_2<1)||(pbl_1_2<1))")))))))
Formula 0 simplified : !F("((p1il_2_1<1)||(pb3_1_1<1))" & X"((p1ol_1_2<1)||(pb1_1_2<1))" & (F"((p4ol_1_1<1)||(pb4_1_1<1))" | XF"((p1o_2_2<1)||(pbl_1_2<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 568 deadlock states
Detected timeout of ITS tools.
[2021-05-16 17:25:33] [INFO ] Flatten gal took : 6 ms
[2021-05-16 17:25:33] [INFO ] Applying decomposition
[2021-05-16 17:25:33] [INFO ] Flatten gal took : 5 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/graph3402481380265342434.txt, -o, /tmp/graph3402481380265342434.bin, -w, /tmp/graph3402481380265342434.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/graph3402481380265342434.bin, -l, -1, -v, -w, /tmp/graph3402481380265342434.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 17:25:33] [INFO ] Decomposing Gal with order
[2021-05-16 17:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 17:25:33] [INFO ] Removed a total of 64 redundant transitions.
[2021-05-16 17:25:33] [INFO ] Flatten gal took : 29 ms
[2021-05-16 17:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 17:25:33] [INFO ] Time to serialize gal into /tmp/LTL15667213337322309098.gal : 4 ms
[2021-05-16 17:25:33] [INFO ] Time to serialize properties into /tmp/LTL2559815219387085561.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/LTL15667213337322309098.gal, -t, CGAL, -LTL, /tmp/LTL2559815219387085561.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/LTL15667213337322309098.gal -t CGAL -LTL /tmp/LTL2559815219387085561.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(((X("((i2.u6.p1ol_1_2<1)||(i2.u25.pb1_1_2<1))"))&&("((i3.u0.p1il_2_1<1)||(i0.u24.pb3_1_1<1))"))&&((F("((i0.u20.p4ol_1_1<1)||(i0.u24.pb4_1_1<1))"))||(X(F("((i2.u7.p1o_2_2<1)||(i2.u25.pbl_1_2<1))")))))))
Formula 0 simplified : !F("((i3.u0.p1il_2_1<1)||(i0.u24.pb3_1_1<1))" & X"((i2.u6.p1ol_1_2<1)||(i2.u25.pb1_1_2<1))" & (F"((i0.u20.p4ol_1_1<1)||(i0.u24.pb4_1_1<1))" | XF"((i2.u7.p1o_2_2<1)||(i2.u25.pbl_1_2<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 568 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7363467027937062785
[2021-05-16 17:25:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7363467027937062785
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7363467027937062785]
Compilation finished in 393 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7363467027937062785]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((X((LTLAPp0==true))&&(LTLAPp1==true)&&(<>((LTLAPp2==true))||X(<>((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7363467027937062785]
LTSmin run took 222 ms.
FORMULA SquareGrid-PT-020102-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-05 finished in 33982 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0||G(p1)||(!p1 U (p2||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:49] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:49] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:49] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:49] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:49] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:25:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 48 ms :[false, false]
Running random walk in product with property : SquareGrid-PT-020102-07 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s65 1)), p2:(AND (OR (LT s35 1) (LT s67 1)) (OR (LT s32 1) (LT s64 1))), p1:(AND (GEQ s35 1) (GEQ s67 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 41744 reset in 214 ms.
Product exploration explored 100000 steps with 42059 reset in 278 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[false, false]
Product exploration explored 100000 steps with 41553 reset in 241 ms.
Product exploration explored 100000 steps with 41746 reset in 259 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 47 ms :[false, false]
Support contains 6 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2021-05-16 17:25:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:25:50] [INFO ] Computed 29 place invariants in 9 ms
[2021-05-16 17:25:50] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Product exploration explored 100000 steps with 42083 reset in 395 ms.
Product exploration explored 100000 steps with 41722 reset in 421 ms.
[2021-05-16 17:25:51] [INFO ] Flatten gal took : 6 ms
[2021-05-16 17:25:51] [INFO ] Flatten gal took : 6 ms
[2021-05-16 17:25:51] [INFO ] Time to serialize gal into /tmp/LTL10016211685284756585.gal : 1 ms
[2021-05-16 17:25:51] [INFO ] Time to serialize properties into /tmp/LTL14191123206400817899.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/LTL10016211685284756585.gal, -t, CGAL, -LTL, /tmp/LTL14191123206400817899.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/LTL10016211685284756585.gal -t CGAL -LTL /tmp/LTL14191123206400817899.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((p4i_2_2>=1)&&(pbl_2_2>=1))"))||(("((p4i_2_2<1)||(pbl_2_2<1))")U(("(((p4i_2_2<1)||(pbl_2_2<1))&&((p4i_1_1<1)||(pbl_1_1<1)))")||(G("((p4i_2_2<1)||(pbl_2_2<1))")))))||("((p1i_1_2>=1)&&(pbl_1_2>=1))")))))
Formula 0 simplified : !XF("((p1i_1_2>=1)&&(pbl_1_2>=1))" | G"((p4i_2_2>=1)&&(pbl_2_2>=1))" | ("((p4i_2_2<1)||(pbl_2_2<1))" U ("(((p4i_2_2<1)||(pbl_2_2<1))&&((p4i_1_1<1)||(pbl_1_1<1)))" | G"((p4i_2_2<1)||(pbl_2_2<1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 568 deadlock states
Detected timeout of ITS tools.
[2021-05-16 17:26:06] [INFO ] Flatten gal took : 5 ms
[2021-05-16 17:26:06] [INFO ] Applying decomposition
[2021-05-16 17:26:06] [INFO ] Flatten gal took : 5 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/graph8937249804042800683.txt, -o, /tmp/graph8937249804042800683.bin, -w, /tmp/graph8937249804042800683.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/graph8937249804042800683.bin, -l, -1, -v, -w, /tmp/graph8937249804042800683.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 17:26:06] [INFO ] Decomposing Gal with order
[2021-05-16 17:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 17:26:06] [INFO ] Removed a total of 64 redundant transitions.
[2021-05-16 17:26:06] [INFO ] Flatten gal took : 10 ms
[2021-05-16 17:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 17:26:06] [INFO ] Time to serialize gal into /tmp/LTL15956631883267024328.gal : 2 ms
[2021-05-16 17:26:06] [INFO ] Time to serialize properties into /tmp/LTL9742926233961315341.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/LTL15956631883267024328.gal, -t, CGAL, -LTL, /tmp/LTL9742926233961315341.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/LTL15956631883267024328.gal -t CGAL -LTL /tmp/LTL9742926233961315341.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(((G("((i3.u16.p4i_2_2>=1)&&(i3.u27.pbl_2_2>=1))"))||(("((i3.u16.p4i_2_2<1)||(i3.u27.pbl_2_2<1))")U(("(((i3.u16.p4i_2_2<1)||(i3.u27.pbl_2_2<1))&&((i0.u17.p4i_1_1<1)||(i0.u24.pbl_1_1<1)))")||(G("((i3.u16.p4i_2_2<1)||(i3.u27.pbl_2_2<1))")))))||("((i1.u2.p1i_1_2>=1)&&(i1.u25.pbl_1_2>=1))")))))
Formula 0 simplified : !XF("((i1.u2.p1i_1_2>=1)&&(i1.u25.pbl_1_2>=1))" | G"((i3.u16.p4i_2_2>=1)&&(i3.u27.pbl_2_2>=1))" | ("((i3.u16.p4i_2_2<1)||(i3.u27.pbl_2_2<1))" U ("(((i3.u16.p4i_2_2<1)||(i3.u27.pbl_2_2<1))&&((i0.u17.p4i_1_1<1)||(i0.u24.pbl_1_1<1)))" | G"((i3.u16.p4i_2_2<1)||(i3.u27.pbl_2_2<1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 568 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17598839258334661214
[2021-05-16 17:26:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17598839258334661214
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17598839258334661214]
Compilation finished in 326 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17598839258334661214]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))||(LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17598839258334661214]
LTSmin run took 128 ms.
FORMULA SquareGrid-PT-020102-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-07 finished in 32929 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2021-05-16 17:26:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-020102-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s34 1) (GEQ s66 1)), p0:(AND (GEQ s23 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15772 steps with 317 reset in 49 ms.
FORMULA SquareGrid-PT-020102-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-10 finished in 244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)&&X(F(p2))&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 5 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : SquareGrid-PT-020102-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (LT s46 1) (LT s62 1)), p2:(AND (GEQ s34 1) (GEQ s66 1)), p0:(AND (GEQ s19 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-020102-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-11 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)||X((!p1 U p2))) U X(!p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 8 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 2 ms
[2021-05-16 17:26:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 151 ms :[p0, p0, (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (NOT p1), (NOT p2), true]
Running random walk in product with property : SquareGrid-PT-020102-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s65 1)), p1:(OR (LT s3 1) (LT s67 1)), p2:(AND (GEQ s3 1) (GEQ s67 1) (GEQ s33 1) (GEQ s65 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 35 reset in 0 ms.
FORMULA SquareGrid-PT-020102-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-12 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:22] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:22] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 17:26:23] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2021-05-16 17:26:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:23] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-13 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 s47 1) (GEQ s63 1) (OR (LT s3 1) (LT s67 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 2419 steps with 0 reset in 8 ms.
FORMULA SquareGrid-PT-020102-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-13 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((!p0||X(F((G(p2)&&p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-16 17:26:23] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-16 17:26:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-16 17:26:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SquareGrid-PT-020102-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s64 1)), p1:(AND (GEQ s0 1) (GEQ s64 1)), p2:(AND (GEQ s15 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 257 steps with 0 reset in 1 ms.
FORMULA SquareGrid-PT-020102-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-14 finished in 261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:23] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:23] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-05-16 17:26:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 68 cols
[2021-05-16 17:26:23] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-16 17:26:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-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 s4 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4763 reset in 331 ms.
Stuttering criterion allowed to conclude after 336 steps with 8 reset in 1 ms.
FORMULA SquareGrid-PT-020102-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-15 finished in 527 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621185984859
--------------------
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="SquareGrid-PT-020102"
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 SquareGrid-PT-020102, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106745900357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SquareGrid-PT-020102.tgz
mv SquareGrid-PT-020102 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 ;