About the Execution of ITS-Tools for Diffusion2D-PT-D20N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8210.271 | 1170568.00 | 1291358.00 | 2419.30 | FFFTTFFFFFFFTFFT | 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-162048875000124.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-D20N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875000124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 178K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K 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.6K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.2M 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-D20N100-00
FORMULA_NAME Diffusion2D-PT-D20N100-01
FORMULA_NAME Diffusion2D-PT-D20N100-02
FORMULA_NAME Diffusion2D-PT-D20N100-03
FORMULA_NAME Diffusion2D-PT-D20N100-04
FORMULA_NAME Diffusion2D-PT-D20N100-05
FORMULA_NAME Diffusion2D-PT-D20N100-06
FORMULA_NAME Diffusion2D-PT-D20N100-07
FORMULA_NAME Diffusion2D-PT-D20N100-08
FORMULA_NAME Diffusion2D-PT-D20N100-09
FORMULA_NAME Diffusion2D-PT-D20N100-10
FORMULA_NAME Diffusion2D-PT-D20N100-11
FORMULA_NAME Diffusion2D-PT-D20N100-12
FORMULA_NAME Diffusion2D-PT-D20N100-13
FORMULA_NAME Diffusion2D-PT-D20N100-14
FORMULA_NAME Diffusion2D-PT-D20N100-15
=== Now, execution of the tool begins
BK_START 1620544897280
Running Version 0
[2021-05-09 07:21:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 07:21:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:21:39] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2021-05-09 07:21:39] [INFO ] Transformed 400 places.
[2021-05-09 07:21:39] [INFO ] Transformed 2964 transitions.
[2021-05-09 07:21:39] [INFO ] Parsed PT model containing 400 places and 2964 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:21:39] [INFO ] Initial state test concluded for 2 properties.
FORMULA Diffusion2D-PT-D20N100-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N100-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 75 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:39] [INFO ] Computed 1 place invariants in 42 ms
[2021-05-09 07:21:39] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:39] [INFO ] Computed 1 place invariants in 17 ms
[2021-05-09 07:21:40] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:40] [INFO ] Computed 1 place invariants in 14 ms
[2021-05-09 07:21:41] [INFO ] Dead Transitions using invariants and state equation in 1013 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
[2021-05-09 07:21:41] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 07:21:41] [INFO ] Flatten gal took : 165 ms
FORMULA Diffusion2D-PT-D20N100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N100-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:21:41] [INFO ] Flatten gal took : 101 ms
[2021-05-09 07:21:41] [INFO ] Input system was already deterministic with 2964 transitions.
Incomplete random walk after 100066 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=1389 ) properties (out of 23) seen :19
Running SMT prover for 4 properties.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:41] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-09 07:21:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 07:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:42] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2021-05-09 07:21:42] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 204 ms.
[2021-05-09 07:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 07:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:43] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2021-05-09 07:21:43] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 137 ms.
[2021-05-09 07:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 07:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:43] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2021-05-09 07:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 07:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:44] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2021-05-09 07:21:44] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 152 ms.
[2021-05-09 07:21:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 07:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:21:45] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2021-05-09 07:21:45] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(G(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 128 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:45] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-09 07:21:45] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:45] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 07:21:46] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:46] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 07:21:47] [INFO ] Dead Transitions using invariants and state equation in 900 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Diffusion2D-PT-D20N100-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ 3 s283), p1:(GT 1 s99)], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 222 steps with 0 reset in 19 ms.
FORMULA Diffusion2D-PT-D20N100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-00 finished in 1925 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2916 edges and 400 vertex of which 397 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 396 places
Ensure Unique test removed 2957 transitions
Reduce isomorphic transitions removed 2957 transitions.
Applied a total of 1 rules in 17 ms. Remains 4 /400 variables (removed 396) and now considering 7/2964 (removed 2957) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 07:21:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:21:47] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 07:21:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:21:47] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-09 07:21:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 07:21:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:21:47] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/400 places, 7/2964 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D20N100-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s1 s0), p0:(GT 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 3 ms.
FORMULA Diffusion2D-PT-D20N100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-01 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U X(p1))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:47] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-09 07:21:47] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:47] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 07:21:48] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:48] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-09 07:21:48] [INFO ] Dead Transitions using invariants and state equation in 854 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D20N100-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (LEQ 1 s188) (GT 3 s137)), p0:(LEQ 1 s188), p1:(GT s77 s104)], 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]]
Product exploration explored 100000 steps with 55 reset in 1574 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA Diffusion2D-PT-D20N100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-02 finished in 3209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||G(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:50] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-09 07:21:50] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:50] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-09 07:21:51] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:21:51] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:21:52] [INFO ] Dead Transitions using invariants and state equation in 987 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D20N100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ s157 s111) (LEQ s200 s44)), p0:(LEQ 1 s298), p1:(GT s53 s24)], 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 50000 reset in 567 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Support contains 7 out of 400 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2866 edges and 400 vertex of which 393 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 392 places
Ensure Unique test removed 2947 transitions
Reduce isomorphic transitions removed 2947 transitions.
Applied a total of 1 rules in 8 ms. Remains 8 /400 variables (removed 392) and now considering 17/2964 (removed 2947) transitions.
[2021-05-09 07:21:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 8 cols
[2021-05-09 07:21:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:21:54] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/400 places, 17/2964 transitions.
Product exploration explored 100000 steps with 50000 reset in 534 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
[2021-05-09 07:21:55] [INFO ] Flatten gal took : 72 ms
[2021-05-09 07:21:55] [INFO ] Flatten gal took : 71 ms
[2021-05-09 07:21:55] [INFO ] Time to serialize gal into /tmp/LTL10069364240848794012.gal : 36 ms
[2021-05-09 07:21:55] [INFO ] Time to serialize properties into /tmp/LTL1154509676600658918.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/LTL10069364240848794012.gal, -t, CGAL, -LTL, /tmp/LTL1154509676600658918.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/LTL10069364240848794012.gal -t CGAL -LTL /tmp/LTL1154509676600658918.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(cAMP__4_8_>=1)")||(G("(cAMP__12_3_>cAMP__11_14_)")))U("((cAMP__17_7_<=cAMP__15_20_)||(cAMP__1_10_<=cAMP__12_14_))"))))
Formula 0 simplified : !X(("(cAMP__4_8_>=1)" | G"(cAMP__12_3_>cAMP__11_14_)") U "((cAMP__17_7_<=cAMP__15_20_)||(cAMP__1_10_<=cAMP__12_14_))")
Detected timeout of ITS tools.
[2021-05-09 07:22:11] [INFO ] Flatten gal took : 63 ms
[2021-05-09 07:22:11] [INFO ] Applying decomposition
[2021-05-09 07:22:11] [INFO ] Flatten gal took : 59 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/graph831017034896799089.txt, -o, /tmp/graph831017034896799089.bin, -w, /tmp/graph831017034896799089.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/graph831017034896799089.bin, -l, -1, -v, -w, /tmp/graph831017034896799089.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:22:11] [INFO ] Decomposing Gal with order
[2021-05-09 07:22:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:22:11] [INFO ] Removed a total of 2142 redundant transitions.
[2021-05-09 07:22:11] [INFO ] Flatten gal took : 223 ms
[2021-05-09 07:22:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 32 ms.
[2021-05-09 07:22:12] [INFO ] Time to serialize gal into /tmp/LTL5451989466095184116.gal : 11 ms
[2021-05-09 07:22:12] [INFO ] Time to serialize properties into /tmp/LTL10116650446265579874.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/LTL5451989466095184116.gal, -t, CGAL, -LTL, /tmp/LTL10116650446265579874.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/LTL5451989466095184116.gal -t CGAL -LTL /tmp/LTL10116650446265579874.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gi4.gi4.gu51.cAMP__4_8_>=1)")||(G("(gu8.cAMP__12_3_>gu8.cAMP__11_14_)")))U("((gu30.cAMP__17_7_<=gu30.cAMP__15_20_)||(gu12.cAMP__1_10_<=gu12.cAMP__12_14_))"))))
Formula 0 simplified : !X(("(gi4.gi4.gu51.cAMP__4_8_>=1)" | G"(gu8.cAMP__12_3_>gu8.cAMP__11_14_)") U "((gu30.cAMP__17_7_<=gu30.cAMP__15_20_)||(gu12.cAMP__1_10_<=gu12.cAMP__12_14_))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15487245709772472456
[2021-05-09 07:22:27] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15487245709772472456
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/ltsmin15487245709772472456]
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/ltsmin15487245709772472456] 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/ltsmin15487245709772472456] 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-D20N100-04 finished in 37384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2916 edges and 400 vertex of which 397 / 400 are part of one of the 1 SCC in 4 ms
Free SCC test removed 396 places
Ensure Unique test removed 2957 transitions
Reduce isomorphic transitions removed 2957 transitions.
Applied a total of 1 rules in 15 ms. Remains 4 /400 variables (removed 396) and now considering 7/2964 (removed 2957) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 07:22:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:22:28] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 07:22:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:22:28] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-09 07:22:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 07:22:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 07:22:28] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/400 places, 7/2964 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D20N100-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s1), p0:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-05 finished in 134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 62 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:28] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:28] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:28] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:28] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:28] [INFO ] Computed 1 place invariants in 24 ms
[2021-05-09 07:22:29] [INFO ] Dead Transitions using invariants and state equation in 849 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s8 s350) (LEQ 1 s193))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-06 finished in 1458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((p1||X((F(G(p2))||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:29] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:29] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:29] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:30] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:30] [INFO ] Computed 1 place invariants in 18 ms
[2021-05-09 07:22:31] [INFO ] Dead Transitions using invariants and state equation in 917 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 157 ms :[false, (AND p1 (NOT p2)), false, false, (NOT p2), false]
Running random walk in product with property : Diffusion2D-PT-D20N100-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND p1 p0 p2), acceptance={2} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1, 2} source=4 dest: 4}, { cond=p2, acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={2} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s366 s134), p1:(GT s163 s338), p2:(LEQ s38 s294)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3923 ms.
Stack based approach found an accepted trace after 4334 steps with 0 reset with depth 4335 and stack size 4320 in 85 ms.
FORMULA Diffusion2D-PT-D20N100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-07 finished in 5582 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:35] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:35] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:35] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:35] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:35] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:36] [INFO ] Dead Transitions using invariants and state equation in 965 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-08 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s30 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6803 steps with 0 reset in 161 ms.
FORMULA Diffusion2D-PT-D20N100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-08 finished in 1777 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:37] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:37] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:37] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:37] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:37] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-09 07:22:38] [INFO ] Dead Transitions using invariants and state equation in 869 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT s367 s289)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 138 reset in 1063 ms.
Stack based approach found an accepted trace after 269 steps with 0 reset with depth 270 and stack size 270 in 2 ms.
FORMULA Diffusion2D-PT-D20N100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-09 finished in 2564 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:39] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:39] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:39] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:40] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:40] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:41] [INFO ] Dead Transitions using invariants and state equation in 956 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D20N100-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s223 s20), p1:(LEQ s185 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-10 finished in 1611 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:41] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:41] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:41] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:41] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 07:22:41] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 07:22:42] [INFO ] Dead Transitions using invariants and state equation in 964 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Diffusion2D-PT-D20N100-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s244 s158), p1:(GT 1 s103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 265 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D20N100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-13 finished in 1609 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 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2948 edges and 400 vertex of which 399 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 398 places
Ensure Unique test removed 2961 transitions
Reduce isomorphic transitions removed 2961 transitions.
Applied a total of 1 rules in 15 ms. Remains 2 /400 variables (removed 398) and now considering 3/2964 (removed 2961) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 07:22:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:22:42] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 07:22:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:22:42] [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 07:22:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 07:22:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 07:22:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/400 places, 3/2964 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s0)], 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 10 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-14 finished in 86 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16855351768028203359
[2021-05-09 07:22:43] [INFO ] Too many transitions (2964) to apply POR reductions. Disabling POR matrices.
[2021-05-09 07:22:43] [INFO ] Applying decomposition
[2021-05-09 07:22:43] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16855351768028203359
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/ltsmin16855351768028203359]
[2021-05-09 07:22:43] [INFO ] Flatten gal took : 73 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/graph6059494838707834020.txt, -o, /tmp/graph6059494838707834020.bin, -w, /tmp/graph6059494838707834020.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/graph6059494838707834020.bin, -l, -1, -v, -w, /tmp/graph6059494838707834020.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:22:43] [INFO ] Decomposing Gal with order
[2021-05-09 07:22:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:22:43] [INFO ] Removed a total of 1754 redundant transitions.
[2021-05-09 07:22:43] [INFO ] Flatten gal took : 345 ms
[2021-05-09 07:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 67 ms.
[2021-05-09 07:22:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality10700913680140561423.gal : 11 ms
[2021-05-09 07:22:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality6233401018101949062.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/LTLCardinality10700913680140561423.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6233401018101949062.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/LTLCardinality10700913680140561423.gal -t CGAL -LTL /tmp/LTLCardinality6233401018101949062.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(gi4.gi0.gu37.cAMP__4_8_>=1)")||(G("(gu7.cAMP__12_3_>gu7.cAMP__11_14_)")))U("((gu22.cAMP__17_7_<=gu22.cAMP__15_20_)||(gu23.cAMP__1_10_<=gu23.cAMP__12_14_))"))))
Formula 0 simplified : !X(("(gi4.gi0.gu37.cAMP__4_8_>=1)" | G"(gu7.cAMP__12_3_>gu7.cAMP__11_14_)") U "((gu22.cAMP__17_7_<=gu22.cAMP__15_20_)||(gu23.cAMP__1_10_<=gu23.cAMP__12_14_))")
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/ltsmin16855351768028203359] killed by timeout after 30 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/ltsmin16855351768028203359] killed by timeout after 30 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
107824 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,1078.43,7272964,1,0,6,4.33814e+07,31,0,55598,4.27132e+07,11
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D20N100-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1620546067848
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-D20N100"
export BK_EXAMINATION="LTLCardinality"
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-D20N100, examination is LTLCardinality"
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-162048875000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N100.tgz
mv Diffusion2D-PT-D20N100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;