About the Execution of ITS-Tools for PhilosophersDyn-COL-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16200.000 | 3600000.00 | 12859176.00 | 53171.30 | T?FFTFTFFFT?FTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016600388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-COL-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600388
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 8.5K Apr 30 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 30 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 08:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 08:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 32K May 10 09:34 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 PhilosophersDyn-COL-20-LTLFireability-00
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-01
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-02
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-03
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-04
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-05
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-06
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-07
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-08
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-09
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-10
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-11
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-12
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-13
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-14
FORMULA_NAME PhilosophersDyn-COL-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652836966763
Running Version 202205111006
[2022-05-18 01:22:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 01:22:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:22:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 01:22:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 01:22:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2022-05-18 01:22:48] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 01:22:48] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 6 ms.
[2022-05-18 01:22:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PhilosophersDyn-COL-20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 6 steps, including 0 resets, run visited all 7 properties in 12 ms. (steps per millisecond=0 )
[2022-05-18 01:22:48] [INFO ] Flatten gal took : 16 ms
[2022-05-18 01:22:48] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(20), Philosopher(20)] of place Neighbourhood breaks symmetries in sort Philosopher
[2022-05-18 01:22:49] [INFO ] Unfolded HLPN to a Petri net with 540 places and 17220 transitions 140780 arcs in 207 ms.
[2022-05-18 01:22:49] [INFO ] Unfolded 10 HLPN properties in 15 ms.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
[2022-05-18 01:22:49] [INFO ] Reduced 379 identical enabling conditions.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 141 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2022-05-18 01:22:50] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2022-05-18 01:22:51] [INFO ] Computed 79 place invariants in 910 ms
[2022-05-18 01:22:58] [INFO ] Dead Transitions using invariants and state equation in 7807 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:23:00] [INFO ] Computed 79 place invariants in 2069 ms
[2022-05-18 01:23:00] [INFO ] Implicit Places using invariants in 2198 ms returned []
Implicit Place search using SMT only with invariants took 2199 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 93 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/17030 transitions.
Support contains 540 out of 540 places after structural reductions.
[2022-05-18 01:23:03] [INFO ] Flatten gal took : 1646 ms
[2022-05-18 01:23:10] [INFO ] Flatten gal took : 1856 ms
[2022-05-18 01:23:18] [INFO ] Input system was already deterministic with 15470 transitions.
Finished random walk after 1010 steps, including 119 resets, run visited all 13 properties in 155 ms. (steps per millisecond=6 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 65 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:23:23] [INFO ] Computed 79 place invariants in 1844 ms
[2022-05-18 01:23:29] [INFO ] Dead Transitions using invariants and state equation in 7967 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:23:31] [INFO ] Computed 79 place invariants in 1818 ms
[2022-05-18 01:23:31] [INFO ] Implicit Places using invariants in 2033 ms returned []
Implicit Place search using SMT only with invariants took 2036 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:23:33] [INFO ] Computed 79 place invariants in 1797 ms
[2022-05-18 01:23:39] [INFO ] Dead Transitions using invariants and state equation in 7604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s120 1) (GEQ s121 1) (GEQ s122 1) (GEQ s123 1) (GEQ s124 1) (GEQ s125 1) (GEQ s126 1) (GEQ s127 1) (GEQ s128 1) (GEQ s129 1) (GEQ s130 1)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8735 ms.
Product exploration explored 100000 steps with 50000 reset in 8306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLFireability-00 finished in 35501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3461 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:24:02] [INFO ] Computed 79 place invariants in 1903 ms
[2022-05-18 01:24:08] [INFO ] Dead Transitions using invariants and state equation in 7895 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:24:09] [INFO ] Computed 79 place invariants in 1810 ms
[2022-05-18 01:24:10] [INFO ] Implicit Places using invariants in 1993 ms returned []
Implicit Place search using SMT only with invariants took 1994 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:24:11] [INFO ] Computed 79 place invariants in 1800 ms
[2022-05-18 01:24:17] [INFO ] Dead Transitions using invariants and state equation in 7341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-01 automaton TGBA Formula[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:(AND (OR (LT s81 1) (LT s87 1) (LT s135 1) (LT s167 1)) (OR (LT s83 1) (LT s93 1) (LT s121 1) (LT s213 1)) (OR (LT s92 1) (LT s95 1) (LT s122 1) (LT s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 41280 steps with 7932 reset in 10001 ms.
Product exploration timeout after 40990 steps with 7857 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3681 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:24:43] [INFO ] Computed 79 place invariants in 1760 ms
[2022-05-18 01:24:49] [INFO ] Dead Transitions using invariants and state equation in 7726 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:24:51] [INFO ] Computed 79 place invariants in 1713 ms
[2022-05-18 01:24:51] [INFO ] Implicit Places using invariants in 1931 ms returned []
Implicit Place search using SMT only with invariants took 1932 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:24:53] [INFO ] Computed 79 place invariants in 1787 ms
[2022-05-18 01:24:59] [INFO ] Dead Transitions using invariants and state equation in 8142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 37050 steps with 7112 reset in 10001 ms.
Product exploration timeout after 37860 steps with 7244 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9491415477206159893
[2022-05-18 01:25:20] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:25:21] [INFO ] Built C files in 227ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9491415477206159893
Running compilation step : cd /tmp/ltsmin9491415477206159893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9491415477206159893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9491415477206159893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3849 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:25:29] [INFO ] Computed 79 place invariants in 1823 ms
[2022-05-18 01:25:35] [INFO ] Dead Transitions using invariants and state equation in 7918 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:25:37] [INFO ] Computed 79 place invariants in 1792 ms
[2022-05-18 01:25:37] [INFO ] Implicit Places using invariants in 2008 ms returned []
Implicit Place search using SMT only with invariants took 2009 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:25:39] [INFO ] Computed 79 place invariants in 1723 ms
[2022-05-18 01:25:46] [INFO ] Dead Transitions using invariants and state equation in 8756 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Built C files in :
/tmp/ltsmin1236621567722060995
[2022-05-18 01:25:46] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:25:46] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1236621567722060995
Running compilation step : cd /tmp/ltsmin1236621567722060995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1236621567722060995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1236621567722060995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:25:53] [INFO ] Flatten gal took : 909 ms
[2022-05-18 01:25:54] [INFO ] Flatten gal took : 838 ms
[2022-05-18 01:25:54] [INFO ] Time to serialize gal into /tmp/LTL924821328364406986.gal : 167 ms
[2022-05-18 01:25:54] [INFO ] Time to serialize properties into /tmp/LTL5223970672231404727.ltl : 72 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL924821328364406986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5223970672231404727.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9248213...265
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((Forks_1<1)||(Forks_7<1))||((Outside_15<1)||(Neighbourhood_27<1)))&&(((Forks_3<1)||(Forks_13<1))||((Outside_1<1...579630
Formula 0 simplified : !GF"((((((((((((((((Forks_1<1)||(Forks_7<1))||((Outside_15<1)||(Neighbourhood_27<1)))&&(((Forks_3<1)||(Forks_13<1))||((Outside_1<1)|...579624
Detected timeout of ITS tools.
[2022-05-18 01:26:10] [INFO ] Flatten gal took : 926 ms
[2022-05-18 01:26:10] [INFO ] Applying decomposition
[2022-05-18 01:26:11] [INFO ] Flatten gal took : 819 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2073373158510836917.txt' '-o' '/tmp/graph2073373158510836917.bin' '-w' '/tmp/graph2073373158510836917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2073373158510836917.bin' '-l' '-1' '-v' '-w' '/tmp/graph2073373158510836917.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:26:13] [INFO ] Decomposing Gal with order
[2022-05-18 01:26:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:26:23] [INFO ] Removed a total of 24980 redundant transitions.
[2022-05-18 01:26:24] [INFO ] Flatten gal took : 10102 ms
[2022-05-18 01:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 173 ms.
[2022-05-18 01:26:26] [INFO ] Time to serialize gal into /tmp/LTL16006579529963285859.gal : 201 ms
[2022-05-18 01:26:26] [INFO ] Time to serialize properties into /tmp/LTL17613690588376845674.ltl : 59 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16006579529963285859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17613690588376845674.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1600657...247
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((u26.Forks_1<1)||(i16.u31.Forks_7<1))||((i1.u22.Outside_15<1)||(i16.u31.Neighbourhood_27<1)))&&(((i4.u18.Forks_...803990
Formula 0 simplified : !GF"((((((((((((((((u26.Forks_1<1)||(i16.u31.Forks_7<1))||((i1.u22.Outside_15<1)||(i16.u31.Neighbourhood_27<1)))&&(((i4.u18.Forks_3<...803984
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18066641523409085689
[2022-05-18 01:26:42] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18066641523409085689
Running compilation step : cd /tmp/ltsmin18066641523409085689;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18066641523409085689;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18066641523409085689;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PhilosophersDyn-COL-20-LTLFireability-01 finished in 168477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!p0) U G(p1)) U !p2)))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 52 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:26:47] [INFO ] Computed 79 place invariants in 1865 ms
[2022-05-18 01:26:52] [INFO ] Dead Transitions using invariants and state equation in 7674 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:26:54] [INFO ] Computed 79 place invariants in 1763 ms
[2022-05-18 01:26:54] [INFO ] Implicit Places using invariants in 1913 ms returned []
Implicit Place search using SMT only with invariants took 1914 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:26:56] [INFO ] Computed 79 place invariants in 1826 ms
[2022-05-18 01:27:02] [INFO ] Dead Transitions using invariants and state equation in 7467 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 291 ms :[p2, p2, p0, (NOT p1), (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s58 1) (GEQ s92 1) (GEQ s512 1)) (AND (GEQ s53 1) (GEQ s83 1) (GEQ s403 1)) (AND (GEQ s58 1) (GEQ s82 1) (GEQ s502 1)) (AND (GEQ s53 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 78050 steps with 39025 reset in 10001 ms.
Product exploration timeout after 84650 steps with 42325 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-20-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLFireability-04 finished in 38052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3633 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:27:28] [INFO ] Computed 79 place invariants in 1813 ms
[2022-05-18 01:27:34] [INFO ] Dead Transitions using invariants and state equation in 7338 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:27:36] [INFO ] Computed 79 place invariants in 2259 ms
[2022-05-18 01:27:37] [INFO ] Implicit Places using invariants in 3018 ms returned []
Implicit Place search using SMT only with invariants took 3019 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:27:39] [INFO ] Computed 79 place invariants in 1960 ms
[2022-05-18 01:27:44] [INFO ] Dead Transitions using invariants and state equation in 7714 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s58 1) (GEQ s92 1) (GEQ s512 1)) (AND (GEQ s53 1) (GEQ s83 1) (GEQ s403 1)) (AND (GEQ s58 1) (GEQ s82 1) (GEQ s502 1)) (AND (GEQ s53 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 61 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-05 finished in 21853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&F(!p0))))'
Support contains 440 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3364 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:27:50] [INFO ] Computed 79 place invariants in 1965 ms
[2022-05-18 01:27:56] [INFO ] Dead Transitions using invariants and state equation in 7577 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:27:57] [INFO ] Computed 79 place invariants in 1777 ms
[2022-05-18 01:27:59] [INFO ] Implicit Places using invariants in 3173 ms returned []
Implicit Place search using SMT only with invariants took 3175 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:00] [INFO ] Computed 79 place invariants in 1731 ms
[2022-05-18 01:28:06] [INFO ] Dead Transitions using invariants and state equation in 7308 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), p0]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s28 1) (LT s307 1)) (OR (LT s12 1) (LT s32 1) (LT s385 1)) (OR (LT s2 1) (LT s22 1) (LT s198 1)) (OR (LT s4 1) (LT s24 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 2 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-07 finished in 21675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U X(p0)))&&(X(p2)||p1))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 51 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:08] [INFO ] Computed 79 place invariants in 1846 ms
[2022-05-18 01:28:14] [INFO ] Dead Transitions using invariants and state equation in 7849 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:16] [INFO ] Computed 79 place invariants in 1909 ms
[2022-05-18 01:28:16] [INFO ] Implicit Places using invariants in 2094 ms returned []
Implicit Place search using SMT only with invariants took 2099 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:18] [INFO ] Computed 79 place invariants in 1794 ms
[2022-05-18 01:28:24] [INFO ] Dead Transitions using invariants and state equation in 7480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s120 1) (GEQ s121 1) (GEQ s122 1) (GEQ s123 1) (GEQ s124 1) (GEQ s125 1) (GEQ s126 1) (GEQ s127 1) (GEQ s128 1) (GEQ s129 1) (GEQ s130 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-08 finished in 17885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X((G(X((X(p1)&&p2)))||F(p3)))))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 55 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:26] [INFO ] Computed 79 place invariants in 1734 ms
[2022-05-18 01:28:32] [INFO ] Dead Transitions using invariants and state equation in 7523 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:34] [INFO ] Computed 79 place invariants in 1770 ms
[2022-05-18 01:28:34] [INFO ] Implicit Places using invariants in 1985 ms returned []
Implicit Place search using SMT only with invariants took 1986 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:28:36] [INFO ] Computed 79 place invariants in 1810 ms
[2022-05-18 01:28:42] [INFO ] Dead Transitions using invariants and state equation in 7789 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s120 1) (LT s121 1) (LT s122 1) (LT s123 1) (LT s124 1) (LT s125 1) (LT s126 1) (LT s127 1) (LT s128 1) (LT s129 1) (LT s130 1) (LT s131 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8402 ms.
Product exploration explored 100000 steps with 50000 reset in 8260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p3))))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 5 states, 7 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-COL-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLFireability-10 finished in 34548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(X((G(p0)||F(p1)))))))))'
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3300 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:29:04] [INFO ] Computed 79 place invariants in 1764 ms
[2022-05-18 01:29:10] [INFO ] Dead Transitions using invariants and state equation in 7894 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:29:12] [INFO ] Computed 79 place invariants in 1788 ms
[2022-05-18 01:29:13] [INFO ] Implicit Places using invariants in 2576 ms returned []
Implicit Place search using SMT only with invariants took 2581 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:29:14] [INFO ] Computed 79 place invariants in 1795 ms
[2022-05-18 01:29:20] [INFO ] Dead Transitions using invariants and state equation in 7897 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s95 1) (LT s115 1) (LT s455 1) (LT s459 1)) (OR (LT s84 1) (LT s104 1) (LT s184 1) (LT s237 1)) (OR (LT s80 1) (LT s100 1) (LT s153 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 24220 steps with 3745 reset in 10005 ms.
Product exploration timeout after 24910 steps with 3851 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3402 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:29:47] [INFO ] Computed 79 place invariants in 1766 ms
[2022-05-18 01:29:53] [INFO ] Dead Transitions using invariants and state equation in 7912 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:29:55] [INFO ] Computed 79 place invariants in 1733 ms
[2022-05-18 01:29:55] [INFO ] Implicit Places using invariants in 2478 ms returned []
Implicit Place search using SMT only with invariants took 2482 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:29:57] [INFO ] Computed 79 place invariants in 1746 ms
[2022-05-18 01:30:03] [INFO ] Dead Transitions using invariants and state equation in 7975 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 25230 steps with 3896 reset in 10002 ms.
Product exploration timeout after 25220 steps with 3898 reset in 10004 ms.
Built C files in :
/tmp/ltsmin6489132522144604013
[2022-05-18 01:30:25] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:30:25] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6489132522144604013
Running compilation step : cd /tmp/ltsmin6489132522144604013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6489132522144604013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6489132522144604013;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 500 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3416 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:30:33] [INFO ] Computed 79 place invariants in 1717 ms
[2022-05-18 01:30:39] [INFO ] Dead Transitions using invariants and state equation in 7839 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:30:41] [INFO ] Computed 79 place invariants in 1807 ms
[2022-05-18 01:30:42] [INFO ] Implicit Places using invariants in 2558 ms returned []
Implicit Place search using SMT only with invariants took 2566 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:30:43] [INFO ] Computed 79 place invariants in 1782 ms
[2022-05-18 01:30:49] [INFO ] Dead Transitions using invariants and state equation in 7691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Built C files in :
/tmp/ltsmin3731310729549659558
[2022-05-18 01:30:49] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:30:50] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3731310729549659558
Running compilation step : cd /tmp/ltsmin3731310729549659558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3731310729549659558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3731310729549659558;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 01:30:55] [INFO ] Flatten gal took : 852 ms
[2022-05-18 01:30:56] [INFO ] Flatten gal took : 783 ms
[2022-05-18 01:30:56] [INFO ] Time to serialize gal into /tmp/LTL1671198210982977272.gal : 152 ms
[2022-05-18 01:30:56] [INFO ] Time to serialize properties into /tmp/LTL4470585405965153904.ltl : 43 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1671198210982977272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4470585405965153904.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1671198...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F(X(G(X((G("(((((((((((((((((Forks_15<1)||(Think_15<1))||((Neighbourhood_315<1)||(Neighbourhood_319<1)))&&(((Forks_4<1)||(Think...692538
Formula 0 simplified : !XGFXGX(G"(((((((((((((((((Forks_15<1)||(Think_15<1))||((Neighbourhood_315<1)||(Neighbourhood_319<1)))&&(((Forks_4<1)||(Think_4<1))|...692519
Detected timeout of ITS tools.
[2022-05-18 01:31:12] [INFO ] Flatten gal took : 818 ms
[2022-05-18 01:31:12] [INFO ] Applying decomposition
[2022-05-18 01:31:13] [INFO ] Flatten gal took : 783 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17225438547905926002.txt' '-o' '/tmp/graph17225438547905926002.bin' '-w' '/tmp/graph17225438547905926002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17225438547905926002.bin' '-l' '-1' '-v' '-w' '/tmp/graph17225438547905926002.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:31:15] [INFO ] Decomposing Gal with order
[2022-05-18 01:31:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:31:23] [INFO ] Removed a total of 25000 redundant transitions.
[2022-05-18 01:31:24] [INFO ] Flatten gal took : 8377 ms
[2022-05-18 01:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 108 ms.
[2022-05-18 01:31:25] [INFO ] Time to serialize gal into /tmp/LTL8092588042636067058.gal : 100 ms
[2022-05-18 01:31:25] [INFO ] Time to serialize properties into /tmp/LTL11299616445333892928.ltl : 81 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8092588042636067058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11299616445333892928.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8092588...246
Read 1 LTL properties
Checking formula 0 : !((X(G(F(X(G(X((G("(((((((((((((((((i3.u22.Forks_15<1)||(i3.u22.Think_15<1))||((i3.u22.Neighbourhood_315<1)||(i19.u38.Neighbourhood_31...943112
Formula 0 simplified : !XGFXGX(G"(((((((((((((((((i3.u22.Forks_15<1)||(i3.u22.Think_15<1))||((i3.u22.Neighbourhood_315<1)||(i19.u38.Neighbourhood_319<1)))&...943093
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9665761799529594934
[2022-05-18 01:31:41] [INFO ] Built C files in 223ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9665761799529594934
Running compilation step : cd /tmp/ltsmin9665761799529594934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9665761799529594934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9665761799529594934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PhilosophersDyn-COL-20-LTLFireability-11 finished in 164913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U G(p1))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 56 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:31:46] [INFO ] Computed 79 place invariants in 1858 ms
[2022-05-18 01:31:51] [INFO ] Dead Transitions using invariants and state equation in 7545 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:31:53] [INFO ] Computed 79 place invariants in 1881 ms
[2022-05-18 01:31:53] [INFO ] Implicit Places using invariants in 2027 ms returned []
Implicit Place search using SMT only with invariants took 2028 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:31:55] [INFO ] Computed 79 place invariants in 1830 ms
[2022-05-18 01:32:01] [INFO ] Dead Transitions using invariants and state equation in 7611 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s58 1) (GEQ s92 1) (GEQ s512 1)) (AND (GEQ s53 1) (GEQ s83 1) (GEQ s403 1)) (AND (GEQ s58 1) (GEQ s82 1) (GEQ s502 1)) (AND (GEQ s53 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 4 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-12 finished in 17464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))||G(p1)))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 50 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:32:03] [INFO ] Computed 79 place invariants in 1767 ms
[2022-05-18 01:32:09] [INFO ] Dead Transitions using invariants and state equation in 7406 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:32:11] [INFO ] Computed 79 place invariants in 1978 ms
[2022-05-18 01:32:11] [INFO ] Implicit Places using invariants in 2108 ms returned []
Implicit Place search using SMT only with invariants took 2110 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 01:32:12] [INFO ] Computed 79 place invariants in 1707 ms
[2022-05-18 01:32:18] [INFO ] Dead Transitions using invariants and state equation in 7304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(OR (AND (GEQ s120 1) (GEQ s121 1) (GEQ s122 1) (GEQ s123 1) (GEQ s124 1) (GEQ s125 1) (GEQ s126 1) (GEQ s127 1) (GEQ s128 1) (GEQ s129 1) (GEQ s130 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLFireability-14 finished in 17091 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(X((G(p0)||F(p1)))))))))'
[2022-05-18 01:32:20] [INFO ] Flatten gal took : 922 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3676072282206155389
[2022-05-18 01:32:20] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2022-05-18 01:32:21] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3676072282206155389
Running compilation step : cd /tmp/ltsmin3676072282206155389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 01:32:21] [INFO ] Applying decomposition
[2022-05-18 01:32:23] [INFO ] Flatten gal took : 1655 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18048700583330214536.txt' '-o' '/tmp/graph18048700583330214536.bin' '-w' '/tmp/graph18048700583330214536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18048700583330214536.bin' '-l' '-1' '-v' '-w' '/tmp/graph18048700583330214536.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:32:25] [INFO ] Decomposing Gal with order
[2022-05-18 01:32:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:32:37] [INFO ] Removed a total of 24620 redundant transitions.
[2022-05-18 01:32:38] [INFO ] Flatten gal took : 11910 ms
[2022-05-18 01:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 77 ms.
[2022-05-18 01:32:39] [INFO ] Time to serialize gal into /tmp/LTLFireability7557522270985816779.gal : 120 ms
[2022-05-18 01:32:39] [INFO ] Time to serialize properties into /tmp/LTLFireability16072613823435446754.ltl : 71 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7557522270985816779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16072613823435446754.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((u0.Forks_1<1)||(u3.Forks_7<1))||((u17.Outside_15<1)||(u0.Neighbourhood_27<1)))&&(((u10.Forks_3<1)||(u15.Forks_...690230
Formula 0 simplified : !GF"((((((((((((((((u0.Forks_1<1)||(u3.Forks_7<1))||((u17.Outside_15<1)||(u0.Neighbourhood_27<1)))&&(((u10.Forks_3<1)||(u15.Forks_13...690224
Compilation finished in 167560 ms.
Running link step : cd /tmp/ltsmin3676072282206155389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 154 ms.
Running LTSmin : cd /tmp/ltsmin3676072282206155389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 01:55:51] [INFO ] Applying decomposition
[2022-05-18 01:55:54] [INFO ] Flatten gal took : 2279 ms
[2022-05-18 01:55:55] [INFO ] Decomposing Gal with order
[2022-05-18 01:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:56:00] [INFO ] Removed a total of 76920 redundant transitions.
[2022-05-18 01:56:01] [INFO ] Flatten gal took : 4572 ms
[2022-05-18 01:56:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 877 ms.
[2022-05-18 01:56:03] [INFO ] Time to serialize gal into /tmp/LTLFireability4737137524506423223.gal : 105 ms
[2022-05-18 01:56:03] [INFO ] Time to serialize properties into /tmp/LTLFireability14950525357865145238.ltl : 298 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4737137524506423223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14950525357865145238.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((((((((((((Philosopher1.Forks_1<1)||(Philosopher7.Forks_7<1))||((Philosopher15.Outside_15<1)||(PhilosopherPhilosopher27.N...1104030
Formula 0 simplified : !GF"((((((((((((((((Philosopher1.Forks_1<1)||(Philosopher7.Forks_7<1))||((Philosopher15.Outside_15<1)||(PhilosopherPhilosopher27.Nei...1104024
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin3676072282206155389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3676072282206155389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(X([](X(([]((LTLAPp1==true))||<>((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 02:19:21] [INFO ] Flatten gal took : 4116 ms
[2022-05-18 02:19:24] [INFO ] Input system was already deterministic with 15470 transitions.
[2022-05-18 02:19:25] [INFO ] Transformed 540 places.
[2022-05-18 02:19:25] [INFO ] Transformed 15470 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 02:19:29] [INFO ] Time to serialize gal into /tmp/LTLFireability3358307859251396266.gal : 445 ms
[2022-05-18 02:19:29] [INFO ] Time to serialize properties into /tmp/LTLFireability10360964859577429787.ltl : 260 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3358307859251396266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10360964859577429787.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((((((((((((((Forks_1<1)||(Forks_7<1))||((Outside_15<1)||(Neighbourhood_27<1)))&&(((Forks_3<1)||(Forks_13<1))||((Outside_1<1...579630
Formula 0 simplified : !GF"((((((((((((((((Forks_1<1)||(Forks_7<1))||((Outside_15<1)||(Neighbourhood_27<1)))&&(((Forks_3<1)||(Forks_13<1))||((Outside_1<1)|...579624
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="PhilosophersDyn-COL-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-COL-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016600388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-20.tgz
mv PhilosophersDyn-COL-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;