About the Execution of ITS-Tools for Diffusion2D-PT-D40N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16239.432 | 3600000.00 | 6826301.00 | 7756.60 | FFFFFFFFFTTFFF?? | 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-162048875100180.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-D40N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.3K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.2K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.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 4.7M 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-D40N050-00
FORMULA_NAME Diffusion2D-PT-D40N050-01
FORMULA_NAME Diffusion2D-PT-D40N050-02
FORMULA_NAME Diffusion2D-PT-D40N050-03
FORMULA_NAME Diffusion2D-PT-D40N050-04
FORMULA_NAME Diffusion2D-PT-D40N050-05
FORMULA_NAME Diffusion2D-PT-D40N050-06
FORMULA_NAME Diffusion2D-PT-D40N050-07
FORMULA_NAME Diffusion2D-PT-D40N050-08
FORMULA_NAME Diffusion2D-PT-D40N050-09
FORMULA_NAME Diffusion2D-PT-D40N050-10
FORMULA_NAME Diffusion2D-PT-D40N050-11
FORMULA_NAME Diffusion2D-PT-D40N050-12
FORMULA_NAME Diffusion2D-PT-D40N050-13
FORMULA_NAME Diffusion2D-PT-D40N050-14
FORMULA_NAME Diffusion2D-PT-D40N050-15
=== Now, execution of the tool begins
BK_START 1620557060212
Running Version 0
[2021-05-09 10:44:21] [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 10:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 10:44:22] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2021-05-09 10:44:22] [INFO ] Transformed 1600 places.
[2021-05-09 10:44:22] [INFO ] Transformed 12324 transitions.
[2021-05-09 10:44:22] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 10:44:22] [INFO ] Initial state test concluded for 7 properties.
FORMULA Diffusion2D-PT-D40N050-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N050-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 516 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:23] [INFO ] Computed 1 place invariants in 128 ms
[2021-05-09 10:44:23] [INFO ] Implicit Places using invariants in 557 ms returned []
Implicit Place search using SMT only with invariants took 603 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:23] [INFO ] Computed 1 place invariants in 75 ms
[2021-05-09 10:44:28] [INFO ] Dead Transitions using invariants and state equation in 4447 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
[2021-05-09 10:44:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 10:44:29] [INFO ] Flatten gal took : 544 ms
FORMULA Diffusion2D-PT-D40N050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 10:44:29] [INFO ] Flatten gal took : 287 ms
[2021-05-09 10:44:30] [INFO ] Input system was already deterministic with 12324 transitions.
Incomplete random walk after 100011 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=709 ) properties (out of 26) seen :17
Running SMT prover for 9 properties.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:30] [INFO ] Computed 1 place invariants in 81 ms
[2021-05-09 10:44:30] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2021-05-09 10:44:30] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:9
[2021-05-09 10:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2021-05-09 10:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:44:36] [INFO ] [Nat]Absence check using state equation in 4910 ms returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1912 ms.
[2021-05-09 10:44:38] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :9
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 33 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 75 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:44:38] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 10:44:38] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:44:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:38] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-09 10:44:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:44:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:38] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N050-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 1 ms.
FORMULA Diffusion2D-PT-D40N050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-00 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(G(p1)||X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 311 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:38] [INFO ] Computed 1 place invariants in 75 ms
[2021-05-09 10:44:39] [INFO ] Implicit Places using invariants in 242 ms returned []
Implicit Place search using SMT only with invariants took 247 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:39] [INFO ] Computed 1 place invariants in 77 ms
[2021-05-09 10:44:43] [INFO ] Dead Transitions using invariants and state equation in 4235 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D40N050-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s160), p1:(GT 1 s762), p2:(LEQ s477 s504)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 2741 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 3 ms.
FORMULA Diffusion2D-PT-D40N050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-02 finished in 7755 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U ((G(!p0) U p1)&&(p2||F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12228 edges and 1600 vertex of which 1594 / 1600 are part of one of the 1 SCC in 13 ms
Free SCC test removed 1593 places
Ensure Unique test removed 12311 transitions
Reduce isomorphic transitions removed 12311 transitions.
Applied a total of 1 rules in 33 ms. Remains 7 /1600 variables (removed 1593) and now considering 13/12324 (removed 12311) transitions.
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:44:46] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:46] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-09 10:44:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:46] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/1600 places, 13/12324 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p2)), (AND p1 p0 (NOT p2)), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D40N050-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s1 s2), p0:(GT s0 s4), p2:(GT s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-04 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((G((p0 U p1))||G(p2))) U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12276 edges and 1600 vertex of which 1597 / 1600 are part of one of the 1 SCC in 12 ms
Free SCC test removed 1596 places
Ensure Unique test removed 12317 transitions
Reduce isomorphic transitions removed 12317 transitions.
Applied a total of 1 rules in 23 ms. Remains 4 /1600 variables (removed 1596) and now considering 7/12324 (removed 12317) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:46] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:46] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 10:44:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:46] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1600 places, 7/12324 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D40N050-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s2 s1), p1:(LEQ 2 s0), p0:(OR (LEQ s2 s1) (LEQ 2 s0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-05 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 204 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:46] [INFO ] Computed 1 place invariants in 93 ms
[2021-05-09 10:44:47] [INFO ] Implicit Places using invariants in 256 ms returned []
Implicit Place search using SMT only with invariants took 257 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:47] [INFO ] Computed 1 place invariants in 55 ms
[2021-05-09 10:44:51] [INFO ] Dead Transitions using invariants and state equation in 4262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N050-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 (GT s57 s511) (GT s8 s1550))], 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 2 ms.
FORMULA Diffusion2D-PT-D40N050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-06 finished in 4812 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 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 14 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:44:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:51] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:44:51] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:44:51] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-09 10:44:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:44:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:51] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N050-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 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 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-07 finished in 71 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (X(p1)||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 149 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:51] [INFO ] Computed 1 place invariants in 55 ms
[2021-05-09 10:44:51] [INFO ] Implicit Places using invariants in 213 ms returned []
Implicit Place search using SMT only with invariants took 222 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:51] [INFO ] Computed 1 place invariants in 56 ms
[2021-05-09 10:44:56] [INFO ] Dead Transitions using invariants and state equation in 4152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D40N050-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 3 s142), p0:(AND (GT 2 s679) (GT 3 s142))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24260 steps with 0 reset in 653 ms.
FORMULA Diffusion2D-PT-D40N050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-08 finished in 5311 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12292 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1597 places
Ensure Unique test removed 12319 transitions
Reduce isomorphic transitions removed 12319 transitions.
Applied a total of 1 rules in 12 ms. Remains 3 /1600 variables (removed 1597) and now considering 5/12324 (removed 12319) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:44:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:56] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:44:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:56] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 10:44:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:44:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:44:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/1600 places, 5/12324 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N050-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], 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-D40N050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-11 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&X(p1)&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 153 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:57] [INFO ] Computed 1 place invariants in 54 ms
[2021-05-09 10:44:57] [INFO ] Implicit Places using invariants in 216 ms returned []
Implicit Place search using SMT only with invariants took 224 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:44:57] [INFO ] Computed 1 place invariants in 54 ms
[2021-05-09 10:45:01] [INFO ] Dead Transitions using invariants and state equation in 4130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p0), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D40N050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1276 s46), p2:(GT 1 s384), p1:(OR (LEQ s1467 s1320) (LEQ 1 s1120))], 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]]
Product exploration explored 100000 steps with 18 reset in 2031 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA Diffusion2D-PT-D40N050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-12 finished in 6666 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((X(p0)&&(p1 U ((p1&&(p2 U (p3||G(p2))))||G(p1))))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 144 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:45:03] [INFO ] Computed 1 place invariants in 54 ms
[2021-05-09 10:45:03] [INFO ] Implicit Places using invariants in 212 ms returned []
Implicit Place search using SMT only with invariants took 213 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:45:04] [INFO ] Computed 1 place invariants in 55 ms
[2021-05-09 10:45:08] [INFO ] Dead Transitions using invariants and state equation in 4145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p3) (NOT p2) p0 (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D40N050-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={1, 2} source=1 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={1} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={2} source=2 dest: 1}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={2} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={2} source=8 dest: 1}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=8 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={1, 2} source=8 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=11 dest: 11}]], initial=3, aps=[p0:(GT s5 s1480), p3:(AND (GT s5 s1480) (GT 1 s1303)), p2:(GT 1 s1303), p1:(GT s449 s413)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D40N050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N050-13 finished in 4887 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(p0)) U (F(G(p0))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 165 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:45:08] [INFO ] Computed 1 place invariants in 54 ms
[2021-05-09 10:45:08] [INFO ] Implicit Places using invariants in 212 ms returned []
Implicit Place search using SMT only with invariants took 213 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:45:08] [INFO ] Computed 1 place invariants in 54 ms
[2021-05-09 10:45:13] [INFO ] Dead Transitions using invariants and state equation in 4198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), false]
Running random walk in product with property : Diffusion2D-PT-D40N050-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 6}, { cond=p0, acceptance={1} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s1377), p1:(LEQ s1425 s1210)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16661 reset in 824 ms.
Product exploration explored 100000 steps with 16690 reset in 817 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 16625 reset in 814 ms.
Product exploration explored 100000 steps with 16688 reset in 825 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), false]
Support contains 3 out of 1600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12282 edges and 1600 vertex of which 1597 / 1600 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1596 places
Ensure Unique test removed 12317 transitions
Reduce isomorphic transitions removed 12317 transitions.
Applied a total of 1 rules in 10 ms. Remains 4 /1600 variables (removed 1596) and now considering 7/12324 (removed 12317) transitions.
[2021-05-09 10:45:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:45:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:45:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1600 places, 7/12324 transitions.
Product exploration explored 100000 steps with 19944 reset in 670 ms.
Product exploration explored 100000 steps with 20006 reset in 689 ms.
[2021-05-09 10:45:19] [INFO ] Flatten gal took : 217 ms
[2021-05-09 10:45:19] [INFO ] Flatten gal took : 243 ms
[2021-05-09 10:45:19] [INFO ] Time to serialize gal into /tmp/LTL6217074951279720194.gal : 92 ms
[2021-05-09 10:45:19] [INFO ] Time to serialize properties into /tmp/LTL1863825961967987736.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/LTL6217074951279720194.gal, -t, CGAL, -LTL, /tmp/LTL1863825961967987736.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/LTL6217074951279720194.gal -t CGAL -LTL /tmp/LTL1863825961967987736.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(cAMP__4_26_>=1)")))U((F(G("(cAMP__4_26_>=1)")))||(G("(cAMP__5_33_<=cAMP__38_1_)"))))))
Formula 0 simplified : !X(XX"(cAMP__4_26_>=1)" U (FG"(cAMP__4_26_>=1)" | G"(cAMP__5_33_<=cAMP__38_1_)"))
Detected timeout of ITS tools.
[2021-05-09 10:45:34] [INFO ] Flatten gal took : 205 ms
[2021-05-09 10:45:34] [INFO ] Applying decomposition
[2021-05-09 10:45:34] [INFO ] Flatten gal took : 210 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/graph13305986944154329960.txt, -o, /tmp/graph13305986944154329960.bin, -w, /tmp/graph13305986944154329960.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/graph13305986944154329960.bin, -l, -1, -v, -w, /tmp/graph13305986944154329960.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:45:35] [INFO ] Decomposing Gal with order
[2021-05-09 10:45:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:45:36] [INFO ] Removed a total of 9044 redundant transitions.
[2021-05-09 10:45:36] [INFO ] Flatten gal took : 724 ms
[2021-05-09 10:45:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 122 ms.
[2021-05-09 10:45:37] [INFO ] Time to serialize gal into /tmp/LTL1066430709791408900.gal : 59 ms
[2021-05-09 10:45:37] [INFO ] Time to serialize properties into /tmp/LTL7799946993976304112.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/LTL1066430709791408900.gal, -t, CGAL, -LTL, /tmp/LTL7799946993976304112.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/LTL1066430709791408900.gal -t CGAL -LTL /tmp/LTL7799946993976304112.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(gi1.gu203.cAMP__4_26_>=1)")))U((F(G("(gi1.gu203.cAMP__4_26_>=1)")))||(G("(gu199.cAMP__5_33_<=gu199.cAMP__38_1_)"))))))
Formula 0 simplified : !X(XX"(gi1.gu203.cAMP__4_26_>=1)" U (FG"(gi1.gu203.cAMP__4_26_>=1)" | G"(gu199.cAMP__5_33_<=gu199.cAMP__38_1_)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17554495515732638371
[2021-05-09 10:45:52] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17554495515732638371
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/ltsmin17554495515732638371]
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/ltsmin17554495515732638371] 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/ltsmin17554495515732638371] 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-D40N050-14 finished in 44948 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(p0)) U (p1 U X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 200 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:45:53] [INFO ] Computed 1 place invariants in 55 ms
[2021-05-09 10:45:53] [INFO ] Implicit Places using invariants in 310 ms returned []
Implicit Place search using SMT only with invariants took 321 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:45:54] [INFO ] Computed 1 place invariants in 60 ms
[2021-05-09 10:45:58] [INFO ] Dead Transitions using invariants and state equation in 4307 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, p1, (AND p1 (NOT p0)), (NOT p0), true]
Running random walk in product with property : Diffusion2D-PT-D40N050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s542 s399), p0:(OR (GT s542 s399) (LEQ 1 s158))], 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]]
Product exploration explored 100000 steps with 40011 reset in 1426 ms.
Product exploration explored 100000 steps with 39974 reset in 1341 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[p1, p1, (AND p1 (NOT p0)), (NOT p0), true]
Product exploration explored 100000 steps with 40133 reset in 1262 ms.
Product exploration explored 100000 steps with 39914 reset in 1291 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 101 ms :[p1, p1, (AND p1 (NOT p0)), (NOT p0), true]
Support contains 3 out of 1600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12276 edges and 1600 vertex of which 1597 / 1600 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1596 places
Ensure Unique test removed 12317 transitions
Reduce isomorphic transitions removed 12317 transitions.
Applied a total of 1 rules in 9 ms. Remains 4 /1600 variables (removed 1596) and now considering 7/12324 (removed 12317) transitions.
[2021-05-09 10:46:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:46:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:46:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1600 places, 7/12324 transitions.
Product exploration explored 100000 steps with 39967 reset in 1323 ms.
Product exploration explored 100000 steps with 39924 reset in 1149 ms.
[2021-05-09 10:46:06] [INFO ] Flatten gal took : 215 ms
[2021-05-09 10:46:07] [INFO ] Flatten gal took : 222 ms
[2021-05-09 10:46:07] [INFO ] Time to serialize gal into /tmp/LTL5007690803660675916.gal : 40 ms
[2021-05-09 10:46:07] [INFO ] Time to serialize properties into /tmp/LTL2936663622689260811.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/LTL5007690803660675916.gal, -t, CGAL, -LTL, /tmp/LTL2936663622689260811.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/LTL5007690803660675916.gal -t CGAL -LTL /tmp/LTL2936663622689260811.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((cAMP__22_30_>cAMP__19_9_)||(cAMP__13_8_>=1))")))U(("(cAMP__22_30_>cAMP__19_9_)")U(X("(cAMP__22_30_<=cAMP__19_9_)"))))))
Formula 0 simplified : !G(XX"((cAMP__22_30_>cAMP__19_9_)||(cAMP__13_8_>=1))" U ("(cAMP__22_30_>cAMP__19_9_)" U X"(cAMP__22_30_<=cAMP__19_9_)"))
Detected timeout of ITS tools.
[2021-05-09 10:46:22] [INFO ] Flatten gal took : 223 ms
[2021-05-09 10:46:22] [INFO ] Applying decomposition
[2021-05-09 10:46:23] [INFO ] Flatten gal took : 498 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/graph11913841859457666168.txt, -o, /tmp/graph11913841859457666168.bin, -w, /tmp/graph11913841859457666168.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/graph11913841859457666168.bin, -l, -1, -v, -w, /tmp/graph11913841859457666168.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:46:23] [INFO ] Decomposing Gal with order
[2021-05-09 10:46:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:46:24] [INFO ] Removed a total of 8664 redundant transitions.
[2021-05-09 10:46:24] [INFO ] Flatten gal took : 427 ms
[2021-05-09 10:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 111 ms.
[2021-05-09 10:46:24] [INFO ] Time to serialize gal into /tmp/LTL10149095479325050383.gal : 32 ms
[2021-05-09 10:46:25] [INFO ] Time to serialize properties into /tmp/LTL14599729685389225832.ltl : 21 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/LTL10149095479325050383.gal, -t, CGAL, -LTL, /tmp/LTL14599729685389225832.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/LTL10149095479325050383.gal -t CGAL -LTL /tmp/LTL14599729685389225832.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((gu57.cAMP__22_30_>gu57.cAMP__19_9_)||(gi2.gi1.gi0.gu14.cAMP__13_8_>=1))")))U(("(gu57.cAMP__22_30_>gu57.cAMP__19_9_)")U(X("(gu57.cAMP__22_30_<=gu57.cAMP__19_9_)"))))))
Formula 0 simplified : !G(XX"((gu57.cAMP__22_30_>gu57.cAMP__19_9_)||(gi2.gi1.gi0.gu14.cAMP__13_8_>=1))" U ("(gu57.cAMP__22_30_>gu57.cAMP__19_9_)" U X"(gu57.cAMP__22_30_<=gu57.cAMP__19_9_)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin695022752353555036
[2021-05-09 10:46:40] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin695022752353555036
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/ltsmin695022752353555036]
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/ltsmin695022752353555036] 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/ltsmin695022752353555036] 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-D40N050-15 finished in 47707 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10917871626150742527
[2021-05-09 10:46:41] [INFO ] Too many transitions (12324) to apply POR reductions. Disabling POR matrices.
[2021-05-09 10:46:41] [INFO ] Applying decomposition
[2021-05-09 10:46:41] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10917871626150742527
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/ltsmin10917871626150742527]
[2021-05-09 10:46:41] [INFO ] Flatten gal took : 206 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/graph2112326061309138861.txt, -o, /tmp/graph2112326061309138861.bin, -w, /tmp/graph2112326061309138861.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/graph2112326061309138861.bin, -l, -1, -v, -w, /tmp/graph2112326061309138861.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:46:42] [INFO ] Decomposing Gal with order
[2021-05-09 10:46:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:46:43] [INFO ] Removed a total of 8632 redundant transitions.
[2021-05-09 10:46:43] [INFO ] Flatten gal took : 1002 ms
[2021-05-09 10:46:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 207 ms.
[2021-05-09 10:46:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality10969476193533206407.gal : 30 ms
[2021-05-09 10:46:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality6556110452825435993.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/LTLCardinality10969476193533206407.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6556110452825435993.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/LTLCardinality10969476193533206407.gal -t CGAL -LTL /tmp/LTLCardinality6556110452825435993.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X((X(X("(gi0.gi1.gi2.gu213.cAMP__4_26_>=1)")))U((F(G("(gi0.gi1.gi2.gu213.cAMP__4_26_>=1)")))||(G("(gu217.cAMP__5_33_<=gu217.cAMP__38_1_)"))))))
Formula 0 simplified : !X(XX"(gi0.gi1.gi2.gu213.cAMP__4_26_>=1)" U (FG"(gi0.gi1.gi2.gu213.cAMP__4_26_>=1)" | G"(gu217.cAMP__5_33_<=gu217.cAMP__38_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/ltsmin10917871626150742527] 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/ltsmin10917871626150742527] 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)
Detected timeout of ITS tools.
[2021-05-09 11:07:31] [INFO ] Flatten gal took : 253 ms
[2021-05-09 11:07:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality17725233580315068202.gal : 29 ms
[2021-05-09 11:07:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality10573437588453002441.ltl : 2 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/LTLCardinality17725233580315068202.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10573437588453002441.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/LTLCardinality17725233580315068202.gal -t CGAL -LTL /tmp/LTLCardinality10573437588453002441.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X((X(X("(cAMP__4_26_>=1)")))U((F(G("(cAMP__4_26_>=1)")))||(G("(cAMP__5_33_<=cAMP__38_1_)"))))))
Formula 0 simplified : !X(XX"(cAMP__4_26_>=1)" U (FG"(cAMP__4_26_>=1)" | G"(cAMP__5_33_<=cAMP__38_1_)"))
Detected timeout of ITS tools.
[2021-05-09 11:28:18] [INFO ] Flatten gal took : 227 ms
[2021-05-09 11:28:19] [INFO ] Input system was already deterministic with 12324 transitions.
[2021-05-09 11:28:19] [INFO ] Transformed 1600 places.
[2021-05-09 11:28:19] [INFO ] Transformed 12324 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 11:28:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality5529928844885716535.gal : 16 ms
[2021-05-09 11:28:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality6399067819334969351.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/LTLCardinality5529928844885716535.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6399067819334969351.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/LTLCardinality5529928844885716535.gal -t CGAL -LTL /tmp/LTLCardinality6399067819334969351.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(X("(cAMP__4_26_>=1)")))U((F(G("(cAMP__4_26_>=1)")))||(G("(cAMP__5_33_<=cAMP__38_1_)"))))))
Formula 0 simplified : !X(XX"(cAMP__4_26_>=1)" U (FG"(cAMP__4_26_>=1)" | G"(cAMP__5_33_<=cAMP__38_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
+ [[ 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-D40N050"
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-D40N050, 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-162048875100180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D40N050.tgz
mv Diffusion2D-PT-D40N050 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 ;