fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048875100228
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Diffusion2D-PT-D50N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16244.447 3600000.00 11563430.00 23101.50 FFFFTF?FFTFFFF?F 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-162048875100228.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-D50N150, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 174K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.7K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 7.3M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D50N150-00
FORMULA_NAME Diffusion2D-PT-D50N150-01
FORMULA_NAME Diffusion2D-PT-D50N150-02
FORMULA_NAME Diffusion2D-PT-D50N150-03
FORMULA_NAME Diffusion2D-PT-D50N150-04
FORMULA_NAME Diffusion2D-PT-D50N150-05
FORMULA_NAME Diffusion2D-PT-D50N150-06
FORMULA_NAME Diffusion2D-PT-D50N150-07
FORMULA_NAME Diffusion2D-PT-D50N150-08
FORMULA_NAME Diffusion2D-PT-D50N150-09
FORMULA_NAME Diffusion2D-PT-D50N150-10
FORMULA_NAME Diffusion2D-PT-D50N150-11
FORMULA_NAME Diffusion2D-PT-D50N150-12
FORMULA_NAME Diffusion2D-PT-D50N150-13
FORMULA_NAME Diffusion2D-PT-D50N150-14
FORMULA_NAME Diffusion2D-PT-D50N150-15

=== Now, execution of the tool begins

BK_START 1620570969286

