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-165277016600356.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 Philosophers-PT-005000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 113M
-rw-r--r-- 1 mcc users 7.8M Apr 29 20:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40M Apr 29 20:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0M Apr 29 14:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 24M Apr 29 14:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7M May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 501K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 11M 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 Philosophers-PT-005000-LTLFireability-00
FORMULA_NAME Philosophers-PT-005000-LTLFireability-01
FORMULA_NAME Philosophers-PT-005000-LTLFireability-02
FORMULA_NAME Philosophers-PT-005000-LTLFireability-03
FORMULA_NAME Philosophers-PT-005000-LTLFireability-04
FORMULA_NAME Philosophers-PT-005000-LTLFireability-05
FORMULA_NAME Philosophers-PT-005000-LTLFireability-06
FORMULA_NAME Philosophers-PT-005000-LTLFireability-07
FORMULA_NAME Philosophers-PT-005000-LTLFireability-08
FORMULA_NAME Philosophers-PT-005000-LTLFireability-09
FORMULA_NAME Philosophers-PT-005000-LTLFireability-10
FORMULA_NAME Philosophers-PT-005000-LTLFireability-11
FORMULA_NAME Philosophers-PT-005000-LTLFireability-12
FORMULA_NAME Philosophers-PT-005000-LTLFireability-13
FORMULA_NAME Philosophers-PT-005000-LTLFireability-14
FORMULA_NAME Philosophers-PT-005000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652831124400

