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-162048875000165.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-D30N150, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875000165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.5K 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 17K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 3.0M 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-D30N150-00
FORMULA_NAME Diffusion2D-PT-D30N150-01
FORMULA_NAME Diffusion2D-PT-D30N150-02
FORMULA_NAME Diffusion2D-PT-D30N150-03
FORMULA_NAME Diffusion2D-PT-D30N150-04
FORMULA_NAME Diffusion2D-PT-D30N150-05
FORMULA_NAME Diffusion2D-PT-D30N150-06
FORMULA_NAME Diffusion2D-PT-D30N150-07
FORMULA_NAME Diffusion2D-PT-D30N150-08
FORMULA_NAME Diffusion2D-PT-D30N150-09
FORMULA_NAME Diffusion2D-PT-D30N150-10
FORMULA_NAME Diffusion2D-PT-D30N150-11
FORMULA_NAME Diffusion2D-PT-D30N150-12
FORMULA_NAME Diffusion2D-PT-D30N150-13
FORMULA_NAME Diffusion2D-PT-D30N150-14
FORMULA_NAME Diffusion2D-PT-D30N150-15

=== Now, execution of the tool begins

BK_START 1620553889959

Running Version 0
[2021-05-09 09:51:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 09:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:51:31] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2021-05-09 09:51:31] [INFO ] Transformed 900 places.
[2021-05-09 09:51:31] [INFO ] Transformed 6844 transitions.
[2021-05-09 09:51:31] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 09:51:31] [INFO ] Initial state test concluded for 5 properties.
FORMULA Diffusion2D-PT-D30N150-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 207 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:32] [INFO ] Computed 1 place invariants in 56 ms
[2021-05-09 09:51:32] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:32] [INFO ] Computed 1 place invariants in 41 ms
[2021-05-09 09:51:33] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:33] [INFO ] Computed 1 place invariants in 32 ms
[2021-05-09 09:51:35] [INFO ] Dead Transitions using invariants and state equation in 2439 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
[2021-05-09 09:51:36] [INFO ] Flatten gal took : 353 ms
[2021-05-09 09:51:36] [INFO ] Flatten gal took : 172 ms
[2021-05-09 09:51:36] [INFO ] Input system was already deterministic with 6844 transitions.
Incomplete random walk after 100126 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=1756 ) properties (out of 31) seen :22
Running SMT prover for 9 properties.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:37] [INFO ] Computed 1 place invariants in 30 ms
[2021-05-09 09:51:37] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:38] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2021-05-09 09:51:39] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 415 ms.
[2021-05-09 09:51:39] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:40] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2021-05-09 09:51:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 427 ms.
[2021-05-09 09:51:40] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:42] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2021-05-09 09:51:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 389 ms.
[2021-05-09 09:51:42] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:43] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2021-05-09 09:51:44] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 347 ms.
[2021-05-09 09:51:44] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:45] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2021-05-09 09:51:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 351 ms.
[2021-05-09 09:51:46] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2021-05-09 09:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:47] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2021-05-09 09:51:48] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 332 ms.
[2021-05-09 09:51:48] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:49] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2021-05-09 09:51:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 362 ms.
[2021-05-09 09:51:49] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:50] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2021-05-09 09:51:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 355 ms.
[2021-05-09 09:51:51] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2021-05-09 09:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 09:51:52] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2021-05-09 09:51:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 107 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:53] [INFO ] Computed 1 place invariants in 22 ms
[2021-05-09 09:51:53] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:53] [INFO ] Computed 1 place invariants in 32 ms
[2021-05-09 09:51:54] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:54] [INFO ] Computed 1 place invariants in 22 ms
[2021-05-09 09:51:56] [INFO ] Dead Transitions using invariants and state equation in 2221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s19 1) (GEQ s354 1)), p1:(LT s322 1), p0:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11233 steps with 0 reset in 433 ms.
FORMULA Diffusion2D-PT-D30N150-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-00 finished in 4017 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p0)&&F(G(p1)))) U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6812 edges and 900 vertex of which 898 / 900 are part of one of the 1 SCC in 11 ms
Free SCC test removed 897 places
Ensure Unique test removed 6839 transitions
Reduce isomorphic transitions removed 6839 transitions.
Applied a total of 1 rules in 31 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 09:51:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:51:57] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 09:51:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:51:57] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 09:51:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 09:51:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:51:57] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s0 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N150-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-01 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(((p1&&F(p2))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 70 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:57] [INFO ] Computed 1 place invariants in 21 ms
[2021-05-09 09:51:57] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:57] [INFO ] Computed 1 place invariants in 22 ms
[2021-05-09 09:51:58] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:51:58] [INFO ] Computed 1 place invariants in 21 ms
[2021-05-09 09:52:00] [INFO ] Dead Transitions using invariants and state equation in 2173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N150-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s218 1), p2:(LT s478 1), p1:(LT s436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 999 ms.
Product exploration explored 100000 steps with 50000 reset in 925 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 828 ms.
Product exploration explored 100000 steps with 50000 reset in 862 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 900 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6796 edges and 900 vertex of which 897 / 900 are part of one of the 1 SCC in 7 ms
Free SCC test removed 896 places
Ensure Unique test removed 6837 transitions
Reduce isomorphic transitions removed 6837 transitions.
Applied a total of 1 rules in 17 ms. Remains 4 /900 variables (removed 896) and now considering 7/6844 (removed 6837) transitions.
[2021-05-09 09:52:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 09:52:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:52:04] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/900 places, 7/6844 transitions.
Product exploration explored 100000 steps with 50000 reset in 777 ms.
Product exploration explored 100000 steps with 50000 reset in 685 ms.
[2021-05-09 09:52:06] [INFO ] Flatten gal took : 135 ms
[2021-05-09 09:52:06] [INFO ] Flatten gal took : 136 ms
[2021-05-09 09:52:06] [INFO ] Time to serialize gal into /tmp/LTL14993218405434786637.gal : 85 ms
[2021-05-09 09:52:06] [INFO ] Time to serialize properties into /tmp/LTL10582110867825687836.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/LTL14993218405434786637.gal, -t, CGAL, -LTL, /tmp/LTL10582110867825687836.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/LTL14993218405434786637.gal -t CGAL -LTL /tmp/LTL10582110867825687836.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(cAMP__17_18_>=1)"))||(X((("(cAMP__23_25_<1)")&&(F("(cAMP__24_8_<1)")))||(G("(cAMP__23_25_<1)"))))))
Formula 0 simplified : !(F"(cAMP__17_18_>=1)" | X(("(cAMP__23_25_<1)" & F"(cAMP__24_8_<1)") | G"(cAMP__23_25_<1)"))
Detected timeout of ITS tools.
[2021-05-09 09:52:22] [INFO ] Flatten gal took : 129 ms
[2021-05-09 09:52:22] [INFO ] Applying decomposition
[2021-05-09 09:52:22] [INFO ] Flatten gal took : 133 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/graph8317724298762707862.txt, -o, /tmp/graph8317724298762707862.bin, -w, /tmp/graph8317724298762707862.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/graph8317724298762707862.bin, -l, -1, -v, -w, /tmp/graph8317724298762707862.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 09:52:22] [INFO ] Decomposing Gal with order
[2021-05-09 09:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 09:52:22] [INFO ] Removed a total of 4674 redundant transitions.
[2021-05-09 09:52:23] [INFO ] Flatten gal took : 412 ms
[2021-05-09 09:52:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 58 ms.
[2021-05-09 09:52:23] [INFO ] Time to serialize gal into /tmp/LTL17610404964827601311.gal : 28 ms
[2021-05-09 09:52:23] [INFO ] Time to serialize properties into /tmp/LTL15680941390079721758.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/LTL17610404964827601311.gal, -t, CGAL, -LTL, /tmp/LTL15680941390079721758.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17610404964827601311.gal -t CGAL -LTL /tmp/LTL15680941390079721758.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i3.i1.u35.cAMP__17_18_>=1)"))||(X((("(i5.u72.cAMP__23_25_<1)")&&(F("(i8.i0.u78.cAMP__24_8_<1)")))||(G("(i5.u72.cAMP__23_25_<1)"))))))
Formula 0 simplified : !(F"(i3.i1.u35.cAMP__17_18_>=1)" | X(("(i5.u72.cAMP__23_25_<1)" & F"(i8.i0.u78.cAMP__24_8_<1)") | G"(i5.u72.cAMP__23_25_<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12308054705112451361
[2021-05-09 09:52:38] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12308054705112451361
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/ltsmin12308054705112451361]
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/ltsmin12308054705112451361] 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/ltsmin12308054705112451361] 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-D30N150-02 finished in 42020 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&G((F(p1)||X(F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 70 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:39] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:39] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:39] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:40] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:40] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:42] [INFO ] Dead Transitions using invariants and state equation in 2179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D30N150-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s176 1), p1:(GEQ s86 1), p2:(GEQ s898 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 51 reset in 1538 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-D30N150-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-03 finished in 4902 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 66 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:44] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:44] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:44] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:45] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:45] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:47] [INFO ] Dead Transitions using invariants and state equation in 2199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N150-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s161 1), p0:(GEQ s653 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-04 finished in 3454 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6812 edges and 900 vertex of which 898 / 900 are part of one of the 1 SCC in 16 ms
Free SCC test removed 897 places
Ensure Unique test removed 6839 transitions
Reduce isomorphic transitions removed 6839 transitions.
Applied a total of 1 rules in 32 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 09:52:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:52:47] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 09:52:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:52:47] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 09:52:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 09:52:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:52:47] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D30N150-05 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 (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s1 1) (LT s0 1)), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-05 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((p0 U (p1||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 900 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 71 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:47] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:48] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:48] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:48] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:48] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:51] [INFO ] Dead Transitions using invariants and state equation in 2526 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s385 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Entered a terminal (fully accepting) state of product in 1170 steps with 0 reset in 13 ms.
FORMULA Diffusion2D-PT-D30N150-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-06 finished in 3678 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((p0&&F(p1)))&&(p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 69 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:51] [INFO ] Computed 1 place invariants in 22 ms
[2021-05-09 09:52:51] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:51] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:52] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:52] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:55] [INFO ] Dead Transitions using invariants and state equation in 3126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N150-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s796 1), p1:(GEQ s743 1), p0:(LT s409 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 3138 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA Diffusion2D-PT-D30N150-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-07 finished in 7602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (p1&&X(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 72 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:59] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:52:59] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:52:59] [INFO ] Computed 1 place invariants in 21 ms
[2021-05-09 09:53:00] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:00] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:02] [INFO ] Dead Transitions using invariants and state equation in 2326 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Diffusion2D-PT-D30N150-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s273 1), p0:(GEQ s732 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N150-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-09 finished in 3355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6834 edges and 900 vertex of which 899 / 900 are part of one of the 1 SCC in 5 ms
Free SCC test removed 898 places
Ensure Unique test removed 6841 transitions
Reduce isomorphic transitions removed 6841 transitions.
Applied a total of 1 rules in 10 ms. Remains 2 /900 variables (removed 898) and now considering 3/6844 (removed 6841) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 09:53:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:53:02] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 09:53:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:53:02] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-09 09:53:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 09:53:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 09:53:02] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/900 places, 3/6844 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-11 finished in 70 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 65 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:02] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:02] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:02] [INFO ] Computed 1 place invariants in 22 ms
[2021-05-09 09:53:03] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:03] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:05] [INFO ] Dead Transitions using invariants and state equation in 2403 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Diffusion2D-PT-D30N150-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s393 1) (GEQ s134 1)), p0:(GEQ s393 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-12 finished in 3449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U G(p1)) U (p2||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 65 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:06] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:06] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:06] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:06] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:06] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:09] [INFO ] Dead Transitions using invariants and state equation in 2176 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N150-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s668 1), p2:(GEQ s815 1), p1:(GEQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-14 finished in 3291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(X(F(p0)))||(p1 U p2)))&&X(!p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 64 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:09] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:09] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:09] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:10] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2021-05-09 09:53:10] [INFO ] Computed 1 place invariants in 20 ms
[2021-05-09 09:53:12] [INFO ] Dead Transitions using invariants and state equation in 2247 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) p0), p0, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D30N150-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s586 1), p1:(GEQ s139 1), p0:(GEQ s527 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 2727 ms.
Stack based approach found an accepted trace after 114 steps with 1 reset with depth 113 and stack size 113 in 1 ms.
FORMULA Diffusion2D-PT-D30N150-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-15 finished in 6270 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12611647530427753087
[2021-05-09 09:53:15] [INFO ] Too many transitions (6844) to apply POR reductions. Disabling POR matrices.
[2021-05-09 09:53:15] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12611647530427753087
[2021-05-09 09:53:15] [INFO ] Applying decomposition
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/ltsmin12611647530427753087]
[2021-05-09 09:53:15] [INFO ] Flatten gal took : 178 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/graph17735737104737703608.txt, -o, /tmp/graph17735737104737703608.bin, -w, /tmp/graph17735737104737703608.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/graph17735737104737703608.bin, -l, -1, -v, -w, /tmp/graph17735737104737703608.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 09:53:16] [INFO ] Decomposing Gal with order
[2021-05-09 09:53:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 09:53:16] [INFO ] Removed a total of 4814 redundant transitions.
[2021-05-09 09:53:16] [INFO ] Flatten gal took : 375 ms
[2021-05-09 09:53:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 37 ms.
[2021-05-09 09:53:16] [INFO ] Time to serialize gal into /tmp/LTLFireability15934120054691745132.gal : 24 ms
[2021-05-09 09:53:16] [INFO ] Time to serialize properties into /tmp/LTLFireability11508882966972842399.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/LTLFireability15934120054691745132.gal, -t, CGAL, -LTL, /tmp/LTLFireability11508882966972842399.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability15934120054691745132.gal -t CGAL -LTL /tmp/LTLFireability11508882966972842399.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i1.i1.u34.cAMP__17_18_>=1)"))||(X(("(i9.u77.cAMP__23_25_<1)")U((("(i9.u77.cAMP__23_25_<1)")&&(F("(i8.i2.u73.cAMP__24_8_<1)")))||(G("(i9.u77.cAMP__23_25_<1)")))))))
Formula 0 simplified : !(F"(i1.i1.u34.cAMP__17_18_>=1)" | X("(i9.u77.cAMP__23_25_<1)" U (("(i9.u77.cAMP__23_25_<1)" & F"(i8.i2.u73.cAMP__24_8_<1)") | G"(i9.u77.cAMP__23_25_<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/ltsmin12611647530427753087] killed by timeout after 27 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12611647530427753087] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 10:13:51] [INFO ] Flatten gal took : 119 ms
[2021-05-09 10:13:51] [INFO ] Time to serialize gal into /tmp/LTLFireability5190510532776627866.gal : 14 ms
[2021-05-09 10:13:51] [INFO ] Time to serialize properties into /tmp/LTLFireability3229555509154342671.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/LTLFireability5190510532776627866.gal, -t, CGAL, -LTL, /tmp/LTLFireability3229555509154342671.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/LTLFireability5190510532776627866.gal -t CGAL -LTL /tmp/LTLFireability3229555509154342671.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(cAMP__17_18_>=1)"))||(X(("(cAMP__23_25_<1)")U((("(cAMP__23_25_<1)")&&(F("(cAMP__24_8_<1)")))||(G("(cAMP__23_25_<1)")))))))
Formula 0 simplified : !(F"(cAMP__17_18_>=1)" | X("(cAMP__23_25_<1)" U (("(cAMP__23_25_<1)" & F"(cAMP__24_8_<1)") | G"(cAMP__23_25_<1)")))
Detected timeout of ITS tools.
[2021-05-09 10:34:25] [INFO ] Flatten gal took : 115 ms
[2021-05-09 10:34:25] [INFO ] Input system was already deterministic with 6844 transitions.
[2021-05-09 10:34:25] [INFO ] Transformed 900 places.
[2021-05-09 10:34:26] [INFO ] Transformed 6844 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 10:34:26] [INFO ] Time to serialize gal into /tmp/LTLFireability8561851559111005442.gal : 9 ms
[2021-05-09 10:34:26] [INFO ] Time to serialize properties into /tmp/LTLFireability17792927196180888945.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/LTLFireability8561851559111005442.gal, -t, CGAL, -LTL, /tmp/LTLFireability17792927196180888945.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/LTLFireability8561851559111005442.gal -t CGAL -LTL /tmp/LTLFireability17792927196180888945.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(cAMP__17_18_>=1)"))||(X(("(cAMP__23_25_<1)")U((("(cAMP__23_25_<1)")&&(F("(cAMP__24_8_<1)")))||(G("(cAMP__23_25_<1)")))))))
Formula 0 simplified : !(F"(cAMP__17_18_>=1)" | X("(cAMP__23_25_<1)" U (("(cAMP__23_25_<1)" & F"(cAMP__24_8_<1)") | G"(cAMP__23_25_<1)")))

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D30N150"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D30N150, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875000165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;