About the Execution of ITS-Tools for Diffusion2D-PT-D50N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16244.563 | 3600000.00 | 9440151.00 | 17572.30 | FFFF?FFFFFFFFFFF | 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-162048875100221.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-D50N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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 4.1K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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-D50N100-00
FORMULA_NAME Diffusion2D-PT-D50N100-01
FORMULA_NAME Diffusion2D-PT-D50N100-02
FORMULA_NAME Diffusion2D-PT-D50N100-03
FORMULA_NAME Diffusion2D-PT-D50N100-04
FORMULA_NAME Diffusion2D-PT-D50N100-05
FORMULA_NAME Diffusion2D-PT-D50N100-06
FORMULA_NAME Diffusion2D-PT-D50N100-07
FORMULA_NAME Diffusion2D-PT-D50N100-08
FORMULA_NAME Diffusion2D-PT-D50N100-09
FORMULA_NAME Diffusion2D-PT-D50N100-10
FORMULA_NAME Diffusion2D-PT-D50N100-11
FORMULA_NAME Diffusion2D-PT-D50N100-12
FORMULA_NAME Diffusion2D-PT-D50N100-13
FORMULA_NAME Diffusion2D-PT-D50N100-14
FORMULA_NAME Diffusion2D-PT-D50N100-15
=== Now, execution of the tool begins
BK_START 1620567758314
Running Version 0
[2021-05-09 13:42:40] [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 13:42:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:42:40] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2021-05-09 13:42:40] [INFO ] Transformed 2500 places.
[2021-05-09 13:42:40] [INFO ] Transformed 19404 transitions.
[2021-05-09 13:42:40] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 490 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 13:42:40] [INFO ] Initial state test concluded for 1 properties.
FORMULA Diffusion2D-PT-D50N100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 797 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 13:42:41] [INFO ] Computed 1 place invariants in 187 ms
[2021-05-09 13:42:42] [INFO ] Implicit Places using invariants in 635 ms returned []
Implicit Place search using SMT only with invariants took 663 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:42:42] [INFO ] Computed 1 place invariants in 112 ms
[2021-05-09 13:42:50] [INFO ] Dead Transitions using invariants and state equation in 8510 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
[2021-05-09 13:42:51] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 13:42:51] [INFO ] Flatten gal took : 742 ms
FORMULA Diffusion2D-PT-D50N100-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:42:52] [INFO ] Flatten gal took : 431 ms
[2021-05-09 13:42:53] [INFO ] Input system was already deterministic with 19404 transitions.
Incomplete random walk after 100046 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=1250 ) properties (out of 26) seen :6
Running SMT prover for 20 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:42:53] [INFO ] Computed 1 place invariants in 111 ms
[2021-05-09 13:42:54] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2021-05-09 13:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 13:43:09] [INFO ] [Real]Absence check using state equation in 14034 ms returned unsat :0 sat :20 real:0
Attempting to minimize the solution found.
Minimization took 7447 ms.
[2021-05-09 13:43:16] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :20 real:0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U X(G(p1)))&&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 618 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 13:43:17] [INFO ] Computed 1 place invariants in 81 ms
[2021-05-09 13:43:17] [INFO ] Implicit Places using invariants in 383 ms returned []
Implicit Place search using SMT only with invariants took 384 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:43:17] [INFO ] Computed 1 place invariants in 86 ms
[2021-05-09 13:43:25] [INFO ] Dead Transitions using invariants and state equation in 7659 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : Diffusion2D-PT-D50N100-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LT s1648 1), p0:(GEQ s2012 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25060 steps with 0 reset in 1197 ms.
FORMULA Diffusion2D-PT-D50N100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-00 finished in 10234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(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 410 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 13:43:27] [INFO ] Computed 1 place invariants in 86 ms
[2021-05-09 13:43:27] [INFO ] Implicit Places using invariants in 343 ms returned []
Implicit Place search using SMT only with invariants took 344 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:43:27] [INFO ] Computed 1 place invariants in 86 ms
[2021-05-09 13:43:35] [INFO ] Dead Transitions using invariants and state equation in 7973 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N100-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s402 1), p1:(GEQ s643 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6 reset in 3964 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 4 ms.
FORMULA Diffusion2D-PT-D50N100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-01 finished in 12893 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(G(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 424 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 13:43:40] [INFO ] Computed 1 place invariants in 128 ms
[2021-05-09 13:43:40] [INFO ] Implicit Places using invariants in 411 ms returned []
Implicit Place search using SMT only with invariants took 412 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:43:40] [INFO ] Computed 1 place invariants in 83 ms
[2021-05-09 13:43:48] [INFO ] Dead Transitions using invariants and state equation in 7425 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Diffusion2D-PT-D50N100-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1289 1), p1:(GEQ s2296 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-02 finished in 8491 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||G(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 423 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 13:43:48] [INFO ] Computed 1 place invariants in 80 ms
[2021-05-09 13:43:49] [INFO ] Implicit Places using invariants in 339 ms returned []
Implicit Place search using SMT only with invariants took 348 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:43:49] [INFO ] Computed 1 place invariants in 117 ms
[2021-05-09 13:43:56] [INFO ] Dead Transitions using invariants and state equation in 7479 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s938 1), p0:(GEQ s2222 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 4437 ms.
Stack based approach found an accepted trace after 221 steps with 0 reset with depth 222 and stack size 222 in 5 ms.
FORMULA Diffusion2D-PT-D50N100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-03 finished in 12882 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((X(F(p0))&&G(p1)))||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 412 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 13:44:01] [INFO ] Computed 1 place invariants in 101 ms
[2021-05-09 13:44:01] [INFO ] Implicit Places using invariants in 355 ms returned []
Implicit Place search using SMT only with invariants took 363 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:44:02] [INFO ] Computed 1 place invariants in 86 ms
[2021-05-09 13:44:09] [INFO ] Dead Transitions using invariants and state equation in 7598 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p2:(LT s334 1), p1:(LT s1825 1), p0:(LT s1484 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2297 ms.
Product exploration explored 100000 steps with 50000 reset in 2426 ms.
Knowledge obtained : [p2, p1, p0]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 2243 ms.
Product exploration explored 100000 steps with 50000 reset in 2125 ms.
Applying partial POR strategy [true, false, true, false, false, true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 3 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 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 43 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 83 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2021-05-09 13:44:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 13:44:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:44:19] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Product exploration explored 100000 steps with 50000 reset in 2125 ms.
Product exploration explored 100000 steps with 50000 reset in 2201 ms.
[2021-05-09 13:44:24] [INFO ] Flatten gal took : 369 ms
[2021-05-09 13:44:25] [INFO ] Flatten gal took : 388 ms
[2021-05-09 13:44:25] [INFO ] Time to serialize gal into /tmp/LTL427641162123599358.gal : 107 ms
[2021-05-09 13:44:25] [INFO ] Time to serialize properties into /tmp/LTL14044715628939669912.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/LTL427641162123599358.gal, -t, CGAL, -LTL, /tmp/LTL14044715628939669912.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/LTL427641162123599358.gal -t CGAL -LTL /tmp/LTL14044715628939669912.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X((X(F("(cAMP__37_41_<1)")))&&(G("(cAMP__43_33_<1)"))))||(F("(cAMP__16_41_<1)")))))
Formula 0 simplified : !X(X(XF"(cAMP__37_41_<1)" & G"(cAMP__43_33_<1)") | F"(cAMP__16_41_<1)")
Detected timeout of ITS tools.
[2021-05-09 13:44:40] [INFO ] Flatten gal took : 347 ms
[2021-05-09 13:44:40] [INFO ] Applying decomposition
[2021-05-09 13:44:41] [INFO ] Flatten gal took : 354 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/graph18326784494214236508.txt, -o, /tmp/graph18326784494214236508.bin, -w, /tmp/graph18326784494214236508.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/graph18326784494214236508.bin, -l, -1, -v, -w, /tmp/graph18326784494214236508.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:44:41] [INFO ] Decomposing Gal with order
[2021-05-09 13:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:44:43] [INFO ] Removed a total of 13546 redundant transitions.
[2021-05-09 13:44:43] [INFO ] Flatten gal took : 1031 ms
[2021-05-09 13:44:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 137 ms.
[2021-05-09 13:44:44] [INFO ] Time to serialize gal into /tmp/LTL2201996341006833482.gal : 77 ms
[2021-05-09 13:44:44] [INFO ] Time to serialize properties into /tmp/LTL750228836819166189.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/LTL2201996341006833482.gal, -t, CGAL, -LTL, /tmp/LTL750228836819166189.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/LTL2201996341006833482.gal -t CGAL -LTL /tmp/LTL750228836819166189.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X((X(F("(i14.i1.u213.cAMP__37_41_<1)")))&&(G("(i16.i1.u256.cAMP__43_33_<1)"))))||(F("(i9.i2.u58.cAMP__16_41_<1)")))))
Formula 0 simplified : !X(X(XF"(i14.i1.u213.cAMP__37_41_<1)" & G"(i16.i1.u256.cAMP__43_33_<1)") | F"(i9.i2.u58.cAMP__16_41_<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17643143078448034040
[2021-05-09 13:44:59] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17643143078448034040
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/ltsmin17643143078448034040]
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/ltsmin17643143078448034040] 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/ltsmin17643143078448034040] 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-D50N100-04 finished in 59142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((G(p1) U 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.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 14 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 31 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 13:45:00] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 13:45:00] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 13:45:00] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:00] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-09 13:45:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 13:45:00] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 13:45:00] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-05 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=0 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=5 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s2 1), p1:(GEQ s0 1), p0:(LT s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-05 finished in 336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)&&(p1||G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 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.
Applied a total of 0 rules in 402 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 13:45:01] [INFO ] Computed 1 place invariants in 86 ms
[2021-05-09 13:45:01] [INFO ] Implicit Places using invariants in 348 ms returned []
Implicit Place search using SMT only with invariants took 350 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:45:01] [INFO ] Computed 1 place invariants in 92 ms
[2021-05-09 13:45:09] [INFO ] Dead Transitions using invariants and state equation in 8021 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s849 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-06 finished in 8873 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 6 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 21 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 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 13:45:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 13:45:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-07 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-D50N100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-07 finished in 103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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 7 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 20 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 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-09 13:45:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-09 finished in 88 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 6 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 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 13:45:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:09] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-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-D50N100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-10 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], 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 356 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 13:45:10] [INFO ] Computed 1 place invariants in 162 ms
[2021-05-09 13:45:10] [INFO ] Implicit Places using invariants in 473 ms returned []
Implicit Place search using SMT only with invariants took 474 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:45:10] [INFO ] Computed 1 place invariants in 85 ms
[2021-05-09 13:45:19] [INFO ] Dead Transitions using invariants and state equation in 8633 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Diffusion2D-PT-D50N100-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=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1464 1), p1:(AND (GEQ s377 1) (GEQ s113 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1227 steps with 1 reset in 57 ms.
FORMULA Diffusion2D-PT-D50N100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-11 finished in 9718 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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 6 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 13:45:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:19] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:19] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 13:45:19] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-09 13:45:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 13:45:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 13:45:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-12 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G((G((p1&&F(p2))) U 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 387 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 13:45:20] [INFO ] Computed 1 place invariants in 85 ms
[2021-05-09 13:45:20] [INFO ] Implicit Places using invariants in 371 ms returned []
Implicit Place search using SMT only with invariants took 372 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 13:45:20] [INFO ] Computed 1 place invariants in 85 ms
[2021-05-09 13:45:28] [INFO ] Dead Transitions using invariants and state equation in 7840 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p3), (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D50N100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 5}, { cond=(OR p3 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s2051 1), p3:(LT s1859 1), p1:(GEQ s1547 1), p2:(GEQ s1324 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 13032 steps with 0 reset in 443 ms.
FORMULA Diffusion2D-PT-D50N100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-15 finished in 9292 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17100004628819189116
[2021-05-09 13:45:29] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2021-05-09 13:45:29] [INFO ] Applying decomposition
[2021-05-09 13:45:29] [INFO ] Built C files in 262ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17100004628819189116
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/ltsmin17100004628819189116]
[2021-05-09 13:45:29] [INFO ] Flatten gal took : 500 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/graph8409673685215567524.txt, -o, /tmp/graph8409673685215567524.bin, -w, /tmp/graph8409673685215567524.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/graph8409673685215567524.bin, -l, -1, -v, -w, /tmp/graph8409673685215567524.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:45:30] [INFO ] Decomposing Gal with order
[2021-05-09 13:45:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:45:32] [INFO ] Removed a total of 13388 redundant transitions.
[2021-05-09 13:45:32] [INFO ] Flatten gal took : 945 ms
[2021-05-09 13:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 53 ms.
[2021-05-09 13:45:32] [INFO ] Time to serialize gal into /tmp/LTLFireability1041621204323948620.gal : 62 ms
[2021-05-09 13:45:32] [INFO ] Time to serialize properties into /tmp/LTLFireability15383430477656210465.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/LTLFireability1041621204323948620.gal, -t, CGAL, -LTL, /tmp/LTLFireability15383430477656210465.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/LTLFireability1041621204323948620.gal -t CGAL -LTL /tmp/LTLFireability15383430477656210465.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X((X(F("(i18.u203.cAMP__37_41_<1)")))&&(G("(i15.u254.cAMP__43_33_<1)"))))||(F("(i3.u46.cAMP__16_41_<1)")))))
Formula 0 simplified : !X(X(XF"(i18.u203.cAMP__37_41_<1)" & G"(i15.u254.cAMP__43_33_<1)") | F"(i3.u46.cAMP__16_41_<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/ltsmin17100004628819189116] killed by timeout after 27 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/ltsmin17100004628819189116] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 14:06:29] [INFO ] Flatten gal took : 359 ms
[2021-05-09 14:06:29] [INFO ] Time to serialize gal into /tmp/LTLFireability8657917426624077679.gal : 48 ms
[2021-05-09 14:06:29] [INFO ] Time to serialize properties into /tmp/LTLFireability6733929625729217244.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/LTLFireability8657917426624077679.gal, -t, CGAL, -LTL, /tmp/LTLFireability6733929625729217244.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/LTLFireability8657917426624077679.gal -t CGAL -LTL /tmp/LTLFireability6733929625729217244.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X((X(F("(cAMP__37_41_<1)")))&&(G("(cAMP__43_33_<1)"))))||(F("(cAMP__16_41_<1)")))))
Formula 0 simplified : !X(X(XF"(cAMP__37_41_<1)" & G"(cAMP__43_33_<1)") | F"(cAMP__16_41_<1)")
Detected timeout of ITS tools.
[2021-05-09 14:27:27] [INFO ] Flatten gal took : 410 ms
[2021-05-09 14:27:29] [INFO ] Input system was already deterministic with 19404 transitions.
[2021-05-09 14:27:29] [INFO ] Transformed 2500 places.
[2021-05-09 14:27:29] [INFO ] Transformed 19404 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 14:27:31] [INFO ] Time to serialize gal into /tmp/LTLFireability17565434664385278410.gal : 33 ms
[2021-05-09 14:27:31] [INFO ] Time to serialize properties into /tmp/LTLFireability4052352510993335271.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability17565434664385278410.gal, -t, CGAL, -LTL, /tmp/LTLFireability4052352510993335271.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability17565434664385278410.gal -t CGAL -LTL /tmp/LTLFireability4052352510993335271.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X((X(F("(cAMP__37_41_<1)")))&&(G("(cAMP__43_33_<1)"))))||(F("(cAMP__16_41_<1)")))))
Formula 0 simplified : !X(X(XF"(cAMP__37_41_<1)" & G"(cAMP__43_33_<1)") | F"(cAMP__16_41_<1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D50N100"
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-D50N100, 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-162048875100221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N100.tgz
mv Diffusion2D-PT-D50N100 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 ;