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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 1.2M Apr 29 12:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.0M Apr 29 12:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 653K Apr 29 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 29 11:55 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 627K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 300K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 94K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 260K 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 2.3M 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-001000-LTLFireability-00
FORMULA_NAME Philosophers-PT-001000-LTLFireability-01
FORMULA_NAME Philosophers-PT-001000-LTLFireability-02
FORMULA_NAME Philosophers-PT-001000-LTLFireability-03
FORMULA_NAME Philosophers-PT-001000-LTLFireability-04
FORMULA_NAME Philosophers-PT-001000-LTLFireability-05
FORMULA_NAME Philosophers-PT-001000-LTLFireability-06
FORMULA_NAME Philosophers-PT-001000-LTLFireability-07
FORMULA_NAME Philosophers-PT-001000-LTLFireability-08
FORMULA_NAME Philosophers-PT-001000-LTLFireability-09
FORMULA_NAME Philosophers-PT-001000-LTLFireability-10
FORMULA_NAME Philosophers-PT-001000-LTLFireability-11
FORMULA_NAME Philosophers-PT-001000-LTLFireability-12
FORMULA_NAME Philosophers-PT-001000-LTLFireability-13
FORMULA_NAME Philosophers-PT-001000-LTLFireability-14
FORMULA_NAME Philosophers-PT-001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652827302720

