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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.7M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620555456809

Running Version 0
[2021-05-09 10:17:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 10:17:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 10:17:38] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2021-05-09 10:17:38] [INFO ] Transformed 1600 places.
[2021-05-09 10:17:38] [INFO ] Transformed 12324 transitions.
[2021-05-09 10:17:38] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 10:17:38] [INFO ] Initial state test concluded for 4 properties.
FORMULA Diffusion2D-PT-D40N010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 363 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:17:39] [INFO ] Computed 1 place invariants in 141 ms
[2021-05-09 10:17:39] [INFO ] Implicit Places using invariants in 434 ms returned []
Implicit Place search using SMT only with invariants took 461 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:17:39] [INFO ] Computed 1 place invariants in 97 ms
[2021-05-09 10:17:44] [INFO ] Dead Transitions using invariants and state equation in 4845 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
[2021-05-09 10:17:45] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 10:17:45] [INFO ] Flatten gal took : 443 ms
FORMULA Diffusion2D-PT-D40N010-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 10:17:45] [INFO ] Flatten gal took : 276 ms
[2021-05-09 10:17:46] [INFO ] Input system was already deterministic with 12324 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=116 ) properties (out of 24) seen :22
Running SMT prover for 2 properties.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:17:47] [INFO ] Computed 1 place invariants in 88 ms
[2021-05-09 10:17:47] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:2
[2021-05-09 10:17:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2021-05-09 10:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:17:51] [INFO ] [Nat]Absence check using state equation in 3457 ms returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 448 ms.
[2021-05-09 10:17:51] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :2
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 18 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 47 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:17:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:17:51] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:17:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:17:51] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-09 10:17:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:17:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:17:51] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N010-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D40N010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-00 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U (p2||G(p1)))||(p3 U (p4||G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12282 edges and 1600 vertex of which 1597 / 1600 are part of one of the 1 SCC in 12 ms
Free SCC test removed 1596 places
Ensure Unique test removed 12317 transitions
Reduce isomorphic transitions removed 12317 transitions.
Applied a total of 1 rules in 32 ms. Remains 4 /1600 variables (removed 1596) and now considering 7/12324 (removed 12317) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:17:52] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:17:52] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:17:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:17:52] [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 10:17:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 10:17:52] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:17:52] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/1600 places, 7/12324 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3))]
Running random walk in product with property : Diffusion2D-PT-D40N010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p4) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p4) p3), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GT 2 s1) (GT 1 s2)), p1:(GT 1 s2), p0:(GT 2 s0), p4:(AND (GT 2 s1) (GT 2 s0)), p3:(GT 2 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D40N010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-01 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||(G(p1) U X((p2||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 302 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:17:52] [INFO ] Computed 1 place invariants in 59 ms
[2021-05-09 10:17:52] [INFO ] Implicit Places using invariants in 220 ms returned []
Implicit Place search using SMT only with invariants took 226 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:17:52] [INFO ] Computed 1 place invariants in 63 ms
[2021-05-09 10:17:57] [INFO ] Dead Transitions using invariants and state equation in 4581 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D40N010-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT 1 s188), p0:(AND (LEQ 3 s160) (GT s477 s504)), p2:(LEQ s477 s504)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1779 ms.
Product exploration explored 100000 steps with 50000 reset in 1444 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 1287 ms.
Product exploration explored 100000 steps with 50000 reset in 1289 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (NOT p1)]
Support contains 4 out of 1600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12260 edges and 1600 vertex of which 1596 / 1600 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1595 places
Ensure Unique test removed 12315 transitions
Reduce isomorphic transitions removed 12315 transitions.
Applied a total of 1 rules in 19 ms. Remains 5 /1600 variables (removed 1595) and now considering 9/12324 (removed 12315) transitions.
[2021-05-09 10:18:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 10:18:04] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:18:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/1600 places, 9/12324 transitions.
Product exploration explored 100000 steps with 50000 reset in 1401 ms.
Product exploration explored 100000 steps with 50000 reset in 1255 ms.
[2021-05-09 10:18:07] [INFO ] Flatten gal took : 222 ms
[2021-05-09 10:18:07] [INFO ] Flatten gal took : 230 ms
[2021-05-09 10:18:07] [INFO ] Time to serialize gal into /tmp/LTL15250493805474207609.gal : 86 ms
[2021-05-09 10:18:07] [INFO ] Time to serialize properties into /tmp/LTL9494095149923521730.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/LTL15250493805474207609.gal, -t, CGAL, -LTL, /tmp/LTL9494095149923521730.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/LTL15250493805474207609.gal -t CGAL -LTL /tmp/LTL9494095149923521730.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((cAMP__14_10_>=3)&&(cAMP__20_7_>cAMP__21_32_))"))||((G("(cAMP__14_36_<1)"))U(X(("(cAMP__20_7_<=cAMP__21_32_)")||(X("(cAMP__20_7_<=cAMP__21_32_)")))))))
Formula 0 simplified : !(X"((cAMP__14_10_>=3)&&(cAMP__20_7_>cAMP__21_32_))" | (G"(cAMP__14_36_<1)" U X("(cAMP__20_7_<=cAMP__21_32_)" | X"(cAMP__20_7_<=cAMP__21_32_)")))
Detected timeout of ITS tools.
[2021-05-09 10:18:22] [INFO ] Flatten gal took : 207 ms
[2021-05-09 10:18:22] [INFO ] Applying decomposition
[2021-05-09 10:18:22] [INFO ] Flatten gal took : 213 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/graph10110936524624182744.txt, -o, /tmp/graph10110936524624182744.bin, -w, /tmp/graph10110936524624182744.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/graph10110936524624182744.bin, -l, -1, -v, -w, /tmp/graph10110936524624182744.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:18:23] [INFO ] Decomposing Gal with order
[2021-05-09 10:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:18:24] [INFO ] Removed a total of 8644 redundant transitions.
[2021-05-09 10:18:24] [INFO ] Flatten gal took : 732 ms
[2021-05-09 10:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 110 ms.
[2021-05-09 10:18:25] [INFO ] Time to serialize gal into /tmp/LTL3541827721840725799.gal : 39 ms
[2021-05-09 10:18:25] [INFO ] Time to serialize properties into /tmp/LTL7978447507208438617.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/LTL3541827721840725799.gal, -t, CGAL, -LTL, /tmp/LTL7978447507208438617.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/LTL3541827721840725799.gal -t CGAL -LTL /tmp/LTL7978447507208438617.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((gi0.gi1.gi0.gu24.cAMP__14_10_>=3)&&(gu86.cAMP__20_7_>gu86.cAMP__21_32_))"))||((G("(gi4.gu33.cAMP__14_36_<1)"))U(X(("(gu86.cAMP__20_7_<=gu86.cAMP__21_32_)")||(X("(gu86.cAMP__20_7_<=gu86.cAMP__21_32_)")))))))
Formula 0 simplified : !(X"((gi0.gi1.gi0.gu24.cAMP__14_10_>=3)&&(gu86.cAMP__20_7_>gu86.cAMP__21_32_))" | (G"(gi4.gu33.cAMP__14_36_<1)" U X("(gu86.cAMP__20_7_<=gu86.cAMP__21_32_)" | X"(gu86.cAMP__20_7_<=gu86.cAMP__21_32_)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3694445051683256158
[2021-05-09 10:18:40] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3694445051683256158
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/ltsmin3694445051683256158]
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/ltsmin3694445051683256158] 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/ltsmin3694445051683256158] 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-D40N010-02 finished in 49213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (p0&&X((X(p1)&&(p0 U (p2||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 210 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:18:41] [INFO ] Computed 1 place invariants in 57 ms
[2021-05-09 10:18:41] [INFO ] Implicit Places using invariants in 249 ms returned []
Implicit Place search using SMT only with invariants took 249 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:18:42] [INFO ] Computed 1 place invariants in 56 ms
[2021-05-09 10:18:46] [INFO ] Dead Transitions using invariants and state equation in 4578 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Diffusion2D-PT-D40N010-04 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=5, aps=[p0:(LEQ 1 s298), p2:(GT s157 s911), p1:(OR (GT s357 s576) (GT s453 s824))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-04 finished in 5302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12234 edges and 1600 vertex of which 1594 / 1600 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1593 places
Ensure Unique test removed 12311 transitions
Reduce isomorphic transitions removed 12311 transitions.
Applied a total of 1 rules in 14 ms. Remains 7 /1600 variables (removed 1593) and now considering 13/12324 (removed 12311) transitions.
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:18:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:18:46] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:18:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:18:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-09 10:18:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:18:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:18:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/1600 places, 13/12324 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D40N010-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s2 s5), p1:(LEQ s1 s0), p2:(LEQ s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-05 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||((p1 U p2)&&F((p3&&F(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 221 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:18:47] [INFO ] Computed 1 place invariants in 58 ms
[2021-05-09 10:18:47] [INFO ] Implicit Places using invariants in 250 ms returned []
Implicit Place search using SMT only with invariants took 254 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:18:47] [INFO ] Computed 1 place invariants in 56 ms
[2021-05-09 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 4539 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p1), (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D40N010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s366 s1334), p2:(LEQ s563 s338), p1:(LEQ 2 s1506), p3:(GT 3 s1159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1663 ms.
Product exploration explored 100000 steps with 50000 reset in 1463 ms.
Knowledge obtained : [p0, p2, (NOT p1), p3]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p1), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 1602 ms.
Product exploration explored 100000 steps with 50000 reset in 1564 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p1), (NOT p3)]
Support contains 6 out of 1600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12234 edges and 1600 vertex of which 1594 / 1600 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1593 places
Ensure Unique test removed 12311 transitions
Reduce isomorphic transitions removed 12311 transitions.
Applied a total of 1 rules in 11 ms. Remains 7 /1600 variables (removed 1593) and now considering 13/12324 (removed 12311) transitions.
[2021-05-09 10:18:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2021-05-09 10:18:59] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:18:59] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/1600 places, 13/12324 transitions.
Product exploration explored 100000 steps with 50000 reset in 1322 ms.
Product exploration explored 100000 steps with 50000 reset in 1384 ms.
[2021-05-09 10:19:02] [INFO ] Flatten gal took : 221 ms
[2021-05-09 10:19:02] [INFO ] Flatten gal took : 230 ms
[2021-05-09 10:19:02] [INFO ] Time to serialize gal into /tmp/LTL10609534306028182009.gal : 38 ms
[2021-05-09 10:19:02] [INFO ] Time to serialize properties into /tmp/LTL14446803868139760906.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/LTL10609534306028182009.gal, -t, CGAL, -LTL, /tmp/LTL14446803868139760906.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/LTL10609534306028182009.gal -t CGAL -LTL /tmp/LTL14446803868139760906.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(cAMP__19_16_<=cAMP__40_23_)")||((("(cAMP__7_34_>=2)")U("(cAMP__23_13_<=cAMP__18_27_)"))&&(F(("(cAMP__36_9_<3)")&&(F(G("(cAMP__7_34_>=2)")))))))))
Formula 0 simplified : !X("(cAMP__19_16_<=cAMP__40_23_)" | (("(cAMP__7_34_>=2)" U "(cAMP__23_13_<=cAMP__18_27_)") & F("(cAMP__36_9_<3)" & FG"(cAMP__7_34_>=2)")))
Detected timeout of ITS tools.
[2021-05-09 10:19:17] [INFO ] Flatten gal took : 213 ms
[2021-05-09 10:19:17] [INFO ] Applying decomposition
[2021-05-09 10:19:18] [INFO ] Flatten gal took : 225 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/graph15113196657699130175.txt, -o, /tmp/graph15113196657699130175.bin, -w, /tmp/graph15113196657699130175.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/graph15113196657699130175.bin, -l, -1, -v, -w, /tmp/graph15113196657699130175.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:19:18] [INFO ] Decomposing Gal with order
[2021-05-09 10:19:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:19:19] [INFO ] Removed a total of 8224 redundant transitions.
[2021-05-09 10:19:19] [INFO ] Flatten gal took : 519 ms
[2021-05-09 10:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 50 ms.
[2021-05-09 10:19:19] [INFO ] Time to serialize gal into /tmp/LTL7647680063097551705.gal : 28 ms
[2021-05-09 10:19:19] [INFO ] Time to serialize properties into /tmp/LTL5136162779555054095.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/LTL7647680063097551705.gal, -t, CGAL, -LTL, /tmp/LTL5136162779555054095.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/LTL7647680063097551705.gal -t CGAL -LTL /tmp/LTL5136162779555054095.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu56.cAMP__19_16_<=gu56.cAMP__40_23_)")||((("(gi6.gi1.gi0.gu206.cAMP__7_34_>=2)")U("(gu54.cAMP__23_13_<=gu54.cAMP__18_27_)"))&&(F(("(gi5.gu170.cAMP__36_9_<3)")&&(F(G("(gi6.gi1.gi0.gu206.cAMP__7_34_>=2)")))))))))
Formula 0 simplified : !X("(gu56.cAMP__19_16_<=gu56.cAMP__40_23_)" | (("(gi6.gi1.gi0.gu206.cAMP__7_34_>=2)" U "(gu54.cAMP__23_13_<=gu54.cAMP__18_27_)") & F("(gi5.gu170.cAMP__36_9_<3)" & FG"(gi6.gi1.gi0.gu206.cAMP__7_34_>=2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4897840337168635439
[2021-05-09 10:19:34] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4897840337168635439
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/ltsmin4897840337168635439]
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/ltsmin4897840337168635439] 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/ltsmin4897840337168635439] 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-D40N010-07 finished in 48856 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12244 edges and 1600 vertex of which 1595 / 1600 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1594 places
Ensure Unique test removed 12313 transitions
Reduce isomorphic transitions removed 12313 transitions.
Applied a total of 1 rules in 11 ms. Remains 6 /1600 variables (removed 1594) and now considering 11/12324 (removed 12313) transitions.
// Phase 1: matrix 11 rows 6 cols
[2021-05-09 10:19:35] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:19:35] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2021-05-09 10:19:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:19:35] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-09 10:19:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2021-05-09 10:19:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:19:35] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/1600 places, 11/12324 transitions.
Stuttering acceptance computed with spot in 47 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N010-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s2), p0:(OR (LEQ s4 s3) (LEQ s1 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-10 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 207 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:19:36] [INFO ] Computed 1 place invariants in 56 ms
[2021-05-09 10:19:36] [INFO ] Implicit Places using invariants in 217 ms returned []
Implicit Place search using SMT only with invariants took 218 ms to find 0 implicit places.
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-09 10:19:36] [INFO ] Computed 1 place invariants in 63 ms
[2021-05-09 10:19:40] [INFO ] Dead Transitions using invariants and state equation in 4116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s206 s115)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1265 ms.
Product exploration explored 100000 steps with 33333 reset in 1097 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 1106 ms.
Product exploration explored 100000 steps with 33333 reset in 1040 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12292 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1597 places
Ensure Unique test removed 12319 transitions
Reduce isomorphic transitions removed 12319 transitions.
Applied a total of 1 rules in 29 ms. Remains 3 /1600 variables (removed 1597) and now considering 5/12324 (removed 12319) transitions.
[2021-05-09 10:19:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:19:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:19:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/1600 places, 5/12324 transitions.
Product exploration explored 100000 steps with 33333 reset in 923 ms.
Product exploration explored 100000 steps with 33333 reset in 929 ms.
[2021-05-09 10:19:47] [INFO ] Flatten gal took : 202 ms
[2021-05-09 10:19:47] [INFO ] Flatten gal took : 211 ms
[2021-05-09 10:19:47] [INFO ] Time to serialize gal into /tmp/LTL4358805687981181370.gal : 21 ms
[2021-05-09 10:19:47] [INFO ] Time to serialize properties into /tmp/LTL9814948554864857787.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/LTL4358805687981181370.gal, -t, CGAL, -LTL, /tmp/LTL9814948554864857787.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/LTL4358805687981181370.gal -t CGAL -LTL /tmp/LTL9814948554864857787.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(cAMP__15_16_<=cAMP__12_5_)")))))
Formula 0 simplified : !XXF"(cAMP__15_16_<=cAMP__12_5_)"
Detected timeout of ITS tools.
[2021-05-09 10:20:03] [INFO ] Flatten gal took : 206 ms
[2021-05-09 10:20:03] [INFO ] Applying decomposition
[2021-05-09 10:20:03] [INFO ] Flatten gal took : 210 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11070447616192385275.txt, -o, /tmp/graph11070447616192385275.bin, -w, /tmp/graph11070447616192385275.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/graph11070447616192385275.bin, -l, -1, -v, -w, /tmp/graph11070447616192385275.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:20:03] [INFO ] Decomposing Gal with order
[2021-05-09 10:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:20:04] [INFO ] Removed a total of 9064 redundant transitions.
[2021-05-09 10:20:04] [INFO ] Flatten gal took : 451 ms
[2021-05-09 10:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 73 ms.
[2021-05-09 10:20:05] [INFO ] Time to serialize gal into /tmp/LTL12055984525327611809.gal : 48 ms
[2021-05-09 10:20:05] [INFO ] Time to serialize properties into /tmp/LTL11873196450934918879.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/LTL12055984525327611809.gal, -t, CGAL, -LTL, /tmp/LTL11873196450934918879.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/LTL12055984525327611809.gal -t CGAL -LTL /tmp/LTL11873196450934918879.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(gu27.cAMP__15_16_<=gu27.cAMP__12_5_)")))))
Formula 0 simplified : !XXF"(gu27.cAMP__15_16_<=gu27.cAMP__12_5_)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13749939936617242391
[2021-05-09 10:20:20] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13749939936617242391
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/ltsmin13749939936617242391]
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/ltsmin13749939936617242391] 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/ltsmin13749939936617242391] 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-D40N010-11 finished in 45631 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12292 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1597 places
Ensure Unique test removed 12319 transitions
Reduce isomorphic transitions removed 12319 transitions.
Applied a total of 1 rules in 10 ms. Remains 3 /1600 variables (removed 1597) and now considering 5/12324 (removed 12319) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:20:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:20:21] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:20:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:20:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-09 10:20:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 10:20:21] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:20:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/1600 places, 5/12324 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N010-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-D40N010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-12 finished in 109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 10 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:20:21] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 10:20:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:20:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:20:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-09 10:20:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 10:20:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 10:20:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N010-14 finished in 120 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11482137630451300092
[2021-05-09 10:20:21] [INFO ] Too many transitions (12324) to apply POR reductions. Disabling POR matrices.
[2021-05-09 10:20:22] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11482137630451300092
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/ltsmin11482137630451300092]
[2021-05-09 10:20:22] [INFO ] Applying decomposition
[2021-05-09 10:20:22] [INFO ] Flatten gal took : 499 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/graph3964883142967766907.txt, -o, /tmp/graph3964883142967766907.bin, -w, /tmp/graph3964883142967766907.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/graph3964883142967766907.bin, -l, -1, -v, -w, /tmp/graph3964883142967766907.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 10:20:23] [INFO ] Decomposing Gal with order
[2021-05-09 10:20:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 10:20:24] [INFO ] Removed a total of 8650 redundant transitions.
[2021-05-09 10:20:24] [INFO ] Flatten gal took : 734 ms
[2021-05-09 10:20:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 118 ms.
[2021-05-09 10:20:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality1402420046743030424.gal : 61 ms
[2021-05-09 10:20:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality10462229006846531377.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/LTLCardinality1402420046743030424.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10462229006846531377.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/LTLCardinality1402420046743030424.gal -t CGAL -LTL /tmp/LTLCardinality10462229006846531377.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !(((X("((gi1.gi0.gi0.gu13.cAMP__14_10_>=3)&&(gu83.cAMP__20_7_>gu83.cAMP__21_32_))"))||((G("(gi1.gi2.gi1.gu29.cAMP__14_36_<1)"))U(X(("(gu83.cAMP__20_7_<=gu83.cAMP__21_32_)")||(X("(gu83.cAMP__20_7_<=gu83.cAMP__21_32_)")))))))
Formula 0 simplified : !(X"((gi1.gi0.gi0.gu13.cAMP__14_10_>=3)&&(gu83.cAMP__20_7_>gu83.cAMP__21_32_))" | (G"(gi1.gi2.gi1.gu29.cAMP__14_36_<1)" U X("(gu83.cAMP__20_7_<=gu83.cAMP__21_32_)" | X"(gu83.cAMP__20_7_<=gu83.cAMP__21_32_)")))
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/ltsmin11482137630451300092] killed by timeout after 36 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/ltsmin11482137630451300092] killed by timeout after 36 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
19877 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,199.655,2478712,1,0,6,1.43282e+07,29,0,80032,1.44747e+06,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D40N010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(("(gu199.cAMP__19_16_<=gu199.cAMP__40_23_)")||((("(gi1.gi2.gu217.cAMP__7_34_>=2)")U("(gu96.cAMP__23_13_<=gu96.cAMP__18_27_)"))&&(F(("(gi4.gi0.gi9.gu171.cAMP__36_9_<3)")&&(F(G("(gi1.gi2.gu217.cAMP__7_34_>=2)")))))))))
Formula 1 simplified : !X("(gu199.cAMP__19_16_<=gu199.cAMP__40_23_)" | (("(gi1.gi2.gu217.cAMP__7_34_>=2)" U "(gu96.cAMP__23_13_<=gu96.cAMP__18_27_)") & F("(gi4.gi0.gi9.gu171.cAMP__36_9_<3)" & FG"(gi1.gi2.gu217.cAMP__7_34_>=2)")))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,199.665,2480304,1,0,6,1.43282e+07,67,0,80069,1.44747e+06,21
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D40N010-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(F("(gu22.cAMP__15_16_<=gu22.cAMP__12_5_)")))))
Formula 2 simplified : !XXF"(gu22.cAMP__15_16_<=gu22.cAMP__12_5_)"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1249 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,212.161,2482308,1,0,7,1.43301e+07,14,0,38923,1.44804e+06,4
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D40N010-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1620555893865

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

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D40N010.tgz
mv Diffusion2D-PT-D40N010 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 ;