Running Version 0
[2021-05-09 14:36:10] [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 14:36:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:36:11] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2021-05-09 14:36:11] [INFO ] Transformed 2500 places.
[2021-05-09 14:36:11] [INFO ] Transformed 19404 transitions.
[2021-05-09 14:36:11] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:36:11] [INFO ] Initial state test concluded for 2 properties.
FORMULA Diffusion2D-PT-D50N150-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N150-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 680 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:12] [INFO ] Computed 1 place invariants in 160 ms
[2021-05-09 14:36:12] [INFO ] Implicit Places using invariants in 536 ms returned []
Implicit Place search using SMT only with invariants took 560 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:12] [INFO ] Computed 1 place invariants in 109 ms
[2021-05-09 14:36:20] [INFO ] Dead Transitions using invariants and state equation in 7516 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
[2021-05-09 14:36:21] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 14:36:21] [INFO ] Flatten gal took : 730 ms
FORMULA Diffusion2D-PT-D50N150-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N150-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:36:21] [INFO ] Flatten gal took : 427 ms
[2021-05-09 14:36:22] [INFO ] Input system was already deterministic with 19404 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=1234 ) properties (out of 25) seen :5
Running SMT prover for 20 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:22] [INFO ] Computed 1 place invariants in 98 ms
[2021-05-09 14:36:23] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2021-05-09 14:36:23] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:20
[2021-05-09 14:36:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2021-05-09 14:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:36:37] [INFO ] [Nat]Absence check using state equation in 12266 ms returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 6943 ms.
[2021-05-09 14:36:44] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :20
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 26 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 66 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:36:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:36:44] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:36:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:36:44] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 14:36:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:36:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:36:44] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N150-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-01 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19362 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 19 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 39 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:36:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:36:45] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:36:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:36:45] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-09 14:36:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:36:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:36:45] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N150-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s0), p1:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-03 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1 U X(G(p2)))) U G((p3&&F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 372 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:45] [INFO ] Computed 1 place invariants in 138 ms
[2021-05-09 14:36:46] [INFO ] Implicit Places using invariants in 469 ms returned []
Implicit Place search using SMT only with invariants took 470 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:46] [INFO ] Computed 1 place invariants in 76 ms
[2021-05-09 14:36:53] [INFO ] Dead Transitions using invariants and state equation in 7519 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p3) p1), (NOT p2), (AND p1 (NOT p2)), p1, (NOT p2), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) p3)), (NOT p2), (AND (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D50N150-05 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 4}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p3 p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2)), acceptance={} source=7 dest: 1}, { cond=(OR (AND p3 p1 p2) (AND p3 p0 p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p3), acceptance={} source=9 dest: 8}, { cond=p3, acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(GT s1430 s1272), p1:(LEQ 2 s249), p0:(LEQ 3 s542), p2:(GT s2327 s1729)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Diffusion2D-PT-D50N150-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-05 finished in 8710 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 378 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:54] [INFO ] Computed 1 place invariants in 79 ms
[2021-05-09 14:36:54] [INFO ] Implicit Places using invariants in 312 ms returned []
Implicit Place search using SMT only with invariants took 313 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:36:54] [INFO ] Computed 1 place invariants in 82 ms
[2021-05-09 14:37:02] [INFO ] Dead Transitions using invariants and state equation in 7584 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N150-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s2012 s1783), p0:(LEQ s1257 s2011)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2287 ms.
Product exploration explored 100000 steps with 50000 reset in 2153 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 2009 ms.
Product exploration explored 100000 steps with 50000 reset in 2035 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19342 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19393 transitions
Reduce isomorphic transitions removed 19393 transitions.
Applied a total of 1 rules in 22 ms. Remains 5 /2500 variables (removed 2495) and now considering 11/19404 (removed 19393) transitions.
[2021-05-09 14:37:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 5 cols
[2021-05-09 14:37:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:11] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 11/19404 transitions.
Product exploration explored 100000 steps with 50000 reset in 1713 ms.
Product exploration explored 100000 steps with 50000 reset in 1578 ms.
[2021-05-09 14:37:15] [INFO ] Flatten gal took : 381 ms
[2021-05-09 14:37:15] [INFO ] Flatten gal took : 325 ms
[2021-05-09 14:37:15] [INFO ] Time to serialize gal into /tmp/LTL3970238522986469037.gal : 97 ms
[2021-05-09 14:37:15] [INFO ] Time to serialize properties into /tmp/LTL18333029851077988879.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/LTL3970238522986469037.gal, -t, CGAL, -LTL, /tmp/LTL18333029851077988879.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/LTL3970238522986469037.gal -t CGAL -LTL /tmp/LTL18333029851077988879.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(cAMP__33_17_<=cAMP__47_20_)")||(G("(cAMP__47_21_<=cAMP__42_40_)")))))
Formula 0 simplified : !X("(cAMP__33_17_<=cAMP__47_20_)" | G"(cAMP__47_21_<=cAMP__42_40_)")
Detected timeout of ITS tools.
[2021-05-09 14:37:31] [INFO ] Flatten gal took : 319 ms
[2021-05-09 14:37:31] [INFO ] Applying decomposition
[2021-05-09 14:37:31] [INFO ] Flatten gal took : 326 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/graph5122251038389996600.txt, -o, /tmp/graph5122251038389996600.bin, -w, /tmp/graph5122251038389996600.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/graph5122251038389996600.bin, -l, -1, -v, -w, /tmp/graph5122251038389996600.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:37:32] [INFO ] Decomposing Gal with order
[2021-05-09 14:37:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:37:33] [INFO ] Removed a total of 13700 redundant transitions.
[2021-05-09 14:37:34] [INFO ] Flatten gal took : 1187 ms
[2021-05-09 14:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 169 ms.
[2021-05-09 14:37:35] [INFO ] Time to serialize gal into /tmp/LTL14121691223610798991.gal : 58 ms
[2021-05-09 14:37:35] [INFO ] Time to serialize properties into /tmp/LTL9098087196048379292.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/LTL14121691223610798991.gal, -t, CGAL, -LTL, /tmp/LTL9098087196048379292.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/LTL14121691223610798991.gal -t CGAL -LTL /tmp/LTL9098087196048379292.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu302.cAMP__33_17_<=gu302.cAMP__47_20_)")||(G("(gu268.cAMP__47_21_<=gu268.cAMP__42_40_)")))))
Formula 0 simplified : !X("(gu302.cAMP__33_17_<=gu302.cAMP__47_20_)" | G"(gu268.cAMP__47_21_<=gu268.cAMP__42_40_)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2650173999792434411
[2021-05-09 14:37:50] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2650173999792434411
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/ltsmin2650173999792434411]
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/ltsmin2650173999792434411] 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/ltsmin2650173999792434411] 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-D50N150-06 finished in 57742 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 14 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:37:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:51] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:37:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:51] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-09 14:37:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 14:37:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s2), p1:(GT s1 s0)], nbAcceptance=2, 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 7 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-07 finished in 112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19378 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 14 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 14:37:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:51] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 14:37:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:51] [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 14:37:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 14:37:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:37:51] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-08 finished in 97 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 370 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:37:52] [INFO ] Computed 1 place invariants in 82 ms
[2021-05-09 14:37:52] [INFO ] Implicit Places using invariants in 353 ms returned []
Implicit Place search using SMT only with invariants took 353 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:37:52] [INFO ] Computed 1 place invariants in 82 ms
[2021-05-09 14:38:00] [INFO ] Dead Transitions using invariants and state equation in 8363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Diffusion2D-PT-D50N150-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s1747 s2385), p0:(LEQ 2 s2415)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-10 finished in 9234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 360 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:38:01] [INFO ] Computed 1 place invariants in 82 ms
[2021-05-09 14:38:01] [INFO ] Implicit Places using invariants in 377 ms returned []
Implicit Place search using SMT only with invariants took 387 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:38:01] [INFO ] Computed 1 place invariants in 81 ms
[2021-05-09 14:38:09] [INFO ] Dead Transitions using invariants and state equation in 7567 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s716), p1:(LEQ 3 s2436)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 653 reset in 1309 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 2 ms.
FORMULA Diffusion2D-PT-D50N150-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-11 finished in 9723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19378 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 14 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 14:38:10] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:38:10] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 14:38:10] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:38:10] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 14:38:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 14:38:10] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:38:10] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-12 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-D50N150-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-12 finished in 85 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p1)&&(!p0||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 501 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:38:11] [INFO ] Computed 1 place invariants in 77 ms
[2021-05-09 14:38:11] [INFO ] Implicit Places using invariants in 271 ms returned []
Implicit Place search using SMT only with invariants took 272 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:38:11] [INFO ] Computed 1 place invariants in 76 ms
[2021-05-09 14:38:19] [INFO ] Dead Transitions using invariants and state equation in 7367 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : Diffusion2D-PT-D50N150-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s2003), p1:(LEQ s2205 s80), p2:(LEQ s744 s1958)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-13 finished in 8273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((F((p0||G(p1)))&&X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 500 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:38:19] [INFO ] Computed 1 place invariants in 78 ms
[2021-05-09 14:38:19] [INFO ] Implicit Places using invariants in 324 ms returned []
Implicit Place search using SMT only with invariants took 325 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 14:38:20] [INFO ] Computed 1 place invariants in 173 ms
[2021-05-09 14:38:27] [INFO ] Dead Transitions using invariants and state equation in 7751 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-14 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 p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s877), p2:(GT 1 s1815), p1:(LEQ s244 s2295)], 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 14 reset in 3536 ms.
Product exploration explored 100000 steps with 12 reset in 4074 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18 reset in 3603 ms.
Product exploration explored 100000 steps with 16 reset in 3449 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19346 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 15 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
[2021-05-09 14:38:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 14:38:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:38:43] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 9/19404 transitions.
Product exploration explored 100000 steps with 33333 reset in 914 ms.
Product exploration explored 100000 steps with 33333 reset in 724 ms.
[2021-05-09 14:38:45] [INFO ] Flatten gal took : 336 ms
[2021-05-09 14:38:45] [INFO ] Flatten gal took : 410 ms
[2021-05-09 14:38:45] [INFO ] Time to serialize gal into /tmp/LTL15555726429367529467.gal : 42 ms
[2021-05-09 14:38:45] [INFO ] Time to serialize properties into /tmp/LTL1523660518833655070.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/LTL15555726429367529467.gal, -t, CGAL, -LTL, /tmp/LTL1523660518833655070.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/LTL15555726429367529467.gal -t CGAL -LTL /tmp/LTL1523660518833655070.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(("(cAMP__26_35_>=1)")||(G("(cAMP__14_50_<=cAMP__5_5_)"))))&&(X(G("(cAMP__43_24_<1)"))))))))
Formula 0 simplified : !XXF(F("(cAMP__26_35_>=1)" | G"(cAMP__14_50_<=cAMP__5_5_)") & XG"(cAMP__43_24_<1)")
Detected timeout of ITS tools.
[2021-05-09 14:39:01] [INFO ] Flatten gal took : 330 ms
[2021-05-09 14:39:01] [INFO ] Applying decomposition
[2021-05-09 14:39:01] [INFO ] Flatten gal took : 340 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/graph7306787759449110051.txt, -o, /tmp/graph7306787759449110051.bin, -w, /tmp/graph7306787759449110051.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/graph7306787759449110051.bin, -l, -1, -v, -w, /tmp/graph7306787759449110051.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:39:02] [INFO ] Decomposing Gal with order
[2021-05-09 14:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:39:03] [INFO ] Removed a total of 13422 redundant transitions.
[2021-05-09 14:39:03] [INFO ] Flatten gal took : 719 ms
[2021-05-09 14:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 215 ms.
[2021-05-09 14:39:04] [INFO ] Time to serialize gal into /tmp/LTL6714427442086079219.gal : 51 ms
[2021-05-09 14:39:04] [INFO ] Time to serialize properties into /tmp/LTL4573158830785475967.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/LTL6714427442086079219.gal, -t, CGAL, -LTL, /tmp/LTL4573158830785475967.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/LTL6714427442086079219.gal -t CGAL -LTL /tmp/LTL4573158830785475967.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((F(("(gi4.gu133.cAMP__26_35_>=1)")||(G("(gu330.cAMP__14_50_<=gu330.cAMP__5_5_)"))))&&(X(G("(gi6.gi0.gi2.gu241.cAMP__43_24_<1)"))))))))
Formula 0 simplified : !XXF(F("(gi4.gu133.cAMP__26_35_>=1)" | G"(gu330.cAMP__14_50_<=gu330.cAMP__5_5_)") & XG"(gi6.gi0.gi2.gu241.cAMP__43_24_<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10350968220432819565
[2021-05-09 14:39:19] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10350968220432819565
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/ltsmin10350968220432819565]
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/ltsmin10350968220432819565] 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/ltsmin10350968220432819565] 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-D50N150-14 finished in 61745 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 17 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 14:39:20] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:39:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 14:39:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:39:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-09 14:39:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 14:39:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:39:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N150-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-15 finished in 160 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8437364766314433535
[2021-05-09 14:39:21] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2021-05-09 14:39:21] [INFO ] Built C files in 387ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8437364766314433535
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/ltsmin8437364766314433535]
[2021-05-09 14:39:21] [INFO ] Applying decomposition
[2021-05-09 14:39:22] [INFO ] Flatten gal took : 714 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/graph6054972642148208301.txt, -o, /tmp/graph6054972642148208301.bin, -w, /tmp/graph6054972642148208301.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/graph6054972642148208301.bin, -l, -1, -v, -w, /tmp/graph6054972642148208301.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:39:23] [INFO ] Decomposing Gal with order
[2021-05-09 14:39:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:39:24] [INFO ] Removed a total of 13778 redundant transitions.
[2021-05-09 14:39:24] [INFO ] Flatten gal took : 907 ms
[2021-05-09 14:39:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 197 ms.
[2021-05-09 14:39:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality5365800424986987836.gal : 54 ms
[2021-05-09 14:39:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality16497987288439946657.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/LTLCardinality5365800424986987836.gal, -t, CGAL, -LTL, /tmp/LTLCardinality16497987288439946657.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/LTLCardinality5365800424986987836.gal -t CGAL -LTL /tmp/LTLCardinality16497987288439946657.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(("(gu298.cAMP__33_17_<=gu298.cAMP__47_20_)")||(G("(gu299.cAMP__47_21_<=gu299.cAMP__42_40_)")))))
Formula 0 simplified : !X("(gu298.cAMP__33_17_<=gu298.cAMP__47_20_)" | G"(gu299.cAMP__47_21_<=gu299.cAMP__42_40_)")
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/ltsmin8437364766314433535] 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/ltsmin8437364766314433535] 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 15:00:30] [INFO ] Flatten gal took : 428 ms
[2021-05-09 15:00:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality7079293881748673730.gal : 42 ms
[2021-05-09 15:00:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality15887441612807727333.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/LTLCardinality7079293881748673730.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15887441612807727333.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/LTLCardinality7079293881748673730.gal -t CGAL -LTL /tmp/LTLCardinality15887441612807727333.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(("(cAMP__33_17_<=cAMP__47_20_)")||(G("(cAMP__47_21_<=cAMP__42_40_)")))))
Formula 0 simplified : !X("(cAMP__33_17_<=cAMP__47_20_)" | G"(cAMP__47_21_<=cAMP__42_40_)")
ITS-tools command line returned an error code 137
[2021-05-09 15:21:22] [INFO ] Flatten gal took : 2090 ms
[2021-05-09 15:21:24] [INFO ] Input system was already deterministic with 19404 transitions.
[2021-05-09 15:21:24] [INFO ] Transformed 2500 places.
[2021-05-09 15:21:24] [INFO ] Transformed 19404 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 15:21:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality3892761191979627220.gal : 55 ms
[2021-05-09 15:21:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality8542154990768963860.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/LTLCardinality3892761191979627220.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8542154990768963860.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/LTLCardinality3892761191979627220.gal -t CGAL -LTL /tmp/LTLCardinality8542154990768963860.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(("(cAMP__33_17_<=cAMP__47_20_)")||(G("(cAMP__47_21_<=cAMP__42_40_)")))))
Formula 0 simplified : !X("(cAMP__33_17_<=cAMP__47_20_)" | G"(cAMP__47_21_<=cAMP__42_40_)")

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-D50N150"
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-D50N150, 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-162048875100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N150.tgz
mv Diffusion2D-PT-D50N150 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;