fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016400260
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Philosophers-COL-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3304747.00 0.00 0.00 ???????F????F??F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016400260.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-COL-010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.4K Apr 30 00:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 00:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 447K 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-COL-010000-LTLFireability-00
FORMULA_NAME Philosophers-COL-010000-LTLFireability-01
FORMULA_NAME Philosophers-COL-010000-LTLFireability-02
FORMULA_NAME Philosophers-COL-010000-LTLFireability-03
FORMULA_NAME Philosophers-COL-010000-LTLFireability-04
FORMULA_NAME Philosophers-COL-010000-LTLFireability-05
FORMULA_NAME Philosophers-COL-010000-LTLFireability-06
FORMULA_NAME Philosophers-COL-010000-LTLFireability-07
FORMULA_NAME Philosophers-COL-010000-LTLFireability-08
FORMULA_NAME Philosophers-COL-010000-LTLFireability-09
FORMULA_NAME Philosophers-COL-010000-LTLFireability-10
FORMULA_NAME Philosophers-COL-010000-LTLFireability-11
FORMULA_NAME Philosophers-COL-010000-LTLFireability-12
FORMULA_NAME Philosophers-COL-010000-LTLFireability-13
FORMULA_NAME Philosophers-COL-010000-LTLFireability-14
FORMULA_NAME Philosophers-COL-010000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652813721642

