About the Execution of ITS-Tools for Diffusion2D-PT-D50N010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6402.707 | 200496.00 | 417698.00 | 728.90 | 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.r083-tall-162048875100205.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 Diffusion2D-PT-D50N010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100205
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 5 16:58 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.9K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 Diffusion2D-PT-D50N010-00
FORMULA_NAME Diffusion2D-PT-D50N010-01
FORMULA_NAME Diffusion2D-PT-D50N010-02
FORMULA_NAME Diffusion2D-PT-D50N010-03
FORMULA_NAME Diffusion2D-PT-D50N010-04
FORMULA_NAME Diffusion2D-PT-D50N010-05
FORMULA_NAME Diffusion2D-PT-D50N010-06
FORMULA_NAME Diffusion2D-PT-D50N010-07
FORMULA_NAME Diffusion2D-PT-D50N010-08
FORMULA_NAME Diffusion2D-PT-D50N010-09
FORMULA_NAME Diffusion2D-PT-D50N010-10
FORMULA_NAME Diffusion2D-PT-D50N010-11
FORMULA_NAME Diffusion2D-PT-D50N010-12
FORMULA_NAME Diffusion2D-PT-D50N010-13
FORMULA_NAME Diffusion2D-PT-D50N010-14
FORMULA_NAME Diffusion2D-PT-D50N010-15
=== Now, execution of the tool begins
BK_START 1620563848362
Running Version 0
[2021-05-09 12:37:29] [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-09 12:37:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:37:30] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2021-05-09 12:37:30] [INFO ] Transformed 2500 places.
[2021-05-09 12:37:30] [INFO ] Transformed 19404 transitions.
[2021-05-09 12:37:30] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 547 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:37:30] [INFO ] Initial state test concluded for 4 properties.
FORMULA Diffusion2D-PT-D50N010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 700 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:37:31] [INFO ] Computed 1 place invariants in 161 ms
[2021-05-09 12:37:32] [INFO ] Implicit Places using invariants in 625 ms returned []
Implicit Place search using SMT only with invariants took 656 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:37:32] [INFO ] Computed 1 place invariants in 123 ms
[2021-05-09 12:37:40] [INFO ] Dead Transitions using invariants and state equation in 8618 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
[2021-05-09 12:37:41] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 12:37:41] [INFO ] Flatten gal took : 592 ms
FORMULA Diffusion2D-PT-D50N010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N010-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:37:41] [INFO ] Flatten gal took : 408 ms
[2021-05-09 12:37:42] [INFO ] Input system was already deterministic with 19404 transitions.
Finished random walk after 82695 steps, including 2 resets, run visited all 24 properties in 974 ms. (steps per millisecond=84 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&G((p1 U (p0&&X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 426 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:37:44] [INFO ] Computed 1 place invariants in 85 ms
[2021-05-09 12:37:44] [INFO ] Implicit Places using invariants in 301 ms returned []
Implicit Place search using SMT only with invariants took 302 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:37:44] [INFO ] Computed 1 place invariants in 83 ms
[2021-05-09 12:37:53] [INFO ] Dead Transitions using invariants and state equation in 8475 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N010-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s239 1), p1:(LT s643 1), p2:(LT s402 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 1405 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 3 ms.
FORMULA Diffusion2D-PT-D50N010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-01 finished in 11043 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(!p0 U (X(F((p2&&F(p3))))||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 391 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:37:55] [INFO ] Computed 1 place invariants in 95 ms
[2021-05-09 12:37:55] [INFO ] Implicit Places using invariants in 385 ms returned []
Implicit Place search using SMT only with invariants took 396 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:37:55] [INFO ] Computed 1 place invariants in 76 ms
[2021-05-09 12:38:03] [INFO ] Dead Transitions using invariants and state equation in 8204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N010-02 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=4, aps=[p3:(GEQ s1289 1), p2:(OR (GEQ s316 1) (GEQ s2296 1)), p1:(OR (GEQ s316 1) (GEQ s2296 1)), p0:(GEQ s2451 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 36 reset in 1399 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Diffusion2D-PT-D50N010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-02 finished in 10683 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 430 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:38:06] [INFO ] Computed 1 place invariants in 83 ms
[2021-05-09 12:38:06] [INFO ] Implicit Places using invariants in 321 ms returned []
Implicit Place search using SMT only with invariants took 323 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:38:06] [INFO ] Computed 1 place invariants in 82 ms
[2021-05-09 12:38:14] [INFO ] Dead Transitions using invariants and state equation in 7705 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N010-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s1035 1), p0:(GEQ s1825 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1823 ms.
Product exploration explored 100000 steps with 50000 reset in 1765 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 1870 ms.
Product exploration explored 100000 steps with 50000 reset in 1681 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 42 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 81 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
[2021-05-09 12:38:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:38:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:38:21] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/2500 places, 5/19404 transitions.
Product exploration explored 100000 steps with 50000 reset in 1507 ms.
Product exploration explored 100000 steps with 50000 reset in 1548 ms.
[2021-05-09 12:38:25] [INFO ] Flatten gal took : 383 ms
[2021-05-09 12:38:26] [INFO ] Flatten gal took : 388 ms
[2021-05-09 12:38:26] [INFO ] Time to serialize gal into /tmp/LTL6363604831202692007.gal : 212 ms
[2021-05-09 12:38:26] [INFO ] Time to serialize properties into /tmp/LTL8161951174306810189.ltl : 18 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/LTL6363604831202692007.gal, -t, CGAL, -LTL, /tmp/LTL8161951174306810189.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/LTL6363604831202692007.gal -t CGAL -LTL /tmp/LTL8161951174306810189.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(cAMP__43_33_>=1)"))||(X(F("(cAMP__29_42_<1)")))))
Formula 0 simplified : !(G"(cAMP__43_33_>=1)" | XF"(cAMP__29_42_<1)")
Detected timeout of ITS tools.
[2021-05-09 12:38:41] [INFO ] Flatten gal took : 362 ms
[2021-05-09 12:38:41] [INFO ] Applying decomposition
[2021-05-09 12:38:42] [INFO ] Flatten gal took : 384 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/graph10177547312836521444.txt, -o, /tmp/graph10177547312836521444.bin, -w, /tmp/graph10177547312836521444.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/graph10177547312836521444.bin, -l, -1, -v, -w, /tmp/graph10177547312836521444.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:38:43] [INFO ] Decomposing Gal with order
[2021-05-09 12:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:38:44] [INFO ] Removed a total of 13884 redundant transitions.
[2021-05-09 12:38:44] [INFO ] Flatten gal took : 1057 ms
[2021-05-09 12:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 142 ms.
[2021-05-09 12:38:45] [INFO ] Time to serialize gal into /tmp/LTL4915171207798675732.gal : 128 ms
[2021-05-09 12:38:45] [INFO ] Time to serialize properties into /tmp/LTL1708178907259954504.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/LTL4915171207798675732.gal, -t, CGAL, -LTL, /tmp/LTL1708178907259954504.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/LTL4915171207798675732.gal -t CGAL -LTL /tmp/LTL1708178907259954504.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i12.i1.u288.cAMP__43_33_>=1)"))||(X(F("(i6.i4.u175.cAMP__29_42_<1)")))))
Formula 0 simplified : !(G"(i12.i1.u288.cAMP__43_33_>=1)" | XF"(i6.i4.u175.cAMP__29_42_<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17218454434060745705
[2021-05-09 12:39:00] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17218454434060745705
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/ltsmin17218454434060745705]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17218454434060745705] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17218454434060745705] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Diffusion2D-PT-D50N010-04 finished in 55965 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&G((F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 34 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 52 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 12:39:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:01] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 12:39:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 12:39:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 12:39:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 9/19404 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N010-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s1 1) (LT s3 1)), p0:(LT s0 1), p2:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-05 finished in 251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 19 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-09 12:39:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 12:39:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N010-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-06 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p1 U p2)))||X((p0||F(G(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 496 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:39:02] [INFO ] Computed 1 place invariants in 82 ms
[2021-05-09 12:39:02] [INFO ] Implicit Places using invariants in 384 ms returned []
Implicit Place search using SMT only with invariants took 385 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:39:03] [INFO ] Computed 1 place invariants in 185 ms
[2021-05-09 12:39:12] [INFO ] Dead Transitions using invariants and state equation in 9637 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Diffusion2D-PT-D50N010-07 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s147 1), p2:(GEQ s483 1), p1:(GEQ s866 1), p3:(LT s1050 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1537 ms.
Stack based approach found an accepted trace after 2109 steps with 0 reset with depth 2110 and stack size 2075 in 27 ms.
FORMULA Diffusion2D-PT-D50N010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-07 finished in 12305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 501 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:39:14] [INFO ] Computed 1 place invariants in 104 ms
[2021-05-09 12:39:15] [INFO ] Implicit Places using invariants in 323 ms returned []
Implicit Place search using SMT only with invariants took 325 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:39:15] [INFO ] Computed 1 place invariants in 85 ms
[2021-05-09 12:39:23] [INFO ] Dead Transitions using invariants and state equation in 8001 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N010-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 s393 1) (GEQ s2061 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]]
Product exploration explored 100000 steps with 0 reset in 1460 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA Diffusion2D-PT-D50N010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-09 finished in 10382 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 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 17 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:24] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:24] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 12:39:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:24] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N010-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-10 finished in 103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((X(p1)&&F((p2&&X(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 504 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:39:25] [INFO ] Computed 1 place invariants in 80 ms
[2021-05-09 12:39:25] [INFO ] Implicit Places using invariants in 336 ms returned []
Implicit Place search using SMT only with invariants took 353 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:39:25] [INFO ] Computed 1 place invariants in 77 ms
[2021-05-09 12:39:33] [INFO ] Dead Transitions using invariants and state equation in 7604 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : Diffusion2D-PT-D50N010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s113 1), p2:(GEQ s1464 1), p1:(GEQ s1465 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4724 steps with 1 reset in 51 ms.
FORMULA Diffusion2D-PT-D50N010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-11 finished in 8811 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 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 16 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:33] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 12:39:33] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-09 12:39:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:39:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 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 3 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-14 finished in 108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 15 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:39:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:33] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:39:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:33] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-09 12:39:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:39:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:39:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N010-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:(OR (GEQ s1 1) (AND (GEQ s2 1) (GEQ s0 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N010-15 finished in 156 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2446381916716422447
[2021-05-09 12:39:34] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2021-05-09 12:39:34] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2446381916716422447
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/ltsmin2446381916716422447]
[2021-05-09 12:39:34] [INFO ] Applying decomposition
[2021-05-09 12:39:34] [INFO ] Flatten gal took : 458 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/graph15251668415663435718.txt, -o, /tmp/graph15251668415663435718.bin, -w, /tmp/graph15251668415663435718.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/graph15251668415663435718.bin, -l, -1, -v, -w, /tmp/graph15251668415663435718.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:39:35] [INFO ] Decomposing Gal with order
[2021-05-09 12:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:39:36] [INFO ] Removed a total of 13562 redundant transitions.
[2021-05-09 12:39:36] [INFO ] Flatten gal took : 814 ms
[2021-05-09 12:39:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 72 ms.
[2021-05-09 12:39:36] [INFO ] Time to serialize gal into /tmp/LTLFireability14498809014982486262.gal : 63 ms
[2021-05-09 12:39:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16669784582078520947.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/LTLFireability14498809014982486262.gal, -t, CGAL, -LTL, /tmp/LTLFireability16669784582078520947.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/LTLFireability14498809014982486262.gal -t CGAL -LTL /tmp/LTLFireability16669784582078520947.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i16.u254.cAMP__43_33_>=1)"))||(X(F("(i4.u142.cAMP__29_42_<1)")))))
Formula 0 simplified : !(G"(i16.u254.cAMP__43_33_>=1)" | XF"(i4.u142.cAMP__29_42_<1)")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2446381916716422447] killed by timeout after 32 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2446381916716422447] killed by timeout after 32 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6282 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,63.9548,914972,1,0,1.07856e+06,578546,52492,4.13682e+06,2547,3.06341e+06,514777
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D50N010-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1620564048858
--------------------
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="Diffusion2D-PT-D50N010"
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 Diffusion2D-PT-D50N010, 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 r083-tall-162048875100205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N010.tgz
mv Diffusion2D-PT-D50N010 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 ;