Running Version 202205111006
[2022-05-17 23:45:25] [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-17 23:45:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:45:26] [INFO ] Load time of PNML (sax parser for PT used): 743 ms
[2022-05-17 23:45:26] [INFO ] Transformed 25000 places.
[2022-05-17 23:45:26] [INFO ] Transformed 25000 transitions.
[2022-05-17 23:45:26] [INFO ] Parsed PT model containing 25000 places and 25000 transitions in 991 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 256 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-005000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 128 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:45:38] [INFO ] Computed 10000 place invariants in 158 ms
[2022-05-17 23:45:40] [INFO ] Implicit Places using invariants in 2423 ms returned []
Implicit Place search using SMT only with invariants took 2461 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:45:40] [INFO ] Computed 10000 place invariants in 97 ms
[2022-05-17 23:45:43] [INFO ] Dead Transitions using invariants and state equation in 2432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 25000 out of 25000 places after structural reductions.
[2022-05-17 23:45:46] [INFO ] Flatten gal took : 1596 ms
[2022-05-17 23:45:53] [INFO ] Flatten gal took : 1683 ms
[2022-05-17 23:46:01] [INFO ] Input system was already deterministic with 25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14937 ms. (steps per millisecond=0 ) properties (out of 24) seen :17
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 6384 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5144 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5128 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1319 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1340 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1892 ms. (steps per millisecond=5 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1885 ms. (steps per millisecond=5 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:46:40] [INFO ] Computed 10000 place invariants in 65 ms
[2022-05-17 23:46:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 7426 ms returned sat
[2022-05-17 23:46:59] [INFO ] After 19068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-17 23:47:12] [INFO ] [Nat]Absence check using 10000 positive place invariants in 7039 ms returned sat
[2022-05-17 23:47:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 23:47:24] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 15001 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2295 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13387 ms. (steps per millisecond=0 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 6083 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5093 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5167 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1337 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1277 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1378 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1283 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Probabilistic random walk exhausted memory after 104587 steps, saw 104568 distinct states, run finished after 57216 ms. (steps per millisecond=1 ) properties seen :3
Running SMT prover for 4 properties.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:48:59] [INFO ] Computed 10000 place invariants in 71 ms
[2022-05-17 23:49:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 8444 ms returned sat
[2022-05-17 23:49:16] [INFO ] After 16953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:49:31] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9164 ms returned sat
[2022-05-17 23:49:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 23:49:41] [INFO ] After 25203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15001 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2754 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
FORMULA Philosophers-PT-005000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(X((G(p1)||p0))) U !X((F(p2) U p2))))'
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 655 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:49:57] [INFO ] Computed 10000 place invariants in 48 ms
[2022-05-17 23:49:59] [INFO ] Implicit Places using invariants in 2030 ms returned []
Implicit Place search using SMT only with invariants took 2034 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:49:59] [INFO ] Computed 10000 place invariants in 55 ms
[2022-05-17 23:50:01] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s20785 1) (GEQ s21305 1) (GEQ s21825 1) (GEQ s22345 1) (GEQ s19225 1) (GEQ s23385 1) (GEQ s24425 1) (GEQ s20606 1) (GEQ s19404 1) (GEQ s24246 ...], 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]]
Product exploration timeout after 5900 steps with 55 reset in 10004 ms.
Product exploration timeout after 5790 steps with 57 reset in 10016 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) (NOT p0) (NOT p1)), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 3335 steps, including 1 resets, run visited all 4 properties in 4529 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (AND (NOT p0) (NOT p2) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
[2022-05-17 23:52:03] [WARNING] OOM error produced while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1099 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:52:04] [INFO ] Computed 10000 place invariants in 59 ms
[2022-05-17 23:52:06] [INFO ] Implicit Places using invariants in 2004 ms returned []
Implicit Place search using SMT only with invariants took 2006 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:52:06] [INFO ] Computed 10000 place invariants in 64 ms
[2022-05-17 23:52:08] [INFO ] Dead Transitions using invariants and state equation in 2328 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 6668 steps, including 2 resets, run visited all 4 properties in 9058 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (AND (NOT p0) (NOT p2) p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 302 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
[2022-05-17 23:53:57] [WARNING] OOM error produced while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration timeout after 5900 steps with 83 reset in 10013 ms.
Product exploration timeout after 5770 steps with 91 reset in 10013 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1534 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:54:20] [INFO ] Computed 10000 place invariants in 69 ms
[2022-05-17 23:54:22] [INFO ] Dead Transitions using invariants and state equation in 2213 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Product exploration timeout after 5640 steps with 78 reset in 10017 ms.
Product exploration timeout after 5630 steps with 83 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9284845215786021694
[2022-05-17 23:54:42] [INFO ] Built C files in 325ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9284845215786021694
Running compilation step : cd /tmp/ltsmin9284845215786021694;'/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/ltsmin9284845215786021694;'/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/ltsmin9284845215786021694;'/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 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 662 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:54:46] [INFO ] Computed 10000 place invariants in 58 ms
[2022-05-17 23:54:48] [INFO ] Implicit Places using invariants in 2219 ms returned []
Implicit Place search using SMT only with invariants took 2222 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:54:48] [INFO ] Computed 10000 place invariants in 57 ms
[2022-05-17 23:54:50] [INFO ] Dead Transitions using invariants and state equation in 2217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Built C files in :
/tmp/ltsmin12579412484615453423
[2022-05-17 23:54:51] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12579412484615453423
Running compilation step : cd /tmp/ltsmin12579412484615453423;'/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/ltsmin12579412484615453423;'/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/ltsmin12579412484615453423;'/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-17 23:54:57] [INFO ] Flatten gal took : 898 ms
[2022-05-17 23:54:59] [INFO ] Flatten gal took : 1420 ms
[2022-05-17 23:54:59] [INFO ] Time to serialize gal into /tmp/LTL10621214945796804596.gal : 194 ms
[2022-05-17 23:54:59] [INFO ] Time to serialize properties into /tmp/LTL3720080269300532530.ltl : 73 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/LTL10621214945796804596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3720080269300532530.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/LTL1062121...267
Read 1 LTL properties
Checking formula 0 : !((!((!(F(X((((((((((((((G("(((((((((((((((Fork_548>=1)&&(Catch2_549>=1))||((Fork_1830>=1)&&(Catch2_1831>=1)))||(((Fork_962>=1)&&(Catc...543464
Formula 0 simplified : !FX("(((((((((((((Fork_1212>=1)&&(Catch1_1212>=1))||((Fork_237>=1)&&(Catch1_237>=1)))||(((Fork_4387>=1)&&(Catch1_4387>=1))||((Fork_4...543405
Detected timeout of ITS tools.
[2022-05-17 23:55:15] [INFO ] Flatten gal took : 864 ms
[2022-05-17 23:55:15] [INFO ] Applying decomposition
[2022-05-17 23:55:16] [INFO ] Flatten gal took : 886 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/graph16372393795706775541.txt' '-o' '/tmp/graph16372393795706775541.bin' '-w' '/tmp/graph16372393795706775541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16372393795706775541.bin' '-l' '-1' '-v' '-w' '/tmp/graph16372393795706775541.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:55:18] [INFO ] Decomposing Gal with order
[2022-05-17 23:55:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:58:02] [INFO ] Removed a total of 4961 redundant transitions.
[2022-05-17 23:58:03] [INFO ] Flatten gal took : 1756 ms
[2022-05-17 23:58:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 10214 labels/synchronizations in 382 ms.
[2022-05-17 23:58:04] [INFO ] Time to serialize gal into /tmp/LTL13374543194826760317.gal : 147 ms
[2022-05-17 23:58:04] [INFO ] Time to serialize properties into /tmp/LTL13381418707974445099.ltl : 62 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/LTL13374543194826760317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13381418707974445099.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/LTL1337454...247
Read 1 LTL properties
Checking formula 0 : !((!((!(F(X((((((((((((((G("(((((((((((((((i25.u3792.Fork_548>=1)&&(i25.u3792.Catch2_549>=1))||((i101.u3264.Fork_1830>=1)&&(i101.u3264...844612
Formula 0 simplified : !FX("(((((((((((((i5.u3941.Fork_1212>=1)&&(i5.u3941.Catch1_1212>=1))||((i85.u3138.Fork_237>=1)&&(i85.u3138.Catch1_237>=1)))||(((i96....844553
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6335120788700579865
[2022-05-17 23:58:20] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6335120788700579865
Running compilation step : cd /tmp/ltsmin6335120788700579865;'/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/ltsmin6335120788700579865;'/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/ltsmin6335120788700579865;'/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 Philosophers-PT-005000-LTLFireability-00 finished in 506635 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (G(!p1)&&p2))&&G(X(p3)))))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 157 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:58:23] [INFO ] Computed 10000 place invariants in 56 ms
[2022-05-17 23:58:25] [INFO ] Implicit Places using invariants in 1796 ms returned []
Implicit Place search using SMT only with invariants took 1798 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:58:25] [INFO ] Computed 10000 place invariants in 64 ms
[2022-05-17 23:58:26] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p1)) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND p1 p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p1)) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND p1 p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s6252 1) (GEQ s12226 1)) (AND (GEQ s5324 1) (GEQ s11135 1)) (AND (GEQ s7453 1) (GEQ s13112 1)) (AND (GEQ s5457 1) (GEQ s9716 1)) (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 13990 steps with 0 reset in 10003 ms.
Product exploration timeout after 13460 steps with 0 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 p3), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))))), (X (OR (AND p2 (NOT p1)) p0)), (X (OR (AND (NOT p2) p0) (AND p1 p0))), (X p3), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 571 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14811 ms. (steps per millisecond=0 ) properties (out of 11) seen :0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5051 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7122 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 9163 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 6561 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5245 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 9404 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5240 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7089 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7266 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6946 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8421 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk exhausted memory after 104280 steps, saw 104261 distinct states, run finished after 205202 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:04:35] [INFO ] Computed 10000 place invariants in 62 ms
[2022-05-18 00:05:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:05:00] [INFO ] After 25095ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 247 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0 p3), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))))), (X (OR (AND p2 (NOT p1)) p0)), (X (OR (AND (NOT p2) p0) (AND p1 p0))), (X p3), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 495 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
[2022-05-18 00:07:03] [WARNING] OOM error produced while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
[2022-05-18 00:08:49] [WARNING] OOM error produced while checking expression EG p1
Could not prove EG p1
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 52 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:08:50] [INFO ] Computed 10000 place invariants in 64 ms
[2022-05-18 00:08:52] [INFO ] Implicit Places using invariants in 2252 ms returned []
Implicit Place search using SMT only with invariants took 2254 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:08:52] [INFO ] Computed 10000 place invariants in 90 ms
[2022-05-18 00:08:54] [INFO ] Dead Transitions using invariants and state equation in 2302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 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 p1 (NOT p2) p3), (X (OR (AND p0 p1) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p0 (AND (NOT p1) p2))), (X p3), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 441 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14197 ms. (steps per millisecond=0 ) properties (out of 11) seen :0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5205 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7732 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8595 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 6624 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5336 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8919 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5386 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6668 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7073 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7005 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6765 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk exhausted memory after 104184 steps, saw 104165 distinct states, run finished after 157837 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:13:37] [INFO ] Computed 10000 place invariants in 84 ms
[2022-05-18 00:14:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:14:02] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 181 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (OR (AND p0 p1) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p0 (AND (NOT p1) p2))), (X p3), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 471 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
[2022-05-18 00:15:41] [WARNING] OOM error produced while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
[2022-05-18 00:17:20] [WARNING] OOM error produced while checking expression EG p1
Could not prove EG p1
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Product exploration timeout after 14420 steps with 0 reset in 10003 ms.
Product exploration timeout after 13700 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p3) p1), true, p1, (OR (NOT p2) p1), (NOT p3), p1]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 178 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:17:40] [INFO ] Computed 10000 place invariants in 69 ms
[2022-05-18 00:17:43] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Product exploration timeout after 14570 steps with 0 reset in 10004 ms.
Product exploration timeout after 13410 steps with 0 reset in 10004 ms.
Built C files in :
/tmp/ltsmin10914228513856165994
[2022-05-18 00:18:03] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10914228513856165994
Running compilation step : cd /tmp/ltsmin10914228513856165994;'/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/ltsmin10914228513856165994;'/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/ltsmin10914228513856165994;'/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 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 80 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:18:06] [INFO ] Computed 10000 place invariants in 65 ms
[2022-05-18 00:18:08] [INFO ] Implicit Places using invariants in 2210 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:18:08] [INFO ] Computed 10000 place invariants in 99 ms
[2022-05-18 00:18:10] [INFO ] Dead Transitions using invariants and state equation in 2167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Built C files in :
/tmp/ltsmin13234787810398190746
[2022-05-18 00:18:11] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13234787810398190746
Running compilation step : cd /tmp/ltsmin13234787810398190746;'/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/ltsmin13234787810398190746;'/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/ltsmin13234787810398190746;'/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 00:18:17] [INFO ] Flatten gal took : 1266 ms
[2022-05-18 00:18:18] [INFO ] Flatten gal took : 1134 ms
[2022-05-18 00:18:18] [INFO ] Time to serialize gal into /tmp/LTL17768571471552734342.gal : 83 ms
[2022-05-18 00:18:18] [INFO ] Time to serialize properties into /tmp/LTL12548649226405799570.ltl : 75 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/LTL17768571471552734342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12548649226405799570.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/LTL1776857...268
Read 1 LTL properties
Checking formula 0 : !((G((("((((((((((((((((Fork_1591>=1)&&(Catch1_1591>=1))||((Fork_564>=1)&&(Catch1_564>=1)))||(((Fork_2379>=1)&&(Catch1_2379>=1))||((Fo...923980
Formula 0 simplified : !G(("((((((((((((((((Fork_1591>=1)&&(Catch1_1591>=1))||((Fork_564>=1)&&(Catch1_564>=1)))||(((Fork_2379>=1)&&(Catch1_2379>=1))||((For...923966
Detected timeout of ITS tools.
[2022-05-18 00:18:35] [INFO ] Flatten gal took : 1108 ms
[2022-05-18 00:18:35] [INFO ] Applying decomposition
[2022-05-18 00:18:36] [INFO ] Flatten gal took : 1071 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/graph8470745483141791749.txt' '-o' '/tmp/graph8470745483141791749.bin' '-w' '/tmp/graph8470745483141791749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8470745483141791749.bin' '-l' '-1' '-v' '-w' '/tmp/graph8470745483141791749.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:18:39] [INFO ] Decomposing Gal with order
[2022-05-18 00:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:20:59] [INFO ] Removed a total of 4957 redundant transitions.
[2022-05-18 00:21:00] [INFO ] Flatten gal took : 1691 ms
[2022-05-18 00:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 10206 labels/synchronizations in 163 ms.
[2022-05-18 00:21:01] [INFO ] Time to serialize gal into /tmp/LTL1139035244995500503.gal : 203 ms
[2022-05-18 00:21:01] [INFO ] Time to serialize properties into /tmp/LTL10347595285067706499.ltl : 92 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/LTL1139035244995500503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10347595285067706499.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/LTL1139035...246
Read 1 LTL properties
Checking formula 0 : !((G((("((((((((((((((((i27.u3357.Fork_1591>=1)&&(i27.u3357.Catch1_1591>=1))||((i113.u3807.Fork_564>=1)&&(i113.u3807.Catch1_564>=1)))|...1427220
Formula 0 simplified : !G(("((((((((((((((((i27.u3357.Fork_1591>=1)&&(i27.u3357.Catch1_1591>=1))||((i113.u3807.Fork_564>=1)&&(i113.u3807.Catch1_564>=1)))||...1427206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin217172978737247727
[2022-05-18 00:21:16] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin217172978737247727
Running compilation step : cd /tmp/ltsmin217172978737247727;'/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/ltsmin217172978737247727;'/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/ltsmin217172978737247727;'/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 Philosophers-PT-005000-LTLFireability-01 finished in 1376639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U G(p0)))||p1)))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1734 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:21:21] [INFO ] Computed 10000 place invariants in 104 ms
[2022-05-18 00:21:23] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1851 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:21:23] [INFO ] Computed 10000 place invariants in 77 ms
[2022-05-18 00:21:25] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-02 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=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(OR (AND (GEQ s5339 1) (GEQ s16139 1)) (AND (GEQ s6956 1) (GEQ s17751 1)) (AND (GEQ s5652 1) (GEQ s15812 1)) (AND (GEQ s5606 1) (GEQ s14420 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 11 ms.
FORMULA Philosophers-PT-005000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-005000-LTLFireability-02 finished in 7426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p0)||(G(p0)&&p0))))'
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 841 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:21:28] [INFO ] Computed 10000 place invariants in 77 ms
[2022-05-18 00:21:29] [INFO ] Implicit Places using invariants in 1938 ms returned []
Implicit Place search using SMT only with invariants took 1938 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:21:30] [INFO ] Computed 10000 place invariants in 49 ms
[2022-05-18 00:21:31] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s5339 1) (GEQ s16139 1)) (AND (GEQ s6956 1) (GEQ s17751 1)) (AND (GEQ s5652 1) (GEQ s15812 1)) (AND (GEQ s5606 1) (GEQ s14420 1)) (AND (G...], 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][false, false]]
Product exploration timeout after 6300 steps with 2129 reset in 10010 ms.
Product exploration timeout after 5850 steps with 1937 reset in 10003 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2022-05-18 00:25:17] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1140 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:25:18] [INFO ] Computed 10000 place invariants in 85 ms
[2022-05-18 00:25:20] [INFO ] Implicit Places using invariants in 1991 ms returned []
Implicit Place search using SMT only with invariants took 1992 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:25:20] [INFO ] Computed 10000 place invariants in 81 ms
[2022-05-18 00:25:22] [INFO ] Dead Transitions using invariants and state equation in 1911 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2022-05-18 00:28:15] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration timeout after 5260 steps with 1753 reset in 10022 ms.
Product exploration timeout after 5440 steps with 1829 reset in 10013 ms.
Built C files in :
/tmp/ltsmin6926711117151415058
[2022-05-18 00:28:35] [INFO ] Too many transitions (25000) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:28:36] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6926711117151415058
Running compilation step : cd /tmp/ltsmin6926711117151415058;'/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/ltsmin6926711117151415058;'/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/ltsmin6926711117151415058;'/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 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 891 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:28:40] [INFO ] Computed 10000 place invariants in 68 ms
[2022-05-18 00:28:42] [INFO ] Implicit Places using invariants in 2229 ms returned []
Implicit Place search using SMT only with invariants took 2230 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:28:42] [INFO ] Computed 10000 place invariants in 65 ms
[2022-05-18 00:28:44] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Built C files in :
/tmp/ltsmin3431727821514517442
[2022-05-18 00:28:44] [INFO ] Too many transitions (25000) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:28:44] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3431727821514517442
Running compilation step : cd /tmp/ltsmin3431727821514517442;'/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/ltsmin3431727821514517442;'/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/ltsmin3431727821514517442;'/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 00:28:53] [INFO ] Flatten gal took : 1106 ms
[2022-05-18 00:28:54] [INFO ] Flatten gal took : 1061 ms
[2022-05-18 00:28:54] [INFO ] Time to serialize gal into /tmp/LTL17882719400298376236.gal : 92 ms
[2022-05-18 00:28:54] [INFO ] Time to serialize properties into /tmp/LTL10263635158135449409.ltl : 44 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/LTL17882719400298376236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10263635158135449409.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/LTL1788271...268
Read 1 LTL properties
Checking formula 0 : !((X(((!("(((((((((((((((Fork_548>=1)&&(Catch2_549>=1))||((Fork_1830>=1)&&(Catch2_1831>=1)))||(((Fork_962>=1)&&(Catch2_963>=1))||((For...751188
Formula 0 simplified : !X((!"(((((((((((((((Fork_548>=1)&&(Catch2_549>=1))||((Fork_1830>=1)&&(Catch2_1831>=1)))||(((Fork_962>=1)&&(Catch2_963>=1))||((Fork_...751178
Detected timeout of ITS tools.
[2022-05-18 00:29:10] [INFO ] Flatten gal took : 985 ms
[2022-05-18 00:29:10] [INFO ] Applying decomposition
[2022-05-18 00:29:11] [INFO ] Flatten gal took : 892 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/graph863309355035415671.txt' '-o' '/tmp/graph863309355035415671.bin' '-w' '/tmp/graph863309355035415671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph863309355035415671.bin' '-l' '-1' '-v' '-w' '/tmp/graph863309355035415671.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:29:14] [INFO ] Decomposing Gal with order
[2022-05-18 00:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:31:12] [INFO ] Removed a total of 4952 redundant transitions.
[2022-05-18 00:31:13] [INFO ] Flatten gal took : 1503 ms
[2022-05-18 00:33:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 13552 labels/synchronizations in 317 ms.
[2022-05-18 00:33:12] [INFO ] Time to serialize gal into /tmp/LTL5103473602330961528.gal : 160 ms
[2022-05-18 00:33:12] [INFO ] Time to serialize properties into /tmp/LTL15182593305166423316.ltl : 100 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/LTL5103473602330961528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15182593305166423316.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/LTL5103473...246
Read 1 LTL properties
Checking formula 0 : !((X(((!("(((((((((((((((i100.i0.i1.i0.i0.u3771.Fork_548>=1)&&(i100.i0.i1.i0.i0.u3771.Catch2_549>=1))||((i51.i0.i1.i2.i2.u1410.Fork_18...1359316
Formula 0 simplified : !X((!"(((((((((((((((i100.i0.i1.i0.i0.u3771.Fork_548>=1)&&(i100.i0.i1.i0.i0.u3771.Catch2_549>=1))||((i51.i0.i1.i2.i2.u1410.Fork_1830...1359306
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7544079958318380234
[2022-05-18 00:33:27] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7544079958318380234
Running compilation step : cd /tmp/ltsmin7544079958318380234;'/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/ltsmin7544079958318380234;'/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/ltsmin7544079958318380234;'/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 Philosophers-PT-005000-LTLFireability-03 finished in 723371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((p0 U G(p0))||G(p1)||p2))))'
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 467 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:33:31] [INFO ] Computed 10000 place invariants in 65 ms
[2022-05-18 00:33:32] [INFO ] Implicit Places using invariants in 1779 ms returned []
Implicit Place search using SMT only with invariants took 1802 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:33:32] [INFO ] Computed 10000 place invariants in 69 ms
[2022-05-18 00:33:34] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (AND (GEQ s5339 1) (GEQ s16139 1)) (AND (GEQ s6956 1) (GEQ s17751 1)) (AND (GEQ s5652 1) (GEQ s15812 1)) (AND (GEQ s5606 1) (GEQ s14420 1)) (AND (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 14460 steps with 0 reset in 10003 ms.
Product exploration timeout after 13000 steps with 0 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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 3335 steps, including 1 resets, run visited all 4 properties in 4517 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 277 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2022-05-18 00:37:51] [WARNING] OOM error produced while checking expression EG (AND (NOT p0) (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 733 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:37:52] [INFO ] Computed 10000 place invariants in 97 ms
[2022-05-18 00:37:54] [INFO ] Implicit Places using invariants in 2019 ms returned []
Implicit Place search using SMT only with invariants took 2023 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:37:54] [INFO ] Computed 10000 place invariants in 175 ms
[2022-05-18 00:37:56] [INFO ] Dead Transitions using invariants and state equation in 2301 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13804 ms. (steps per millisecond=0 ) properties (out of 4) seen :3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8605 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:38:53] [INFO ] Computed 10000 place invariants in 86 ms
[2022-05-18 00:39:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 15017 ms returned sat
[2022-05-18 00:39:18] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 639 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 392 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2022-05-18 00:41:30] [WARNING] OOM error produced while checking expression EG (AND (NOT p0) (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration timeout after 13320 steps with 0 reset in 10001 ms.
Product exploration timeout after 12200 steps with 0 reset in 10003 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 686 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:41:52] [INFO ] Computed 10000 place invariants in 91 ms
[2022-05-18 00:41:54] [INFO ] Dead Transitions using invariants and state equation in 2440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Product exploration timeout after 14080 steps with 0 reset in 10002 ms.
Product exploration timeout after 12330 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin5471281068863220130
[2022-05-18 00:42:14] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5471281068863220130
Running compilation step : cd /tmp/ltsmin5471281068863220130;'/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/ltsmin5471281068863220130;'/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/ltsmin5471281068863220130;'/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 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 490 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:42:18] [INFO ] Computed 10000 place invariants in 83 ms
[2022-05-18 00:42:20] [INFO ] Implicit Places using invariants in 2351 ms returned []
Implicit Place search using SMT only with invariants took 2360 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-18 00:42:20] [INFO ] Computed 10000 place invariants in 78 ms
[2022-05-18 00:42:22] [INFO ] Dead Transitions using invariants and state equation in 2395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Built C files in :
/tmp/ltsmin10671951937815830036
[2022-05-18 00:42:23] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10671951937815830036
Running compilation step : cd /tmp/ltsmin10671951937815830036;'/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/ltsmin10671951937815830036;'/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/ltsmin10671951937815830036;'/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 00:42:36] [INFO ] Flatten gal took : 1319 ms
[2022-05-18 00:42:38] [INFO ] Flatten gal took : 1225 ms
[2022-05-18 00:42:38] [INFO ] Time to serialize gal into /tmp/LTL17689706888868140788.gal : 85 ms
[2022-05-18 00:42:38] [INFO ] Time to serialize properties into /tmp/LTL3505683466960657904.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/LTL17689706888868140788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3505683466960657904.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/LTL1768970...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-18 00:42:54] [INFO ] Flatten gal took : 1311 ms
[2022-05-18 00:42:54] [INFO ] Applying decomposition
[2022-05-18 00:42:55] [INFO ] Flatten gal took : 991 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/graph7564115392494211543.txt' '-o' '/tmp/graph7564115392494211543.bin' '-w' '/tmp/graph7564115392494211543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7564115392494211543.bin' '-l' '-1' '-v' '-w' '/tmp/graph7564115392494211543.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:42:59] [INFO ] Decomposing Gal with order
[2022-05-18 00:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.

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="Philosophers-PT-005000"
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 Philosophers-PT-005000, 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-165277016600356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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