Running Version 202205111006
[2022-05-17 22:41:43] [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 22:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:41:44] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2022-05-17 22:41:44] [INFO ] Transformed 5000 places.
[2022-05-17 22:41:44] [INFO ] Transformed 5000 transitions.
[2022-05-17 22:41:44] [INFO ] Parsed PT model containing 5000 places and 5000 transitions in 517 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 103 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-001000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 44 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:41:45] [INFO ] Computed 2000 place invariants in 57 ms
[2022-05-17 22:41:45] [INFO ] Implicit Places using invariants in 729 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:41:45] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 22:41:46] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:41:46] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 22:41:49] [INFO ] Dead Transitions using invariants and state equation in 3230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2022-05-17 22:41:51] [INFO ] Flatten gal took : 1114 ms
[2022-05-17 22:41:53] [INFO ] Flatten gal took : 635 ms
[2022-05-17 22:41:54] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1744 ms. (steps per millisecond=5 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2273 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2285 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3629 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:42:05] [INFO ] Computed 2000 place invariants in 19 ms
[2022-05-17 22:42:13] [INFO ] [Real]Absence check using 2000 positive place invariants in 537 ms returned sat
[2022-05-17 22:42:14] [INFO ] After 2168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:42:15] [INFO ] [Nat]Absence check using 2000 positive place invariants in 556 ms returned sat
[2022-05-17 22:42:32] [INFO ] After 14755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:42:37] [INFO ] After 20031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1703 ms.
[2022-05-17 22:42:39] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 3 properties in 285 ms. (steps per millisecond=3 )
Parikh walk visited 3 properties in 294 ms.
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' '!(G((p0 U X(p1))))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 321 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:42:40] [INFO ] Computed 2000 place invariants in 17 ms
[2022-05-17 22:42:42] [INFO ] Implicit Places using invariants in 1877 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:42:42] [INFO ] Computed 2000 place invariants in 18 ms
[2022-05-17 22:42:44] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 3630 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:42:44] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 22:42:47] [INFO ] Dead Transitions using invariants and state equation in 3254 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 540 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s512 1) (GEQ s1629 1)) (AND (GEQ s807 1) (GEQ s1911 1)) (AND (GEQ s315 1) (GEQ s1355 1)) (AND (GEQ s385 1) (GEQ s1491 1)) (AND (GEQ s406 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 38130 steps with 12695 reset in 10003 ms.
Product exploration timeout after 37680 steps with 12550 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2408 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2370 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2394 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5318 ms. (steps per millisecond=1 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4991 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Probabilistic random walk after 452520 steps, saw 452198 distinct states, run finished after 51085 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:44:17] [INFO ] Computed 2000 place invariants in 68 ms
[2022-05-17 22:44:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 2059 ms returned sat
[2022-05-17 22:44:35] [INFO ] After 4608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 22:44:37] [INFO ] [Nat]Absence check using 2000 positive place invariants in 849 ms returned sat
[2022-05-17 22:44:56] [INFO ] After 17448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 22:45:00] [INFO ] After 20976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 22:45:00] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 4 properties in 412 ms. (steps per millisecond=2 )
Parikh walk visited 4 properties in 430 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 712 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 336 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:45:02] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 22:45:05] [INFO ] Implicit Places using invariants in 3134 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:45:05] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 22:45:08] [INFO ] Implicit Places using invariants and state equation in 3689 ms returned []
Implicit Place search using SMT with State Equation took 6844 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:45:08] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:45:11] [INFO ] Dead Transitions using invariants and state equation in 3119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1492 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2269 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2183 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4048 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4022 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Probabilistic random walk exhausted memory after 560040 steps, saw 559633 distinct states, run finished after 33022 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:45:59] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 22:46:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 539 ms returned sat
[2022-05-17 22:46:09] [INFO ] After 1967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 22:46:10] [INFO ] [Nat]Absence check using 2000 positive place invariants in 548 ms returned sat
[2022-05-17 22:46:22] [INFO ] After 10186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 22:46:27] [INFO ] After 14927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3639 ms.
[2022-05-17 22:46:30] [INFO ] After 21340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 4 properties in 257 ms. (steps per millisecond=3 )
Parikh walk visited 4 properties in 257 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 362 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Product exploration timeout after 39880 steps with 13290 reset in 10003 ms.
Product exploration timeout after 38630 steps with 12904 reset in 10001 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 386 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2022-05-17 22:46:53] [INFO ] Redundant transitions in 405 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:46:53] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 22:46:56] [INFO ] Dead Transitions using invariants and state equation in 3069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Product exploration timeout after 40200 steps with 13418 reset in 10001 ms.
Product exploration timeout after 38020 steps with 12523 reset in 10001 ms.
Built C files in :
/tmp/ltsmin16755316306260411103
[2022-05-17 22:47:16] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16755316306260411103
Running compilation step : cd /tmp/ltsmin16755316306260411103;'/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/ltsmin16755316306260411103;'/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/ltsmin16755316306260411103;'/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 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 257 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:47:19] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:47:21] [INFO ] Implicit Places using invariants in 1647 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:47:21] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:47:22] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 3372 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:47:22] [INFO ] Computed 2000 place invariants in 9 ms
[2022-05-17 22:47:27] [INFO ] Dead Transitions using invariants and state equation in 4754 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin11841573507545519129
[2022-05-17 22:47:27] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11841573507545519129
Running compilation step : cd /tmp/ltsmin11841573507545519129;'/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/ltsmin11841573507545519129;'/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/ltsmin11841573507545519129;'/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 22:47:31] [INFO ] Flatten gal took : 214 ms
[2022-05-17 22:47:31] [INFO ] Flatten gal took : 175 ms
[2022-05-17 22:47:31] [INFO ] Time to serialize gal into /tmp/LTL15386579906703912435.gal : 43 ms
[2022-05-17 22:47:31] [INFO ] Time to serialize properties into /tmp/LTL3970465587965229833.ltl : 10 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/LTL15386579906703912435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3970465587965229833.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/LTL1538657...267
Read 1 LTL properties
Checking formula 0 : !((G(("((((((((((((Think_547>=1)&&(Fork_546>=1))||((Think_795>=1)&&(Fork_794>=1)))||(((Think_300>=1)&&(Fork_299>=1))||((Think_412>=1)&...69605
Formula 0 simplified : !G("((((((((((((Think_547>=1)&&(Fork_546>=1))||((Think_795>=1)&&(Fork_794>=1)))||(((Think_300>=1)&&(Fork_299>=1))||((Think_412>=1)&&...69599
Detected timeout of ITS tools.
[2022-05-17 22:47:46] [INFO ] Flatten gal took : 166 ms
[2022-05-17 22:47:46] [INFO ] Applying decomposition
[2022-05-17 22:47:47] [INFO ] Flatten gal took : 171 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/graph15208261199800540013.txt' '-o' '/tmp/graph15208261199800540013.bin' '-w' '/tmp/graph15208261199800540013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15208261199800540013.bin' '-l' '-1' '-v' '-w' '/tmp/graph15208261199800540013.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:47:47] [INFO ] Decomposing Gal with order
[2022-05-17 22:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:47:48] [INFO ] Removed a total of 991 redundant transitions.
[2022-05-17 22:47:48] [INFO ] Flatten gal took : 412 ms
[2022-05-17 22:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2720 labels/synchronizations in 94 ms.
[2022-05-17 22:47:51] [INFO ] Time to serialize gal into /tmp/LTL5879012726795408361.gal : 34 ms
[2022-05-17 22:47:51] [INFO ] Time to serialize properties into /tmp/LTL12454343785236233432.ltl : 12 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/LTL5879012726795408361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12454343785236233432.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/LTL5879012...246
Read 1 LTL properties
Checking formula 0 : !((G(("((((((((((((i46.i1.i1.i0.u382.Think_547>=1)&&(i46.i1.i1.i1.u738.Fork_546>=1))||((i22.u509.Think_795>=1)&&(i22.u509.Fork_794>=1)...119625
Formula 0 simplified : !G("((((((((((((i46.i1.i1.i0.u382.Think_547>=1)&&(i46.i1.i1.i1.u738.Fork_546>=1))||((i22.u509.Think_795>=1)&&(i22.u509.Fork_794>=1))...119619
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7916537183898650946
[2022-05-17 22:48:06] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7916537183898650946
Running compilation step : cd /tmp/ltsmin7916537183898650946;'/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/ltsmin7916537183898650946;'/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/ltsmin7916537183898650946;'/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-001000-LTLFireability-01 finished in 329456 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U p0)))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 155 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:09] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 22:48:11] [INFO ] Implicit Places using invariants in 1510 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:11] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 22:48:12] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 3069 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:12] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 22:48:15] [INFO ] Dead Transitions using invariants and state equation in 3120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s512 1) (GEQ s1629 1)) (AND (GEQ s807 1) (GEQ s1911 1)) (AND (GEQ s315 1) (GEQ s1355 1)) (AND (GEQ s385 1) (GEQ s1491 1)) (AND (GEQ s406 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 43622 steps with 0 reset in 1990 ms.
FORMULA Philosophers-PT-001000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-02 finished in 8461 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||F(p1)) U G(p2)))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 35 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:18] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:48:19] [INFO ] Implicit Places using invariants in 1112 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:19] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:48:20] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:20] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:48:23] [INFO ] Dead Transitions using invariants and state equation in 3184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s169 1) (GEQ s1227 1)) (AND (GEQ s239 1) (GEQ s1184 1)) (AND (GEQ s59 1) (GEQ s1132 1)) (AND (GEQ s349 1) (GEQ s1279 1)) (AND (GEQ s354 1...], 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 explored 100000 steps with 6 reset in 5930 ms.
Product exploration explored 100000 steps with 6 reset in 6457 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1524 ms. (steps per millisecond=6 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2198 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4294 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3616 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3634 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3608 ms. (steps per millisecond=2 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:48:55] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 22:49:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 500 ms returned sat
[2022-05-17 22:49:04] [INFO ] After 2110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 22:49:06] [INFO ] [Nat]Absence check using 2000 positive place invariants in 445 ms returned sat
[2022-05-17 22:49:25] [INFO ] After 7485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:49:29] [INFO ] After 11409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 979 ms.
[2022-05-17 22:49:30] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 505 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 141 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1255 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4364 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185421 steps, run timeout after 15052 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 185421 steps, saw 185284 distinct states, run finished after 15055 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:49:51] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:49:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 485 ms returned sat
[2022-05-17 22:49:55] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:49:56] [INFO ] [Nat]Absence check using 2000 positive place invariants in 497 ms returned sat
[2022-05-17 22:50:05] [INFO ] After 10063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 65 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 53 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:05] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:50:06] [INFO ] Implicit Places using invariants in 1051 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:06] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:50:07] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2022-05-17 22:50:07] [INFO ] Redundant transitions in 329 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:07] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 22:50:10] [INFO ] Dead Transitions using invariants and state equation in 3105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 55 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:10] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:50:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 532 ms returned sat
[2022-05-17 22:50:14] [INFO ] After 1357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:50:15] [INFO ] [Nat]Absence check using 2000 positive place invariants in 629 ms returned sat
[2022-05-17 22:50:24] [INFO ] After 10194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 477 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 30 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:25] [INFO ] Computed 2000 place invariants in 16 ms
[2022-05-17 22:50:26] [INFO ] Implicit Places using invariants in 1107 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:26] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:50:27] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:27] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:50:30] [INFO ] Dead Transitions using invariants and state equation in 3069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1539 ms. (steps per millisecond=6 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2102 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3345 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3631 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3641 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3616 ms. (steps per millisecond=2 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:50:50] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:50:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 477 ms returned sat
[2022-05-17 22:50:59] [INFO ] After 2003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 22:51:01] [INFO ] [Nat]Absence check using 2000 positive place invariants in 484 ms returned sat
[2022-05-17 22:51:19] [INFO ] After 7366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:51:23] [INFO ] After 11108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1218 ms.
[2022-05-17 22:51:24] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 564 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 47 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1366 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3785 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Probabilistic random walk after 182568 steps, saw 182435 distinct states, run finished after 15032 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:51:45] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:51:49] [INFO ] [Real]Absence check using 2000 positive place invariants in 485 ms returned sat
[2022-05-17 22:51:49] [INFO ] After 1305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:51:50] [INFO ] [Nat]Absence check using 2000 positive place invariants in 658 ms returned sat
[2022-05-17 22:51:59] [INFO ] After 10251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 58 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 45 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:51:59] [INFO ] Computed 2000 place invariants in 16 ms
[2022-05-17 22:52:00] [INFO ] Implicit Places using invariants in 1070 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:00] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 22:52:01] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2022-05-17 22:52:01] [INFO ] Redundant transitions in 199 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:01] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 22:52:05] [INFO ] Dead Transitions using invariants and state equation in 3197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 47 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:05] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:52:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 496 ms returned sat
[2022-05-17 22:52:08] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 22:52:09] [INFO ] [Nat]Absence check using 2000 positive place invariants in 513 ms returned sat
[2022-05-17 22:52:18] [INFO ] After 10172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 481 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 8 reset in 5710 ms.
Product exploration explored 100000 steps with 2 reset in 6430 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 61 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2022-05-17 22:52:32] [INFO ] Redundant transitions in 205 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:32] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:52:35] [INFO ] Dead Transitions using invariants and state equation in 3074 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Product exploration explored 100000 steps with 3 reset in 5796 ms.
Product exploration explored 100000 steps with 5 reset in 6394 ms.
Built C files in :
/tmp/ltsmin3068864838600533299
[2022-05-17 22:52:48] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3068864838600533299
Running compilation step : cd /tmp/ltsmin3068864838600533299;'/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/ltsmin3068864838600533299;'/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/ltsmin3068864838600533299;'/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 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 32 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:51] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:52:52] [INFO ] Implicit Places using invariants in 1060 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:52] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:52:53] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:52:53] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:52:56] [INFO ] Dead Transitions using invariants and state equation in 2915 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin5278826538032714601
[2022-05-17 22:52:56] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5278826538032714601
Running compilation step : cd /tmp/ltsmin5278826538032714601;'/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/ltsmin5278826538032714601;'/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/ltsmin5278826538032714601;'/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 22:52:59] [INFO ] Flatten gal took : 175 ms
[2022-05-17 22:52:59] [INFO ] Flatten gal took : 186 ms
[2022-05-17 22:52:59] [INFO ] Time to serialize gal into /tmp/LTL2271249506744390286.gal : 40 ms
[2022-05-17 22:52:59] [INFO ] Time to serialize properties into /tmp/LTL799459521972519309.ltl : 9 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/LTL2271249506744390286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL799459521972519309.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/LTL2271249...265
Read 1 LTL properties
Checking formula 0 : !((((X("(((((((((((Eat_130>=1)||(Eat_257>=1))||((Eat_742>=1)||(Eat_891>=1)))||(((Eat_357>=1)||(Eat_490>=1))||((Eat_613>=1)||(Eat_48>=1...86505
Formula 0 simplified : !((X"(((((((((((Eat_130>=1)||(Eat_257>=1))||((Eat_742>=1)||(Eat_891>=1)))||(((Eat_357>=1)||(Eat_490>=1))||((Eat_613>=1)||(Eat_48>=1)...86496
Detected timeout of ITS tools.
[2022-05-17 22:53:15] [INFO ] Flatten gal took : 157 ms
[2022-05-17 22:53:15] [INFO ] Applying decomposition
[2022-05-17 22:53:15] [INFO ] Flatten gal took : 160 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/graph12550665705856681944.txt' '-o' '/tmp/graph12550665705856681944.bin' '-w' '/tmp/graph12550665705856681944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12550665705856681944.bin' '-l' '-1' '-v' '-w' '/tmp/graph12550665705856681944.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:53:15] [INFO ] Decomposing Gal with order
[2022-05-17 22:53:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:53:16] [INFO ] Removed a total of 989 redundant transitions.
[2022-05-17 22:53:16] [INFO ] Flatten gal took : 258 ms
[2022-05-17 22:53:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2656 labels/synchronizations in 42 ms.
[2022-05-17 22:53:18] [INFO ] Time to serialize gal into /tmp/LTL4604605899306920735.gal : 24 ms
[2022-05-17 22:53:18] [INFO ] Time to serialize properties into /tmp/LTL5573407429608808228.ltl : 17 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/LTL4604605899306920735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5573407429608808228.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/LTL4604605...245
Read 1 LTL properties
Checking formula 0 : !((((X("(((((((((((i52.u146.Eat_130>=1)||(i55.u191.Eat_257>=1))||((i31.i1.i1.i1.u403.Eat_742>=1)||(i35.u449.Eat_891>=1)))||(((i40.u639...147655
Formula 0 simplified : !((X"(((((((((((i52.u146.Eat_130>=1)||(i55.u191.Eat_257>=1))||((i31.i1.i1.i1.u403.Eat_742>=1)||(i35.u449.Eat_891>=1)))||(((i40.u639....147646
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15347779134163602128
[2022-05-17 22:53:34] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15347779134163602128
Running compilation step : cd /tmp/ltsmin15347779134163602128;'/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/ltsmin15347779134163602128;'/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/ltsmin15347779134163602128;'/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-001000-LTLFireability-03 finished in 319109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 147 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:53:37] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:53:38] [INFO ] Implicit Places using invariants in 1600 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:53:38] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:53:40] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 3098 ms to find 0 implicit places.
[2022-05-17 22:53:40] [INFO ] Redundant transitions in 196 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:53:40] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 2963 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2009 1) (GEQ s2876 1)) (AND (GEQ s1439 1) (GEQ s2381 1)) (AND (GEQ s1444 1) (GEQ s2386 1)) (AND (GEQ s1871 1) (GEQ s2990 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 4495 ms.
Product exploration explored 100000 steps with 0 reset in 4760 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 p0), (X (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F p0)]
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:53:58] [INFO ] Computed 2000 place invariants in 17 ms
Could not prove EG (NOT p0)
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 121 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:13] [INFO ] Computed 2000 place invariants in 9 ms
[2022-05-17 22:54:14] [INFO ] Implicit Places using invariants in 1639 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:14] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 22:54:16] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2022-05-17 22:54:16] [INFO ] Redundant transitions in 199 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:16] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 22:54:19] [INFO ] Dead Transitions using invariants and state equation in 3257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 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 p0), (X (NOT p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F p0)]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:25] [INFO ] Computed 2000 place invariants in 14 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 4350 ms.
Stack based approach found an accepted trace after 60948 steps with 0 reset with depth 60949 and stack size 11540 in 3023 ms.
FORMULA Philosophers-PT-001000-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-04 finished in 70488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X((G(X(p0))&&G(F(p1))))))))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 175 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:47] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:54:49] [INFO ] Implicit Places using invariants in 1661 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:49] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:54:50] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 3231 ms to find 0 implicit places.
[2022-05-17 22:54:51] [INFO ] Redundant transitions in 198 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:54:51] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 22:54:54] [INFO ] Dead Transitions using invariants and state equation in 3078 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s512 1) (GEQ s1629 1)) (AND (GEQ s807 1) (GEQ s1911 1)) (AND (GEQ s315 1) (GEQ s1355 1)) (AND (GEQ s385 1) (GEQ s1491 1)) (AND (GEQ s406 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 5527 ms.
Product exploration explored 100000 steps with 2 reset in 6212 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1395 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2244 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4037 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2179 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Probabilistic random walk after 522040 steps, saw 521666 distinct states, run finished after 27028 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:55:43] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:55:49] [INFO ] [Real]Absence check using 2000 positive place invariants in 471 ms returned sat
[2022-05-17 22:55:50] [INFO ] After 1481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:55:51] [INFO ] [Nat]Absence check using 2000 positive place invariants in 494 ms returned sat
[2022-05-17 22:56:00] [INFO ] After 7539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:56:03] [INFO ] After 11216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3540 ms.
[2022-05-17 22:56:07] [INFO ] After 17372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 568 steps, including 0 resets, run visited all 1 properties in 56 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 349 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 308 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:56:08] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:56:09] [INFO ] Implicit Places using invariants in 1585 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:56:10] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:56:11] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2022-05-17 22:56:11] [INFO ] Redundant transitions in 198 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:56:11] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 22:56:14] [INFO ] Dead Transitions using invariants and state equation in 3127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 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), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1385 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2216 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4777 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2217 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Probabilistic random walk exhausted memory after 560143 steps, saw 559736 distinct states, run finished after 30559 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:56:56] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:57:02] [INFO ] [Real]Absence check using 2000 positive place invariants in 495 ms returned sat
[2022-05-17 22:57:02] [INFO ] After 1551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:57:04] [INFO ] [Nat]Absence check using 2000 positive place invariants in 496 ms returned sat
[2022-05-17 22:57:13] [INFO ] After 7954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:57:17] [INFO ] After 11659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3597 ms.
[2022-05-17 22:57:20] [INFO ] After 17763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 568 steps, including 0 resets, run visited all 1 properties in 55 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 353 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 5505 ms.
Product exploration explored 100000 steps with 2 reset in 5986 ms.
Built C files in :
/tmp/ltsmin15168283196748635892
[2022-05-17 22:57:32] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:57:32] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15168283196748635892
Running compilation step : cd /tmp/ltsmin15168283196748635892;'/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/ltsmin15168283196748635892;'/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/ltsmin15168283196748635892;'/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 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 179 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:57:36] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:57:37] [INFO ] Implicit Places using invariants in 1588 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:57:37] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:57:39] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 3120 ms to find 0 implicit places.
[2022-05-17 22:57:39] [INFO ] Redundant transitions in 195 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:57:39] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 22:57:42] [INFO ] Dead Transitions using invariants and state equation in 3102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin5885845640979154112
[2022-05-17 22:57:42] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:57:42] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5885845640979154112
Running compilation step : cd /tmp/ltsmin5885845640979154112;'/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/ltsmin5885845640979154112;'/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/ltsmin5885845640979154112;'/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 22:57:45] [INFO ] Flatten gal took : 169 ms
[2022-05-17 22:57:46] [INFO ] Flatten gal took : 216 ms
[2022-05-17 22:57:46] [INFO ] Time to serialize gal into /tmp/LTL5416766298984492318.gal : 12 ms
[2022-05-17 22:57:46] [INFO ] Time to serialize properties into /tmp/LTL9478257738934689115.ltl : 6 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/LTL5416766298984492318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9478257738934689115.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/LTL5416766...266
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X((G(X("((((((((((((Think_547>=1)&&(Fork_546>=1))||((Think_795>=1)&&(Fork_794>=1)))||(((Think_300>=1)&&(Fork_299>=1))||((Thin...69624
Formula 0 simplified : !FXGX(GX"((((((((((((Think_547>=1)&&(Fork_546>=1))||((Think_795>=1)&&(Fork_794>=1)))||(((Think_300>=1)&&(Fork_299>=1))||((Think_412>...69605
Detected timeout of ITS tools.
[2022-05-17 22:58:01] [INFO ] Flatten gal took : 152 ms
[2022-05-17 22:58:01] [INFO ] Applying decomposition
[2022-05-17 22:58:01] [INFO ] Flatten gal took : 161 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/graph5898291860548162108.txt' '-o' '/tmp/graph5898291860548162108.bin' '-w' '/tmp/graph5898291860548162108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5898291860548162108.bin' '-l' '-1' '-v' '-w' '/tmp/graph5898291860548162108.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:58:01] [INFO ] Decomposing Gal with order
[2022-05-17 22:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:58:02] [INFO ] Removed a total of 986 redundant transitions.
[2022-05-17 22:58:02] [INFO ] Flatten gal took : 284 ms
[2022-05-17 22:58:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2756 labels/synchronizations in 39 ms.
[2022-05-17 22:58:05] [INFO ] Time to serialize gal into /tmp/LTL10680865614539444710.gal : 21 ms
[2022-05-17 22:58:05] [INFO ] Time to serialize properties into /tmp/LTL13572646767055039087.ltl : 9 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/LTL10680865614539444710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13572646767055039087.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/LTL1068086...247
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X((G(X("((((((((((((i49.i0.i1.i1.u732.Think_547>=1)&&(i49.i0.i1.i1.u732.Fork_546>=1))||((i37.i0.i0.i1.u497.Think_795>=1)&&(i3...120372
Formula 0 simplified : !FXGX(GX"((((((((((((i49.i0.i1.i1.u732.Think_547>=1)&&(i49.i0.i1.i1.u732.Fork_546>=1))||((i37.i0.i0.i1.u497.Think_795>=1)&&(i37.i0.i...120353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4222034285280372436
[2022-05-17 22:58:20] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4222034285280372436
Running compilation step : cd /tmp/ltsmin4222034285280372436;'/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/ltsmin4222034285280372436;'/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/ltsmin4222034285280372436;'/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-001000-LTLFireability-05 finished in 215848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U !(p1 U p0))||!p0)))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 106 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:58:23] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 22:58:24] [INFO ] Implicit Places using invariants in 1110 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:58:24] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 22:58:25] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
[2022-05-17 22:58:25] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:58:25] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 22:58:29] [INFO ] Dead Transitions using invariants and state equation in 3193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 97 ms :[false, (NOT p0), true]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s169 1) (GEQ s1227 1)) (AND (GEQ s239 1) (GEQ s1184 1)) (AND (GEQ s59 1) (GEQ s1132 1)) (AND (GEQ s349 1) (GEQ s1279 1)) (AND (GEQ s354 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 39610 steps with 13232 reset in 10002 ms.
Product exploration timeout after 38900 steps with 13031 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[false, (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1343 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2253 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3441 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3418 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Probabilistic random walk exhausted memory after 560143 steps, saw 559736 distinct states, run finished after 30550 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:59:30] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 22:59:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 503 ms returned sat
[2022-05-17 22:59:38] [INFO ] After 1915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:59:39] [INFO ] [Nat]Absence check using 2000 positive place invariants in 498 ms returned sat
[2022-05-17 22:59:48] [INFO ] After 7743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:59:50] [INFO ] After 9359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1162 ms.
[2022-05-17 22:59:51] [INFO ] After 12857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 657 steps, including 0 resets, run visited all 1 properties in 70 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 354 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[false, (NOT p0), true]
Stuttering acceptance computed with spot in 85 ms :[false, (NOT p0), true]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 93 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:59:52] [INFO ] Computed 2000 place invariants in 16 ms
[2022-05-17 22:59:53] [INFO ] Implicit Places using invariants in 1072 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:59:53] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 22:59:54] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2022-05-17 22:59:54] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 22:59:54] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 22:59:57] [INFO ] Dead Transitions using invariants and state equation in 3035 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[false, (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1372 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2217 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3432 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3423 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Probabilistic random walk exhausted memory after 560046 steps, saw 559639 distinct states, run finished after 28898 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:00:37] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:00:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 485 ms returned sat
[2022-05-17 23:00:44] [INFO ] After 1958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 23:00:45] [INFO ] [Nat]Absence check using 2000 positive place invariants in 475 ms returned sat
[2022-05-17 23:00:54] [INFO ] After 7402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 23:00:55] [INFO ] After 8976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1191 ms.
[2022-05-17 23:00:56] [INFO ] After 12356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 657 steps, including 0 resets, run visited all 1 properties in 70 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 358 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[false, (NOT p0), true]
Stuttering acceptance computed with spot in 77 ms :[false, (NOT p0), true]
Stuttering acceptance computed with spot in 71 ms :[false, (NOT p0), true]
Product exploration timeout after 40320 steps with 13356 reset in 10003 ms.
Product exploration timeout after 39130 steps with 13070 reset in 10007 ms.
Built C files in :
/tmp/ltsmin7607247320978009579
[2022-05-17 23:01:18] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:01:18] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7607247320978009579
Running compilation step : cd /tmp/ltsmin7607247320978009579;'/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/ltsmin7607247320978009579;'/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/ltsmin7607247320978009579;'/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 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 102 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:01:21] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:01:22] [INFO ] Implicit Places using invariants in 1082 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:01:22] [INFO ] Computed 2000 place invariants in 35 ms
[2022-05-17 23:01:23] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2022-05-17 23:01:24] [INFO ] Redundant transitions in 202 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:01:24] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 23:01:27] [INFO ] Dead Transitions using invariants and state equation in 3178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin5816656860636909089
[2022-05-17 23:01:27] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:01:27] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5816656860636909089
Running compilation step : cd /tmp/ltsmin5816656860636909089;'/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/ltsmin5816656860636909089;'/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/ltsmin5816656860636909089;'/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:01:30] [INFO ] Flatten gal took : 173 ms
[2022-05-17 23:01:30] [INFO ] Flatten gal took : 177 ms
[2022-05-17 23:01:31] [INFO ] Time to serialize gal into /tmp/LTL5408994289976422073.gal : 14 ms
[2022-05-17 23:01:31] [INFO ] Time to serialize properties into /tmp/LTL15097378484188189628.ltl : 16 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/LTL5408994289976422073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15097378484188189628.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/LTL5408994...267
Read 1 LTL properties
Checking formula 0 : !((G((!(("((((((((((((Think_165>=1)&&(Fork_165>=1))||((Think_250>=1)&&(Fork_250>=1)))||(((Think_59>=1)&&(Fork_59>=1))||((Think_371>=1)...138187
Formula 0 simplified : !G("((((((((((((Think_165<1)||(Fork_165<1))&&((Think_250<1)||(Fork_250<1)))&&(((Think_59<1)||(Fork_59<1))&&((Think_371<1)||(Fork_371...138178
Detected timeout of ITS tools.
[2022-05-17 23:01:46] [INFO ] Flatten gal took : 171 ms
[2022-05-17 23:01:46] [INFO ] Applying decomposition
[2022-05-17 23:01:46] [INFO ] Flatten gal took : 176 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/graph14194397570833221317.txt' '-o' '/tmp/graph14194397570833221317.bin' '-w' '/tmp/graph14194397570833221317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14194397570833221317.bin' '-l' '-1' '-v' '-w' '/tmp/graph14194397570833221317.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:01:46] [INFO ] Decomposing Gal with order
[2022-05-17 23:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:01:47] [INFO ] Removed a total of 985 redundant transitions.
[2022-05-17 23:01:47] [INFO ] Flatten gal took : 303 ms
[2022-05-17 23:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2696 labels/synchronizations in 50 ms.
[2022-05-17 23:01:52] [INFO ] Time to serialize gal into /tmp/LTL10459954322044680163.gal : 25 ms
[2022-05-17 23:01:52] [INFO ] Time to serialize properties into /tmp/LTL3419675742722498097.ltl : 19 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/LTL10459954322044680163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3419675742722498097.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/LTL1045995...246
Read 1 LTL properties
Checking formula 0 : !((G((!(("((((((((((((i12.i0.i2.i1.u565.Think_165>=1)&&(i12.i1.i0.i0.u218.Fork_165>=1))||((i53.i1.i1.i0.u556.Think_250>=1)&&(i53.i1.i1...238911
Formula 0 simplified : !G("((((((((((((i12.i0.i2.i1.u565.Think_165<1)||(i12.i1.i0.i0.u218.Fork_165<1))&&((i53.i1.i1.i0.u556.Think_250<1)||(i53.i1.i1.i1.u81...238902
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1934032253030414082
[2022-05-17 23:02:07] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1934032253030414082
Running compilation step : cd /tmp/ltsmin1934032253030414082;'/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/ltsmin1934032253030414082;'/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/ltsmin1934032253030414082;'/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-001000-LTLFireability-06 finished in 227106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(F(p2)&&p1))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 92 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:02:10] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 23:02:11] [INFO ] Implicit Places using invariants in 1112 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:02:11] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:02:13] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 3128 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:02:13] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 23:02:18] [INFO ] Dead Transitions using invariants and state equation in 5224 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (AND (GEQ s1167 1) (GEQ s3185 1)) (AND (GEQ s1602 1) (GEQ s3381 1)) (AND (GEQ s1909 1) (GEQ s3620 1)) (AND (GEQ s1974 1) (GEQ s3962 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 32650 steps with 16325 reset in 10002 ms.
Product exploration timeout after 31930 steps with 15965 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 p2 p1 (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p2))))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-001000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-001000-LTLFireability-07 finished in 29337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(p1)))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 337 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:02:40] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:02:43] [INFO ] Implicit Places using invariants in 2838 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:02:43] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:02:45] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 5793 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:02:45] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 23:02:49] [INFO ] Dead Transitions using invariants and state equation in 3252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s4879 1), p0:(AND (GEQ s1277 1) (GEQ s3574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 95130 steps with 24 reset in 10013 ms.
Stack based approach found an accepted trace after 63587 steps with 13 reset with depth 4454 and stack size 4454 in 6746 ms.
FORMULA Philosophers-PT-001000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-08 finished in 26260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(p0)) U p1)&&G((G(X(p2))||p1))&&X(p3)))'
Support contains 7 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 235 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:06] [INFO ] Computed 2000 place invariants in 65 ms
[2022-05-17 23:03:09] [INFO ] Implicit Places using invariants in 2817 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:09] [INFO ] Computed 2000 place invariants in 17 ms
[2022-05-17 23:03:11] [INFO ] Implicit Places using invariants and state equation in 2795 ms returned []
Implicit Place search using SMT with State Equation took 5614 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:11] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:03:15] [INFO ] Dead Transitions using invariants and state equation in 3275 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p3)), (NOT p3), (OR (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s1504 1) (GEQ s3396 1)), p3:(AND (GEQ s262 1) (GEQ s1365 1)), p0:(AND (GEQ s333 1) (GEQ s1395 1)), p2:(GEQ s4560 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 639 steps with 4 reset in 189 ms.
FORMULA Philosophers-PT-001000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-09 finished in 9570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(G(p0))&&G(F(p1))))&&p1)))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 1 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 0 with 1992 rules applied. Total rules applied 1992 place count 4004 transition count 4004
Applied a total of 1992 rules in 695 ms. Remains 4004 /5000 variables (removed 996) and now considering 4004/5000 (removed 996) transitions.
// Phase 1: matrix 4004 rows 4004 cols
[2022-05-17 23:03:16] [INFO ] Computed 2000 place invariants in 4 ms
[2022-05-17 23:03:18] [INFO ] Implicit Places using invariants in 2465 ms returned []
// Phase 1: matrix 4004 rows 4004 cols
[2022-05-17 23:03:18] [INFO ] Computed 2000 place invariants in 5 ms
[2022-05-17 23:03:22] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 5813 ms to find 0 implicit places.
[2022-05-17 23:03:22] [INFO ] Redundant transitions in 140 ms returned []
// Phase 1: matrix 4004 rows 4004 cols
[2022-05-17 23:03:22] [INFO ] Computed 2000 place invariants in 5 ms
[2022-05-17 23:03:24] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4004/5000 places, 4004/5000 transitions.
Finished structural reductions, in 1 iterations. Remains : 4004/5000 places, 4004/5000 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1414 1) (LT s3437 1)), p0:(OR (LT s1916 1) (LT s3615 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration timeout after 83380 steps with 18 reset in 10001 ms.
Stack based approach found an accepted trace after 3362 steps with 2 reset with depth 1633 and stack size 1631 in 837 ms.
FORMULA Philosophers-PT-001000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-10 finished in 19900 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p1)||p0)))||G(p2)))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 217 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:35] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:03:38] [INFO ] Implicit Places using invariants in 2748 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:38] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:03:41] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 5466 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:41] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:03:44] [INFO ] Dead Transitions using invariants and state equation in 3122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=(NOT p2), acceptance={} source=8 dest: 2}, { cond=p2, acceptance={} source=8 dest: 3}]], initial=6, aps=[p1:(AND (GEQ s909 1) (GEQ s2016 1)), p0:(OR (LT s909 1) (LT s2016 1)), p2:(AND (GEQ s335 1) (GEQ s1392 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 572 steps with 0 reset in 161 ms.
FORMULA Philosophers-PT-001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-11 finished in 9307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 311 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:45] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:03:47] [INFO ] Implicit Places using invariants in 2734 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:47] [INFO ] Computed 2000 place invariants in 9 ms
[2022-05-17 23:03:50] [INFO ] Implicit Places using invariants and state equation in 2756 ms returned []
Implicit Place search using SMT with State Equation took 5493 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:03:50] [INFO ] Computed 2000 place invariants in 9 ms
[2022-05-17 23:03:54] [INFO ] Dead Transitions using invariants and state equation in 3304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s25 1) (GEQ s1097 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 529 steps with 0 reset in 154 ms.
FORMULA Philosophers-PT-001000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-12 finished in 9386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!F(p0))||p1||(F(p3)&&p2)) U p0))'
Support contains 7 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 1 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 0 with 1986 rules applied. Total rules applied 1986 place count 4007 transition count 4007
Applied a total of 1986 rules in 551 ms. Remains 4007 /5000 variables (removed 993) and now considering 4007/5000 (removed 993) transitions.
// Phase 1: matrix 4007 rows 4007 cols
[2022-05-17 23:03:54] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 23:03:57] [INFO ] Implicit Places using invariants in 2223 ms returned []
// Phase 1: matrix 4007 rows 4007 cols
[2022-05-17 23:03:57] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 23:04:00] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 5850 ms to find 0 implicit places.
[2022-05-17 23:04:00] [INFO ] Redundant transitions in 142 ms returned []
// Phase 1: matrix 4007 rows 4007 cols
[2022-05-17 23:04:00] [INFO ] Computed 2000 place invariants in 4 ms
[2022-05-17 23:04:03] [INFO ] Dead Transitions using invariants and state equation in 2197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4007/5000 places, 4007/5000 transitions.
Finished structural reductions, in 1 iterations. Remains : 4007/5000 places, 4007/5000 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p3), (NOT p0), (OR (NOT p0) (NOT p3)), true]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2 p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p2 p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(GEQ s4000 1), p0:(AND (GEQ s1245 1) (GEQ s3240 1)), p1:(AND (GEQ s148 1) (GEQ s1220 1)), p2:(AND (GEQ s1195 1) (GEQ s3173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 52 ms.
FORMULA Philosophers-PT-001000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-13 finished in 8995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G((G(p1)&&p0))))))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 1 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 0 with 1992 rules applied. Total rules applied 1992 place count 4004 transition count 4004
Applied a total of 1992 rules in 567 ms. Remains 4004 /5000 variables (removed 996) and now considering 4004/5000 (removed 996) transitions.
// Phase 1: matrix 4004 rows 4004 cols
[2022-05-17 23:04:03] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:04:06] [INFO ] Implicit Places using invariants in 2488 ms returned []
// Phase 1: matrix 4004 rows 4004 cols
[2022-05-17 23:04:06] [INFO ] Computed 2000 place invariants in 6 ms
[2022-05-17 23:04:09] [INFO ] Implicit Places using invariants and state equation in 3589 ms returned []
Implicit Place search using SMT with State Equation took 6079 ms to find 0 implicit places.
[2022-05-17 23:04:10] [INFO ] Redundant transitions in 139 ms returned []
// Phase 1: matrix 4004 rows 4004 cols
[2022-05-17 23:04:10] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:04:12] [INFO ] Dead Transitions using invariants and state equation in 2318 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4004/5000 places, 4004/5000 transitions.
Finished structural reductions, in 1 iterations. Remains : 4004/5000 places, 4004/5000 transitions.
Stuttering acceptance computed with spot in 27 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s783 1) (GEQ s1901 1)), p1:(AND (GEQ s555 1) (GEQ s1442 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 3719 ms.
Stack based approach found an accepted trace after 1052 steps with 0 reset with depth 1053 and stack size 1053 in 278 ms.
FORMULA Philosophers-PT-001000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-14 finished in 13160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||F(X((p1 U F(p2))))||p1)))'
Support contains 5 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 219 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:04:16] [INFO ] Computed 2000 place invariants in 17 ms
[2022-05-17 23:04:19] [INFO ] Implicit Places using invariants in 2743 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:04:19] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 23:04:22] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 5472 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:04:22] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 23:04:25] [INFO ] Dead Transitions using invariants and state equation in 3019 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s4889 1), p2:(AND (GEQ s134 1) (GEQ s1059 1)), p0:(AND (GEQ s782 1) (GEQ s1904 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 40900 steps with 13051 reset in 10003 ms.
Stack based approach found an accepted trace after 39661 steps with 9910 reset with depth 9905 and stack size 9905 in 8352 ms.
FORMULA Philosophers-PT-001000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-15 finished in 27279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Found a SL insensitive property : Philosophers-PT-001000-LTLFireability-01
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 179 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:04:44] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:04:45] [INFO ] Implicit Places using invariants in 1514 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:04:45] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 23:04:47] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:04:47] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:04:50] [INFO ] Dead Transitions using invariants and state equation in 3055 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s512 1) (GEQ s1629 1)) (AND (GEQ s807 1) (GEQ s1911 1)) (AND (GEQ s315 1) (GEQ s1355 1)) (AND (GEQ s385 1) (GEQ s1491 1)) (AND (GEQ s406 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 40280 steps with 13554 reset in 10001 ms.
Product exploration timeout after 39110 steps with 13048 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1449 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2165 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2176 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4825 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4494 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Probabilistic random walk exhausted memory after 560255 steps, saw 559848 distinct states, run finished after 33902 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:05:59] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:06:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 492 ms returned sat
[2022-05-17 23:06:08] [INFO ] After 2081ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:06:09] [INFO ] [Nat]Absence check using 2000 positive place invariants in 476 ms returned sat
[2022-05-17 23:06:20] [INFO ] After 9855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 23:06:25] [INFO ] After 14382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3548 ms.
[2022-05-17 23:06:28] [INFO ] After 20582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 4 properties in 157 ms. (steps per millisecond=6 )
Parikh walk visited 4 properties in 158 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 161 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:06:29] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:06:31] [INFO ] Implicit Places using invariants in 1633 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:06:31] [INFO ] Computed 2000 place invariants in 16 ms
[2022-05-17 23:06:32] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 3215 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:06:32] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:06:35] [INFO ] Dead Transitions using invariants and state equation in 3123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1525 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2085 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2092 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3915 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3927 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Probabilistic random walk exhausted memory after 560147 steps, saw 559740 distinct states, run finished after 33033 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:07:23] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 23:07:31] [INFO ] [Real]Absence check using 2000 positive place invariants in 490 ms returned sat
[2022-05-17 23:07:31] [INFO ] After 1911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:07:33] [INFO ] [Nat]Absence check using 2000 positive place invariants in 529 ms returned sat
[2022-05-17 23:07:44] [INFO ] After 10156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 23:07:49] [INFO ] After 14598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3503 ms.
[2022-05-17 23:07:52] [INFO ] After 20990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 4 properties in 165 ms. (steps per millisecond=6 )
Parikh walk visited 4 properties in 166 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Product exploration timeout after 40170 steps with 13342 reset in 10001 ms.
Product exploration timeout after 38950 steps with 12926 reset in 10003 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 178 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2022-05-17 23:08:14] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:08:14] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:08:17] [INFO ] Dead Transitions using invariants and state equation in 3086 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Product exploration timeout after 40470 steps with 13533 reset in 10002 ms.
Product exploration timeout after 39240 steps with 13138 reset in 10006 ms.
Built C files in :
/tmp/ltsmin10512155168912657671
[2022-05-17 23:08:37] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10512155168912657671
Running compilation step : cd /tmp/ltsmin10512155168912657671;'/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/ltsmin10512155168912657671;'/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/ltsmin10512155168912657671;'/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 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 153 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:08:40] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:08:41] [INFO ] Implicit Places using invariants in 1532 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:08:41] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:08:43] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:08:43] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:08:46] [INFO ] Dead Transitions using invariants and state equation in 3019 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin5679423705982927477
[2022-05-17 23:08:46] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5679423705982927477
Running compilation step : cd /tmp/ltsmin5679423705982927477;'/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/ltsmin5679423705982927477;'/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/ltsmin5679423705982927477;'/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:08:49] [INFO ] Flatten gal took : 160 ms
[2022-05-17 23:08:50] [INFO ] Flatten gal took : 165 ms
[2022-05-17 23:08:50] [INFO ] Time to serialize gal into /tmp/LTL17565067158496303397.gal : 16 ms
[2022-05-17 23:08:50] [INFO ] Time to serialize properties into /tmp/LTL7538076983323968332.ltl : 5 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/LTL17565067158496303397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7538076983323968332.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/LTL1756506...267
Read 1 LTL properties
Checking formula 0 : !((G(("((((((((((((Think_547>=1)&&(Fork_546>=1))||((Think_795>=1)&&(Fork_794>=1)))||(((Think_300>=1)&&(Fork_299>=1))||((Think_412>=1)&...69605
Formula 0 simplified : !G("((((((((((((Think_547>=1)&&(Fork_546>=1))||((Think_795>=1)&&(Fork_794>=1)))||(((Think_300>=1)&&(Fork_299>=1))||((Think_412>=1)&&...69599
Detected timeout of ITS tools.
[2022-05-17 23:09:05] [INFO ] Flatten gal took : 150 ms
[2022-05-17 23:09:05] [INFO ] Applying decomposition
[2022-05-17 23:09:05] [INFO ] Flatten gal took : 157 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/graph4489568932304319114.txt' '-o' '/tmp/graph4489568932304319114.bin' '-w' '/tmp/graph4489568932304319114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4489568932304319114.bin' '-l' '-1' '-v' '-w' '/tmp/graph4489568932304319114.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:09:05] [INFO ] Decomposing Gal with order
[2022-05-17 23:09:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:09:06] [INFO ] Removed a total of 990 redundant transitions.
[2022-05-17 23:09:06] [INFO ] Flatten gal took : 289 ms
[2022-05-17 23:09:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2844 labels/synchronizations in 37 ms.
[2022-05-17 23:09:09] [INFO ] Time to serialize gal into /tmp/LTL7102419269742726674.gal : 20 ms
[2022-05-17 23:09:09] [INFO ] Time to serialize properties into /tmp/LTL16152250611134808633.ltl : 8 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/LTL7102419269742726674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16152250611134808633.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/LTL7102419...246
Read 1 LTL properties
Checking formula 0 : !((G(("((((((((((((i48.i1.i1.i1.u743.Think_547>=1)&&(i48.i1.i1.i1.u743.Fork_546>=1))||((i43.u522.Think_795>=1)&&(i43.u522.Fork_794>=1)...122919
Formula 0 simplified : !G("((((((((((((i48.i1.i1.i1.u743.Think_547>=1)&&(i48.i1.i1.i1.u743.Fork_546>=1))||((i43.u522.Think_795>=1)&&(i43.u522.Fork_794>=1))...122913
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3673895909857630221
[2022-05-17 23:09:24] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3673895909857630221
Running compilation step : cd /tmp/ltsmin3673895909857630221;'/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/ltsmin3673895909857630221;'/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/ltsmin3673895909857630221;'/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-001000-LTLFireability-01 finished in 283818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||F(p1)) U G(p2)))'
Found a SL insensitive property : Philosophers-PT-001000-LTLFireability-03
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 46 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:09:27] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:09:28] [INFO ] Implicit Places using invariants in 1043 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:09:28] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:09:29] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:09:29] [INFO ] Computed 2000 place invariants in 7 ms
[2022-05-17 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 3140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s169 1) (GEQ s1227 1)) (AND (GEQ s239 1) (GEQ s1184 1)) (AND (GEQ s59 1) (GEQ s1132 1)) (AND (GEQ s349 1) (GEQ s1279 1)) (AND (GEQ s354 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 6539 ms.
Product exploration explored 100000 steps with 7 reset in 7130 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1546 ms. (steps per millisecond=6 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2191 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4276 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4638 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4192 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3606 ms. (steps per millisecond=2 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:10:08] [INFO ] Computed 2000 place invariants in 16 ms
[2022-05-17 23:10:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 530 ms returned sat
[2022-05-17 23:10:17] [INFO ] After 2276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:10:19] [INFO ] [Nat]Absence check using 2000 positive place invariants in 522 ms returned sat
[2022-05-17 23:10:37] [INFO ] After 7343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 23:10:41] [INFO ] After 11378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 774 ms.
[2022-05-17 23:10:42] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 601 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 47 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1273 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4379 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Probabilistic random walk after 186420 steps, saw 186283 distinct states, run finished after 15029 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:03] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:11:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 480 ms returned sat
[2022-05-17 23:11:07] [INFO ] After 1283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:11:08] [INFO ] [Nat]Absence check using 2000 positive place invariants in 494 ms returned sat
[2022-05-17 23:11:17] [INFO ] After 10130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 52 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 41 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:17] [INFO ] Computed 2000 place invariants in 12 ms
[2022-05-17 23:11:18] [INFO ] Implicit Places using invariants in 1038 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:18] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:11:19] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2022-05-17 23:11:20] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:20] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 23:11:23] [INFO ] Dead Transitions using invariants and state equation in 3383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 42 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:23] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:11:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 487 ms returned sat
[2022-05-17 23:11:27] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:11:28] [INFO ] [Nat]Absence check using 2000 positive place invariants in 490 ms returned sat
[2022-05-17 23:11:37] [INFO ] After 10053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 374 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 30 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:37] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:11:38] [INFO ] Implicit Places using invariants in 1042 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:38] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 23:11:39] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:39] [INFO ] Computed 2000 place invariants in 9 ms
[2022-05-17 23:11:43] [INFO ] Dead Transitions using invariants and state equation in 3229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1619 ms. (steps per millisecond=6 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2181 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3882 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3634 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3674 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:11:59] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:12:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 494 ms returned sat
[2022-05-17 23:12:09] [INFO ] After 2162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 23:12:10] [INFO ] [Nat]Absence check using 2000 positive place invariants in 485 ms returned sat
[2022-05-17 23:12:29] [INFO ] After 7684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 23:12:33] [INFO ] After 11473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 613 ms.
[2022-05-17 23:12:34] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 504 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 41 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1291 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3731 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Probabilistic random walk after 190264 steps, saw 190123 distinct states, run finished after 15027 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:12:54] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:12:58] [INFO ] [Real]Absence check using 2000 positive place invariants in 495 ms returned sat
[2022-05-17 23:12:58] [INFO ] After 1302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:12:59] [INFO ] [Nat]Absence check using 2000 positive place invariants in 499 ms returned sat
[2022-05-17 23:13:08] [INFO ] After 10111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 45 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 149 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:13:08] [INFO ] Computed 2000 place invariants in 10 ms
[2022-05-17 23:13:09] [INFO ] Implicit Places using invariants in 1116 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:13:09] [INFO ] Computed 2000 place invariants in 14 ms
[2022-05-17 23:13:10] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2022-05-17 23:13:11] [INFO ] Redundant transitions in 203 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:13:11] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:13:14] [INFO ] Dead Transitions using invariants and state equation in 3171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 44 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:13:14] [INFO ] Computed 2000 place invariants in 15 ms
[2022-05-17 23:13:17] [INFO ] [Real]Absence check using 2000 positive place invariants in 492 ms returned sat
[2022-05-17 23:13:17] [INFO ] After 1287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:13:19] [INFO ] [Nat]Absence check using 2000 positive place invariants in 498 ms returned sat
[2022-05-17 23:13:28] [INFO ] After 10128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 407 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 8 reset in 5618 ms.
Product exploration explored 100000 steps with 6 reset in 6422 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 48 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2022-05-17 23:13:41] [INFO ] Redundant transitions in 198 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:13:41] [INFO ] Computed 2000 place invariants in 11 ms
[2022-05-17 23:13:44] [INFO ] Dead Transitions using invariants and state equation in 3016 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Product exploration explored 100000 steps with 4 reset in 5919 ms.
Product exploration explored 100000 steps with 4 reset in 6622 ms.
Built C files in :
/tmp/ltsmin14044533069557355966
[2022-05-17 23:13:57] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14044533069557355966
Running compilation step : cd /tmp/ltsmin14044533069557355966;'/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/ltsmin14044533069557355966;'/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/ltsmin14044533069557355966;'/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 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 28 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:14:00] [INFO ] Computed 2000 place invariants in 13 ms
[2022-05-17 23:14:01] [INFO ] Implicit Places using invariants in 1119 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:14:01] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:14:02] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
// Phase 1: matrix 5000 rows 5000 cols
[2022-05-17 23:14:02] [INFO ] Computed 2000 place invariants in 8 ms
[2022-05-17 23:14:05] [INFO ] Dead Transitions using invariants and state equation in 3221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin7128686934797906346
[2022-05-17 23:14:05] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7128686934797906346
Running compilation step : cd /tmp/ltsmin7128686934797906346;'/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/ltsmin7128686934797906346;'/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/ltsmin7128686934797906346;'/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:14:09] [INFO ] Flatten gal took : 184 ms
[2022-05-17 23:14:09] [INFO ] Flatten gal took : 189 ms
[2022-05-17 23:14:09] [INFO ] Time to serialize gal into /tmp/LTL2602793145480170945.gal : 16 ms
[2022-05-17 23:14:09] [INFO ] Time to serialize properties into /tmp/LTL13067638943886575450.ltl : 7 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/LTL2602793145480170945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13067638943886575450.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/LTL2602793...267
Read 1 LTL properties
Checking formula 0 : !((((X("(((((((((((Eat_130>=1)||(Eat_257>=1))||((Eat_742>=1)||(Eat_891>=1)))||(((Eat_357>=1)||(Eat_490>=1))||((Eat_613>=1)||(Eat_48>=1...86505
Formula 0 simplified : !((X"(((((((((((Eat_130>=1)||(Eat_257>=1))||((Eat_742>=1)||(Eat_891>=1)))||(((Eat_357>=1)||(Eat_490>=1))||((Eat_613>=1)||(Eat_48>=1)...86496
Detected timeout of ITS tools.
[2022-05-17 23:14:24] [INFO ] Flatten gal took : 158 ms
[2022-05-17 23:14:24] [INFO ] Applying decomposition
[2022-05-17 23:14:24] [INFO ] Flatten gal took : 160 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/graph12400898391379544898.txt' '-o' '/tmp/graph12400898391379544898.bin' '-w' '/tmp/graph12400898391379544898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12400898391379544898.bin' '-l' '-1' '-v' '-w' '/tmp/graph12400898391379544898.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:14:25] [INFO ] Decomposing Gal with order
[2022-05-17 23:14:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:14:25] [INFO ] Removed a total of 992 redundant transitions.
[2022-05-17 23:14:25] [INFO ] Flatten gal took : 246 ms
[2022-05-17 23:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2778 labels/synchronizations in 39 ms.
[2022-05-17 23:14:28] [INFO ] Time to serialize gal into /tmp/LTL1616879630354442002.gal : 20 ms
[2022-05-17 23:14:28] [INFO ] Time to serialize properties into /tmp/LTL17074944027386841080.ltl : 10 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/LTL1616879630354442002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17074944027386841080.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/LTL1616879...246
Read 1 LTL properties
Checking formula 0 : !((((X("(((((((((((i14.u15.Eat_130>=1)||(i16.i0.i0.i1.u214.Eat_257>=1))||((i29.i1.i0.i1.u397.Eat_742>=1)||(i58.i0.i0.i0.u109.Eat_891>=...150847
Formula 0 simplified : !((X"(((((((((((i14.u15.Eat_130>=1)||(i16.i0.i0.i1.u214.Eat_257>=1))||((i29.i1.i0.i1.u397.Eat_742>=1)||(i58.i0.i0.i0.u109.Eat_891>=1...150838
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15923015198687129625
[2022-05-17 23:14:44] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15923015198687129625
Running compilation step : cd /tmp/ltsmin15923015198687129625;'/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/ltsmin15923015198687129625;'/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/ltsmin15923015198687129625;'/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-001000-LTLFireability-03 finished in 319499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X((G(X(p0))&&G(F(p1))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U !(p1 U p0))||!p0)))'
[2022-05-17 23:14:47] [INFO ] Flatten gal took : 220 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7845795320987913700
[2022-05-17 23:14:47] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:14:47] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7845795320987913700
Running compilation step : cd /tmp/ltsmin7845795320987913700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 23:14:47] [INFO ] Applying decomposition
[2022-05-17 23:14:47] [INFO ] Flatten gal took : 257 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/graph5067766374308686716.txt' '-o' '/tmp/graph5067766374308686716.bin' '-w' '/tmp/graph5067766374308686716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5067766374308686716.bin' '-l' '-1' '-v' '-w' '/tmp/graph5067766374308686716.weights' '-q' '0' '-e' '0.001'
[2022-05-17 23:14:48] [INFO ] Decomposing Gal with order
[2022-05-17 23:14:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:14:49] [INFO ] Removed a total of 992 redundant transitions.
[2022-05-17 23:14:49] [INFO ] Flatten gal took : 377 ms
[2022-05-17 23:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2684 labels/synchronizations in 39 ms.
[2022-05-17 23:15:00] [INFO ] Time to serialize gal into /tmp/LTLFireability4659694633872683620.gal : 31 ms
[2022-05-17 23:15:00] [INFO ] Time to serialize properties into /tmp/LTLFireability5532696439434536584.ltl : 41 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/LTLFireability4659694633872683620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5532696439434536584.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !((G(("((((((((((((i30.u373.Think_547>=1)&&(i30.u373.Fork_546>=1))||((i32.i1.i0.i1.u962.Think_795>=1)&&(i32.i1.i0.i1.u962.Fork_794>=1)...118551
Formula 0 simplified : !G("((((((((((((i30.u373.Think_547>=1)&&(i30.u373.Fork_546>=1))||((i32.i1.i0.i1.u962.Think_795>=1)&&(i32.i1.i0.i1.u962.Fork_794>=1))...118545
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 19239 ms.
Running link step : cd /tmp/ltsmin7845795320987913700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin7845795320987913700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X((LTLAPp1==true))))' '--buchi-type=spotba'
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
31352 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,314.176,6378252,1,0,1.13288e+07,937,15524,2.72367e+07,254,3612,323286
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-001000-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((X("(((((((((((i50.i0.i0.i0.u16.Eat_130>=1)||(i4.i0.i0.i0.u38.Eat_257>=1))||((i33.i1.i1.i0.u941.Eat_742>=1)||(i57.i1.i1.i0.u441.Ea...147663
Formula 1 simplified : !((X"(((((((((((i50.i0.i0.i0.u16.Eat_130>=1)||(i4.i0.i0.i0.u38.Eat_257>=1))||((i33.i1.i1.i0.u941.Eat_742>=1)||(i57.i1.i1.i0.u441.Eat...147654
Computing Next relation with stutter on 2 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7845795320987913700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7845795320987913700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp2==true))||<>((LTLAPp3==true))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.168: LTL layer: formula: ((X((LTLAPp2==true))||<>((LTLAPp3==true))) U []((LTLAPp1==true)))
pins2lts-mc-linux64( 1/ 8), 0.169: "((X((LTLAPp2==true))||<>((LTLAPp3==true))) U []((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.166: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.175: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.185: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.201: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.206: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.207: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.743: There are 5006 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.743: State length is 5001, there are 5014 groups
pins2lts-mc-linux64( 0/ 8), 2.743: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.743: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.743: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.743: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 5.190: [Blue] ~3 levels ~960 states ~47984 transitions
pins2lts-mc-linux64( 0/ 8), 6.948: [Blue] ~3 levels ~1920 states ~47984 transitions
pins2lts-mc-linux64( 0/ 8), 10.432: [Blue] ~3 levels ~3840 states ~47984 transitions
pins2lts-mc-linux64( 0/ 8), 16.879: [Blue] ~3 levels ~7680 states ~47984 transitions
pins2lts-mc-linux64( 0/ 8), 31.335: [Blue] ~31 levels ~15360 states ~489288 transitions
pins2lts-mc-linux64( 0/ 8), 62.232: [Blue] ~147 levels ~30720 states ~2245240 transitions
pins2lts-mc-linux64( 0/ 8), 130.290: [Blue] ~449 levels ~61440 states ~6566184 transitions
pins2lts-mc-linux64( 3/ 8), 135.825: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 203.015:
pins2lts-mc-linux64( 0/ 8), 203.015: Explored 45229 states 10321129 transitions, fanout: 228.197
pins2lts-mc-linux64( 0/ 8), 203.015: Total exploration time 200.250 sec (140.260 sec minimum, 183.044 sec on average)
pins2lts-mc-linux64( 0/ 8), 203.015: States per second: 226, Transitions per second: 51541
pins2lts-mc-linux64( 0/ 8), 203.015:
pins2lts-mc-linux64( 0/ 8), 203.015: State space has 10214646 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 203.015: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 203.015: blue states: 45229 (0.44%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 203.015: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 203.015: all-red states: 39327 (0.39%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 203.015:
pins2lts-mc-linux64( 0/ 8), 203.015: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 203.015:
pins2lts-mc-linux64( 0/ 8), 203.015: Queue width: 8B, total height: 5902, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 203.015: Tree memory: 333.9MB, 34.3 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 203.015: Tree fill ratio (roots/leafs): 7.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 203.015: Stored 5335 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 203.015: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 203.015: Est. total memory use: 334.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7845795320987913700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp2==true))||<>((LTLAPp3==true))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7845795320987913700;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp2==true))||<>((LTLAPp3==true))) U []((LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)

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

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