Running Version 202205111006
[2022-05-17 18:55:22] [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 18:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:55:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 18:55:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:55:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 713 ms
[2022-05-17 18:55:23] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50000 PT places and 50000.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 18:55:23] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 11 ms.
[2022-05-17 18:55:23] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-010000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :2
Finished Best-First random walk after 17 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=17 )
[2022-05-17 18:55:23] [INFO ] Flatten gal took : 14 ms
[2022-05-17 18:55:23] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10000) 10000) 10000)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 18:55:24] [INFO ] Unfolded HLPN to a Petri net with 50000 places and 50000 transitions 160000 arcs in 304 ms.
[2022-05-17 18:55:24] [INFO ] Unfolded 15 HLPN properties in 35 ms.
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 162 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 18:55:58] [INFO ] Computed 20000 place invariants in 239 ms
[2022-05-17 18:56:02] [INFO ] Implicit Places using invariants in 4297 ms returned []
Implicit Place search using SMT only with invariants took 4321 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 18:56:02] [INFO ] Computed 20000 place invariants in 140 ms
[2022-05-17 18:56:06] [INFO ] Dead Transitions using invariants and state equation in 4107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Support contains 50000 out of 50000 places after structural reductions.
[2022-05-17 18:56:13] [INFO ] Flatten gal took : 3496 ms
[2022-05-17 18:56:37] [INFO ] Flatten gal took : 4632 ms
[2022-05-17 18:57:03] [INFO ] Input system was already deterministic with 50000 transitions.
Interrupted random walk after 9260 steps, including 2 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen 8
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5357 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5565 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 18:57:46] [INFO ] Computed 20000 place invariants in 148 ms
[2022-05-17 18:58:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:58:11] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 571 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 8954 steps, including 2 resets, run timeout after 30004 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5325 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5435 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk exhausted memory after 50907 steps, saw 50906 distinct states, run finished after 25630 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 18:59:19] [INFO ] Computed 20000 place invariants in 128 ms
[2022-05-17 18:59:44] [INFO ] [Real]Absence check using 20000 positive place invariants in 13691 ms returned unknown
[2022-05-17 18:59:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:59:44] [INFO ] After 25193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 445 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 301 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 18:59:45] [INFO ] Computed 20000 place invariants in 141 ms
[2022-05-17 18:59:49] [INFO ] Implicit Places using invariants in 4080 ms returned []
Implicit Place search using SMT only with invariants took 4081 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 18:59:49] [INFO ] Computed 20000 place invariants in 138 ms
[2022-05-17 18:59:53] [INFO ] Dead Transitions using invariants and state equation in 3866 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
FORMULA Philosophers-COL-010000-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-COL-010000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((p0 U p1))) U X((!p0 U G(X(p0)))))))'
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 109 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:00:20] [INFO ] Computed 20000 place invariants in 121 ms
[2022-05-17 19:00:24] [INFO ] Implicit Places using invariants in 3866 ms returned []
Implicit Place search using SMT only with invariants took 3867 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:00:24] [INFO ] Computed 20000 place invariants in 129 ms
[2022-05-17 19:00:28] [INFO ] Dead Transitions using invariants and state equation in 3886 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Stuttering acceptance computed with spot in 434 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-010000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s17755 1) (GEQ s37756 1)) (AND (GEQ s10671 1) (GEQ s30672 1)) (AND (GEQ s14800 1) (GEQ s34801 1)) (AND (GEQ s13626 1) (GEQ s33627 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 1730 steps with 347 reset in 10112 ms.
Product exploration timeout after 1660 steps with 336 reset in 10026 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Interrupted random walk after 9523 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7688 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:02:55] [INFO ] Computed 20000 place invariants in 140 ms
[2022-05-17 19:03:20] [INFO ] [Real]Absence check using 20000 positive place invariants in 13570 ms returned unknown
[2022-05-17 19:03:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:03:21] [INFO ] After 25073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 432 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Finished random walk after 3335 steps, including 1 resets, run visited all 1 properties in 10517 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
[2022-05-17 19:05:04] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 96 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:05:04] [INFO ] Computed 20000 place invariants in 130 ms
[2022-05-17 19:05:08] [INFO ] Implicit Places using invariants in 3944 ms returned []
Implicit Place search using SMT only with invariants took 3949 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:05:08] [INFO ] Computed 20000 place invariants in 145 ms
[2022-05-17 19:05:12] [INFO ] Dead Transitions using invariants and state equation in 3908 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Finished random walk after 3335 steps, including 1 resets, run visited all 5 properties in 10253 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 355 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
[2022-05-17 19:08:13] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Product exploration timeout after 1650 steps with 341 reset in 10063 ms.
Product exploration timeout after 1600 steps with 311 reset in 10044 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 427 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:08:35] [INFO ] Computed 20000 place invariants in 159 ms
[2022-05-17 19:08:39] [INFO ] Dead Transitions using invariants and state equation in 4150 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Product exploration timeout after 1300 steps with 253 reset in 10055 ms.
Product exploration timeout after 1260 steps with 247 reset in 10006 ms.
Built C files in :
/tmp/ltsmin1593800384415610895
[2022-05-17 19:09:00] [INFO ] Built C files in 517ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1593800384415610895
Running compilation step : cd /tmp/ltsmin1593800384415610895;'/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/ltsmin1593800384415610895;'/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/ltsmin1593800384415610895;'/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 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 133 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:09:03] [INFO ] Computed 20000 place invariants in 144 ms
[2022-05-17 19:09:07] [INFO ] Implicit Places using invariants in 4221 ms returned []
Implicit Place search using SMT only with invariants took 4225 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:09:07] [INFO ] Computed 20000 place invariants in 155 ms
[2022-05-17 19:09:11] [INFO ] Dead Transitions using invariants and state equation in 4214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Built C files in :
/tmp/ltsmin595374657156495566
[2022-05-17 19:09:12] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin595374657156495566
Running compilation step : cd /tmp/ltsmin595374657156495566;'/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/ltsmin595374657156495566;'/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/ltsmin595374657156495566;'/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 19:09:23] [INFO ] Flatten gal took : 1998 ms
[2022-05-17 19:09:25] [INFO ] Flatten gal took : 1802 ms
[2022-05-17 19:09:25] [INFO ] Time to serialize gal into /tmp/LTL4499412033207080265.gal : 311 ms
[2022-05-17 19:09:26] [INFO ] Time to serialize properties into /tmp/LTL7170159994342114228.ltl : 211 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/LTL4499412033207080265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7170159994342114228.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/LTL4499412...266
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-17 19:09:43] [INFO ] Flatten gal took : 1882 ms
[2022-05-17 19:09:43] [INFO ] Applying decomposition
[2022-05-17 19:09:45] [INFO ] Flatten gal took : 1769 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/graph415609086527701611.txt' '-o' '/tmp/graph415609086527701611.bin' '-w' '/tmp/graph415609086527701611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph415609086527701611.bin' '-l' '-1' '-v' '-w' '/tmp/graph415609086527701611.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:09:50] [INFO ] Decomposing Gal with order
[2022-05-17 19:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:25:33] [INFO ] Removed a total of 9922 redundant transitions.
[2022-05-17 19:25:35] [INFO ] Flatten gal took : 3140 ms
[2022-05-17 19:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 34068 labels/synchronizations in 999 ms.
[2022-05-17 19:44:55] [INFO ] Time to serialize gal into /tmp/LTL10341398595782363523.gal : 346 ms
[2022-05-17 19:44:55] [INFO ] Time to serialize properties into /tmp/LTL3909644648296864229.ltl : 275 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/LTL10341398595782363523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3909644648296864229.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/LTL1034139...246
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10927692731421263670
[2022-05-17 19:45:11] [INFO ] Built C files in 582ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10927692731421263670
Running compilation step : cd /tmp/ltsmin10927692731421263670;'/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/ltsmin10927692731421263670;'/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/ltsmin10927692731421263670;'/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-COL-010000-LTLFireability-00 finished in 2694480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)||p1))||G(p0))))'
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 96 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:45:15] [INFO ] Computed 20000 place invariants in 116 ms
[2022-05-17 19:45:18] [INFO ] Implicit Places using invariants in 3802 ms returned []
Implicit Place search using SMT only with invariants took 3803 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:45:18] [INFO ] Computed 20000 place invariants in 116 ms
[2022-05-17 19:45:22] [INFO ] Dead Transitions using invariants and state equation in 3707 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-010000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s17755 1) (LT s37756 1)) (OR (LT s10671 1) (LT s30672 1)) (OR (LT s14800 1) (LT s34801 1)) (OR (LT s13626 1) (LT s33627 1)) (OR (LT s11845...], 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 3230 steps with 3 reset in 10024 ms.
Product exploration timeout after 3140 steps with 0 reset in 10027 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 p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 30 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 145 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:46:11] [INFO ] Computed 20000 place invariants in 126 ms
[2022-05-17 19:46:14] [INFO ] Implicit Places using invariants in 3881 ms returned []
Implicit Place search using SMT only with invariants took 3886 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:46:14] [INFO ] Computed 20000 place invariants in 128 ms
[2022-05-17 19:46:18] [INFO ] Dead Transitions using invariants and state equation in 3877 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 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 p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 70 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 3270 steps with 5 reset in 10029 ms.
Product exploration timeout after 3150 steps with 0 reset in 10016 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 273 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:47:04] [INFO ] Computed 20000 place invariants in 124 ms
[2022-05-17 19:47:08] [INFO ] Dead Transitions using invariants and state equation in 3912 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Product exploration timeout after 3310 steps with 2 reset in 10002 ms.
Product exploration timeout after 3230 steps with 0 reset in 10025 ms.
Built C files in :
/tmp/ltsmin8928635506118500186
[2022-05-17 19:47:29] [INFO ] Built C files in 320ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8928635506118500186
Running compilation step : cd /tmp/ltsmin8928635506118500186;'/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/ltsmin8928635506118500186;'/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/ltsmin8928635506118500186;'/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 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 178 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:47:32] [INFO ] Computed 20000 place invariants in 122 ms
[2022-05-17 19:47:36] [INFO ] Implicit Places using invariants in 3860 ms returned []
Implicit Place search using SMT only with invariants took 3867 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-17 19:47:36] [INFO ] Computed 20000 place invariants in 129 ms
[2022-05-17 19:47:39] [INFO ] Dead Transitions using invariants and state equation in 3869 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Built C files in :
/tmp/ltsmin13458958914289508549
[2022-05-17 19:47:40] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13458958914289508549
Running compilation step : cd /tmp/ltsmin13458958914289508549;'/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/ltsmin13458958914289508549;'/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/ltsmin13458958914289508549;'/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 19:47:51] [INFO ] Flatten gal took : 1832 ms
[2022-05-17 19:47:52] [INFO ] Flatten gal took : 1664 ms
[2022-05-17 19:47:53] [INFO ] Time to serialize gal into /tmp/LTL4563847679624229767.gal : 214 ms
[2022-05-17 19:47:53] [INFO ] Time to serialize properties into /tmp/LTL11272337713566153437.ltl : 74 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/LTL4563847679624229767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11272337713566153437.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/LTL4563847...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-17 19:48:10] [INFO ] Flatten gal took : 1854 ms
[2022-05-17 19:48:10] [INFO ] Applying decomposition
[2022-05-17 19:48:12] [INFO ] Flatten gal took : 1680 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/graph3055491284494766722.txt' '-o' '/tmp/graph3055491284494766722.bin' '-w' '/tmp/graph3055491284494766722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3055491284494766722.bin' '-l' '-1' '-v' '-w' '/tmp/graph3055491284494766722.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:48:16] [INFO ] Decomposing Gal with order
[2022-05-17 19:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.

BK_STOP 1652817026389

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

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