Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422500327.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-PT-000200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422500327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 168K Apr 13 10:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 945K Apr 13 10:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 13 10:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 641K Apr 13 10:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 284K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 342K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 227K Apr 13 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 301K Apr 13 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 13 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 445K May 18 16:43 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-000200-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716998554892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 16:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 16:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:02:38] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2024-05-29 16:02:38] [INFO ] Transformed 1000 places.
[2024-05-29 16:02:38] [INFO ] Transformed 1000 transitions.
[2024-05-29 16:02:38] [INFO ] Found NUPN structural information;
[2024-05-29 16:02:38] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 111 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Philosophers-PT-000200-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-29 16:02:38] [INFO ] Computed 400 invariants in 47 ms
[2024-05-29 16:02:39] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-05-29 16:02:39] [INFO ] Invariant cache hit.
[2024-05-29 16:02:40] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
[2024-05-29 16:02:40] [INFO ] Invariant cache hit.
[2024-05-29 16:02:41] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2975 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2024-05-29 16:02:42] [INFO ] Flatten gal took : 149 ms
[2024-05-29 16:02:42] [INFO ] Flatten gal took : 89 ms
[2024-05-29 16:02:42] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 16:02:43] [INFO ] Invariant cache hit.
[2024-05-29 16:02:44] [INFO ] [Real]Absence check using 400 positive place invariants in 116 ms returned sat
[2024-05-29 16:02:44] [INFO ] After 714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 16:02:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 105 ms returned sat
[2024-05-29 16:02:48] [INFO ] After 3034ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 16:02:48] [INFO ] After 3770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 733 ms.
[2024-05-29 16:02:49] [INFO ] After 5150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 202 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 21 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&F(p2))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 100 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:02:50] [INFO ] Invariant cache hit.
[2024-05-29 16:02:50] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-29 16:02:50] [INFO ] Invariant cache hit.
[2024-05-29 16:02:52] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
[2024-05-29 16:02:52] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 16:02:52] [INFO ] Invariant cache hit.
[2024-05-29 16:02:53] [INFO ] Dead Transitions using invariants and state equation in 1250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3686 ms. Remains : 1000/1000 places, 1000/1000 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 419 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 2019 ms.
Product exploration explored 100000 steps with 1 reset in 2151 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 16:03:06] [INFO ] Invariant cache hit.
[2024-05-29 16:03:06] [INFO ] [Real]Absence check using 400 positive place invariants in 104 ms returned sat
[2024-05-29 16:03:07] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 16:03:07] [INFO ] [Nat]Absence check using 400 positive place invariants in 159 ms returned sat
[2024-05-29 16:03:09] [INFO ] After 1859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 16:03:10] [INFO ] After 3170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1439 ms.
[2024-05-29 16:03:12] [INFO ] After 5177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 238 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 52 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 89 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:03:12] [INFO ] Invariant cache hit.
[2024-05-29 16:03:13] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-29 16:03:13] [INFO ] Invariant cache hit.
[2024-05-29 16:03:15] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
[2024-05-29 16:03:15] [INFO ] Redundant transitions in 64 ms returned []
[2024-05-29 16:03:15] [INFO ] Invariant cache hit.
[2024-05-29 16:03:16] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3833 ms. Remains : 1000/1000 places, 1000/1000 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 16:03:24] [INFO ] Invariant cache hit.
[2024-05-29 16:03:24] [INFO ] [Real]Absence check using 400 positive place invariants in 152 ms returned sat
[2024-05-29 16:03:24] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 16:03:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 149 ms returned sat
[2024-05-29 16:03:27] [INFO ] After 2003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 16:03:28] [INFO ] After 3465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1484 ms.
[2024-05-29 16:03:30] [INFO ] After 5520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 238 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 30 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 2217 ms.
Product exploration explored 100000 steps with 1 reset in 2586 ms.
Built C files in :
/tmp/ltsmin4278533810245635077
[2024-05-29 16:03:35] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:03:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:03:35] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:03:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:03:36] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:03:36] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:03:36] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4278533810245635077
Running compilation step : cd /tmp/ltsmin4278533810245635077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4278533810245635077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4278533810245635077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 48 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:03:39] [INFO ] Invariant cache hit.
[2024-05-29 16:03:39] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-29 16:03:39] [INFO ] Invariant cache hit.
[2024-05-29 16:03:41] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2024-05-29 16:03:41] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 16:03:41] [INFO ] Invariant cache hit.
[2024-05-29 16:03:42] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3560 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin2001226190938097380
[2024-05-29 16:03:42] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:03:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:03:42] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:03:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:03:42] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:03:42] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:03:43] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2001226190938097380
Running compilation step : cd /tmp/ltsmin2001226190938097380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2001226190938097380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2001226190938097380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 16:03:46] [INFO ] Flatten gal took : 60 ms
[2024-05-29 16:03:46] [INFO ] Flatten gal took : 68 ms
[2024-05-29 16:03:46] [INFO ] Time to serialize gal into /tmp/LTL11814528087866935138.gal : 11 ms
[2024-05-29 16:03:46] [INFO ] Time to serialize properties into /tmp/LTL12578725630385639629.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11814528087866935138.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2380364840218732205.hoa' '-atoms' '/tmp/LTL12578725630385639629.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12578725630385639629.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2380364840218732205.hoa
Detected timeout of ITS tools.
[2024-05-29 16:04:01] [INFO ] Flatten gal took : 55 ms
[2024-05-29 16:04:01] [INFO ] Flatten gal took : 48 ms
[2024-05-29 16:04:01] [INFO ] Time to serialize gal into /tmp/LTL1358012941675322478.gal : 7 ms
[2024-05-29 16:04:01] [INFO ] Time to serialize properties into /tmp/LTL11087995584558716050.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1358012941675322478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11087995584558716050.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((((((Fork_3+Fork_2)+(Fork_5+Fork_4))+((Fork_1+Fork_18)+(Fork_19+Fork_20)))+(((Fork_21+Fork_14)+(Fork_15+Fork_16))+((For...7138
Formula 0 simplified : G(F!"(((((((((Fork_3+Fork_2)+(Fork_5+Fork_4))+((Fork_1+Fork_18)+(Fork_19+Fork_20)))+(((Fork_21+Fork_14)+(Fork_15+Fork_16))+((Fork_17...7129
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 16:04:16] [INFO ] Flatten gal took : 42 ms
[2024-05-29 16:04:16] [INFO ] Applying decomposition
[2024-05-29 16:04:16] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14191606069279064897.txt' '-o' '/tmp/graph14191606069279064897.bin' '-w' '/tmp/graph14191606069279064897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14191606069279064897.bin' '-l' '-1' '-v' '-w' '/tmp/graph14191606069279064897.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:04:17] [INFO ] Decomposing Gal with order
[2024-05-29 16:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:04:18] [INFO ] Removed a total of 507 redundant transitions.
[2024-05-29 16:04:18] [INFO ] Flatten gal took : 892 ms
[2024-05-29 16:04:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-29 16:04:18] [INFO ] Time to serialize gal into /tmp/LTL16570772107834438060.gal : 20 ms
[2024-05-29 16:04:18] [INFO ] Time to serialize properties into /tmp/LTL3362259229718188763.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16570772107834438060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3362259229718188763.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((((((gi0.gu72.Fork_3+gi0.gu72.Fork_2)+(gi0.gu72.Fork_5+gi0.gu72.Fork_4))+((gi0.gu72.Fork_1+gi0.gu72.Fork_18)+(gi0.gu72....10938
Formula 0 simplified : G(F!"(((((((((gi0.gu72.Fork_3+gi0.gu72.Fork_2)+(gi0.gu72.Fork_5+gi0.gu72.Fork_4))+((gi0.gu72.Fork_1+gi0.gu72.Fork_18)+(gi0.gu72.Fork...10929
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14084802028457659661
[2024-05-29 16:04:33] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14084802028457659661
Running compilation step : cd /tmp/ltsmin14084802028457659661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14084802028457659661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14084802028457659661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-000200-LTLCardinality-00 finished in 106609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:04:36] [INFO ] Invariant cache hit.
[2024-05-29 16:04:37] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-29 16:04:37] [INFO ] Invariant cache hit.
[2024-05-29 16:04:39] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2024-05-29 16:04:39] [INFO ] Invariant cache hit.
[2024-05-29 16:04:40] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3849 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 (ADD s381 s382 s383 s384 s385 s386 s387 s388 s390 s393 s394 s395 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427...], 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 explored 100000 steps with 33187 reset in 5256 ms.
Product exploration explored 100000 steps with 33264 reset in 5199 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 p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 331 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 400 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
[2024-05-29 16:04:54] [INFO ] Invariant cache hit.
[2024-05-29 16:05:09] [INFO ] [Real]Absence check using 400 positive place invariants in 8352 ms returned unknown
Could not prove EG (NOT p1)
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 800 transition count 800
Applied a total of 400 rules in 179 ms. Remains 800 /1000 variables (removed 200) and now considering 800/1000 (removed 200) transitions.
// Phase 1: matrix 800 rows 800 cols
[2024-05-29 16:05:09] [INFO ] Computed 400 invariants in 4 ms
[2024-05-29 16:05:10] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2024-05-29 16:05:10] [INFO ] Invariant cache hit.
[2024-05-29 16:05:12] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2836 ms to find 0 implicit places.
[2024-05-29 16:05:12] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 16:05:12] [INFO ] Invariant cache hit.
[2024-05-29 16:05:13] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/1000 places, 800/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4036 ms. Remains : 800/1000 places, 800/1000 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 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2024-05-29 16:05:15] [INFO ] Invariant cache hit.
[2024-05-29 16:05:26] [INFO ] [Real]Absence check using 400 positive place invariants in 8167 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000200-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000200-LTLCardinality-01 finished in 50532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p1)))||X(p2))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-29 16:05:27] [INFO ] Computed 400 invariants in 11 ms
[2024-05-29 16:05:28] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-29 16:05:28] [INFO ] Invariant cache hit.
[2024-05-29 16:05:29] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
[2024-05-29 16:05:29] [INFO ] Invariant cache hit.
[2024-05-29 16:05:30] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3777 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 37 reset in 6464 ms.
Product exploration explored 100000 steps with 38 reset in 6254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 415 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1035 ms. (steps per millisecond=9 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 16:05:47] [INFO ] Invariant cache hit.
[2024-05-29 16:05:48] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 522 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 16:05:49] [INFO ] Invariant cache hit.
[2024-05-29 16:05:54] [INFO ] [Real]Absence check using 400 positive place invariants in 1047 ms returned sat
[2024-05-29 16:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 16:05:59] [INFO ] [Real]Absence check using state equation in 5658 ms returned sat
[2024-05-29 16:05:59] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p0)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 49 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:06:07] [INFO ] Invariant cache hit.
[2024-05-29 16:06:07] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-05-29 16:06:07] [INFO ] Invariant cache hit.
[2024-05-29 16:06:09] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2024-05-29 16:06:09] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 16:06:09] [INFO ] Invariant cache hit.
[2024-05-29 16:06:10] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3393 ms. Remains : 1000/1000 places, 1000/1000 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) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Finished random walk after 5948 steps, including 1 resets, run visited all 3 properties in 197 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 617 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 16:06:16] [INFO ] Invariant cache hit.
[2024-05-29 16:06:21] [INFO ] [Real]Absence check using 400 positive place invariants in 1047 ms returned sat
[2024-05-29 16:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 16:06:26] [INFO ] [Real]Absence check using state equation in 5012 ms returned sat
[2024-05-29 16:06:26] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Product exploration explored 100000 steps with 33 reset in 5729 ms.
Product exploration explored 100000 steps with 37 reset in 5475 ms.
Built C files in :
/tmp/ltsmin5877303995014024517
[2024-05-29 16:06:44] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:06:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:06:44] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:06:44] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:06:44] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:06:44] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:06:44] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5877303995014024517
Running compilation step : cd /tmp/ltsmin5877303995014024517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5877303995014024517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5877303995014024517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:06:47] [INFO ] Invariant cache hit.
[2024-05-29 16:06:48] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-29 16:06:48] [INFO ] Invariant cache hit.
[2024-05-29 16:06:49] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2024-05-29 16:06:49] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-29 16:06:49] [INFO ] Invariant cache hit.
[2024-05-29 16:06:51] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3283 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin11326183878622150425
[2024-05-29 16:06:51] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:06:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:06:51] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:06:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:06:51] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:06:51] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:06:51] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11326183878622150425
Running compilation step : cd /tmp/ltsmin11326183878622150425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11326183878622150425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11326183878622150425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 16:06:54] [INFO ] Flatten gal took : 61 ms
[2024-05-29 16:06:54] [INFO ] Flatten gal took : 60 ms
[2024-05-29 16:06:54] [INFO ] Time to serialize gal into /tmp/LTL11187699183043962917.gal : 9 ms
[2024-05-29 16:06:54] [INFO ] Time to serialize properties into /tmp/LTL8364908054728532409.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11187699183043962917.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14191119520772028541.hoa' '-atoms' '/tmp/LTL8364908054728532409.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8364908054728532409.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14191119520772028541.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 16:07:09] [INFO ] Flatten gal took : 36 ms
[2024-05-29 16:07:09] [INFO ] Flatten gal took : 35 ms
[2024-05-29 16:07:09] [INFO ] Time to serialize gal into /tmp/LTL4119404694609565258.gal : 7 ms
[2024-05-29 16:07:09] [INFO ] Time to serialize properties into /tmp/LTL11621056903195081014.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4119404694609565258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11621056903195081014.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((Catch2_8+Catch2_9)+(Catch2_6+Catch2_7))+((Catch2_12+Catch2_13)+(Catch2_10+Catch2_11)))+(((Catch2_16+Catch2_17)+(Cat...13009
Formula 0 simplified : G(F(!"(((((((((Catch2_8+Catch2_9)+(Catch2_6+Catch2_7))+((Catch2_12+Catch2_13)+(Catch2_10+Catch2_11)))+(((Catch2_16+Catch2_17)+(Catch...12999
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 16:07:24] [INFO ] Flatten gal took : 36 ms
[2024-05-29 16:07:24] [INFO ] Applying decomposition
[2024-05-29 16:07:24] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10284974650535213599.txt' '-o' '/tmp/graph10284974650535213599.bin' '-w' '/tmp/graph10284974650535213599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10284974650535213599.bin' '-l' '-1' '-v' '-w' '/tmp/graph10284974650535213599.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:07:25] [INFO ] Decomposing Gal with order
[2024-05-29 16:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:07:26] [INFO ] Removed a total of 594 redundant transitions.
[2024-05-29 16:07:26] [INFO ] Flatten gal took : 561 ms
[2024-05-29 16:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 16:07:26] [INFO ] Time to serialize gal into /tmp/LTL17889278527340703563.gal : 12 ms
[2024-05-29 16:07:26] [INFO ] Time to serialize properties into /tmp/LTL14447299963116807442.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17889278527340703563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14447299963116807442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((gu199.Catch2_8+gu199.Catch2_9)+(gu199.Catch2_6+gu199.Catch2_7))+((gu199.Catch2_12+gu199.Catch2_13)+(gu199.Catch2_10...19809
Formula 0 simplified : G(F(!"(((((((((gu199.Catch2_8+gu199.Catch2_9)+(gu199.Catch2_6+gu199.Catch2_7))+((gu199.Catch2_12+gu199.Catch2_13)+(gu199.Catch2_10+g...19799
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15855302211989254647
[2024-05-29 16:07:41] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15855302211989254647
Running compilation step : cd /tmp/ltsmin15855302211989254647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15855302211989254647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15855302211989254647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-000200-LTLCardinality-02 finished in 137286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:07:44] [INFO ] Invariant cache hit.
[2024-05-29 16:07:45] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-05-29 16:07:45] [INFO ] Invariant cache hit.
[2024-05-29 16:07:46] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2024-05-29 16:07:46] [INFO ] Invariant cache hit.
[2024-05-29 16:07:47] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3372 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-04 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 (LEQ 3 (ADD s381 s382 s383 s384 s385 s386 s387 s388 s390 s393 s394 s395 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426...], 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 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-04 finished in 3591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U p1))||G(p2))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:07:48] [INFO ] Invariant cache hit.
[2024-05-29 16:07:48] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-29 16:07:48] [INFO ] Invariant cache hit.
[2024-05-29 16:07:49] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2024-05-29 16:07:49] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 16:07:49] [INFO ] Invariant cache hit.
[2024-05-29 16:07:50] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2607 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s2...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12 reset in 6066 ms.
Stack based approach found an accepted trace after 12296 steps with 1 reset with depth 12120 and stack size 12019 in 754 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-06 finished in 9592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(F(!p0)))))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:07:57] [INFO ] Invariant cache hit.
[2024-05-29 16:07:58] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2024-05-29 16:07:58] [INFO ] Invariant cache hit.
[2024-05-29 16:08:00] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
[2024-05-29 16:08:00] [INFO ] Invariant cache hit.
[2024-05-29 16:08:01] [INFO ] Dead Transitions using invariants and state equation in 1409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4164 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0, true]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 2 (ADD s381 s382 s383 s384 s385 s386 s387 s388 s390 s393 s394 s395 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427...], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 88093 steps with 7 reset in 1756 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-07 finished in 6089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p0 U X(p1))||(p1&&G(p2)))))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 76 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:08:03] [INFO ] Invariant cache hit.
[2024-05-29 16:08:05] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-05-29 16:08:05] [INFO ] Invariant cache hit.
[2024-05-29 16:08:06] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
[2024-05-29 16:08:06] [INFO ] Invariant cache hit.
[2024-05-29 16:08:07] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3841 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(EQ s777 1), p2:(OR (EQ s555 0) (EQ s51 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]]
Stuttering criterion allowed to conclude after 95676 steps with 48 reset in 1675 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-09 finished in 5780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 45 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:08:09] [INFO ] Invariant cache hit.
[2024-05-29 16:08:10] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2024-05-29 16:08:10] [INFO ] Invariant cache hit.
[2024-05-29 16:08:12] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2024-05-29 16:08:12] [INFO ] Invariant cache hit.
[2024-05-29 16:08:14] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4769 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s461 1), p0:(EQ s272 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 53 reset in 1581 ms.
Stack based approach found an accepted trace after 4324 steps with 8 reset with depth 437 and stack size 437 in 103 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-12 finished in 6688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 35 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:08:16] [INFO ] Invariant cache hit.
[2024-05-29 16:08:17] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-05-29 16:08:17] [INFO ] Invariant cache hit.
[2024-05-29 16:08:19] [INFO ] Implicit Places using invariants and state equation in 1955 ms returned []
Implicit Place search using SMT with State Equation took 3044 ms to find 0 implicit places.
[2024-05-29 16:08:19] [INFO ] Invariant cache hit.
[2024-05-29 16:08:20] [INFO ] Dead Transitions using invariants and state equation in 1304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4385 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-14 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 (NEQ s739 0) (NEQ s863 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 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-14 finished in 4512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 28 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:08:20] [INFO ] Invariant cache hit.
[2024-05-29 16:08:21] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2024-05-29 16:08:21] [INFO ] Invariant cache hit.
[2024-05-29 16:08:23] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 3170 ms to find 0 implicit places.
[2024-05-29 16:08:23] [INFO ] Invariant cache hit.
[2024-05-29 16:08:25] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4575 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s589 0) (NEQ s3 1)), p0:(OR (EQ s56 0) (EQ s446 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000200-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLCardinality-15 finished in 4736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p1)))||X(p2))))'
Found a Shortening insensitive property : Philosophers-PT-000200-LTLCardinality-02
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:08:25] [INFO ] Invariant cache hit.
[2024-05-29 16:08:26] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-05-29 16:08:26] [INFO ] Invariant cache hit.
[2024-05-29 16:08:28] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2024-05-29 16:08:28] [INFO ] Invariant cache hit.
[2024-05-29 16:08:29] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3461 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running random walk in product with property : Philosophers-PT-000200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 40 reset in 6771 ms.
Product exploration explored 100000 steps with 37 reset in 7202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 282 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 16:08:47] [INFO ] Invariant cache hit.
[2024-05-29 16:08:48] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 498 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 16:08:49] [INFO ] Invariant cache hit.
[2024-05-29 16:08:53] [INFO ] [Real]Absence check using 400 positive place invariants in 1037 ms returned sat
[2024-05-29 16:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 16:08:58] [INFO ] [Real]Absence check using state equation in 5370 ms returned sat
[2024-05-29 16:08:58] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p0)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:09:05] [INFO ] Invariant cache hit.
[2024-05-29 16:09:06] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-29 16:09:06] [INFO ] Invariant cache hit.
[2024-05-29 16:09:08] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2024-05-29 16:09:08] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 16:09:08] [INFO ] Invariant cache hit.
[2024-05-29 16:09:09] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3889 ms. Remains : 1000/1000 places, 1000/1000 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) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Finished random walk after 1177 steps, including 0 resets, run visited all 3 properties in 45 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 16:09:15] [INFO ] Invariant cache hit.
[2024-05-29 16:09:19] [INFO ] [Real]Absence check using 400 positive place invariants in 1054 ms returned sat
[2024-05-29 16:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 16:09:25] [INFO ] [Real]Absence check using state equation in 5335 ms returned sat
[2024-05-29 16:09:25] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Product exploration explored 100000 steps with 36 reset in 5605 ms.
Product exploration explored 100000 steps with 36 reset in 5847 ms.
Built C files in :
/tmp/ltsmin7603235344159726759
[2024-05-29 16:09:43] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:09:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:09:43] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:09:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:09:44] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:09:44] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:09:44] [INFO ] Built C files in 320ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7603235344159726759
Running compilation step : cd /tmp/ltsmin7603235344159726759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7603235344159726759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7603235344159726759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 16:09:47] [INFO ] Invariant cache hit.
[2024-05-29 16:09:48] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2024-05-29 16:09:48] [INFO ] Invariant cache hit.
[2024-05-29 16:09:49] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2024-05-29 16:09:49] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 16:09:49] [INFO ] Invariant cache hit.
[2024-05-29 16:09:51] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3919 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin10111112816276441693
[2024-05-29 16:09:51] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:09:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:09:51] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:09:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:09:51] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:09:51] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:09:51] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10111112816276441693
Running compilation step : cd /tmp/ltsmin10111112816276441693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10111112816276441693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10111112816276441693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 16:09:54] [INFO ] Flatten gal took : 30 ms
[2024-05-29 16:09:54] [INFO ] Flatten gal took : 28 ms
[2024-05-29 16:09:54] [INFO ] Time to serialize gal into /tmp/LTL1857796570788452983.gal : 6 ms
[2024-05-29 16:09:54] [INFO ] Time to serialize properties into /tmp/LTL12336622594722203011.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1857796570788452983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14761570475069429576.hoa' '-atoms' '/tmp/LTL12336622594722203011.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12336622594722203011.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14761570475069429576.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 16:10:09] [INFO ] Flatten gal took : 44 ms
[2024-05-29 16:10:09] [INFO ] Flatten gal took : 46 ms
[2024-05-29 16:10:09] [INFO ] Time to serialize gal into /tmp/LTL5372223572465211654.gal : 10 ms
[2024-05-29 16:10:09] [INFO ] Time to serialize properties into /tmp/LTL10194417813217104706.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5372223572465211654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10194417813217104706.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((Catch2_8+Catch2_9)+(Catch2_6+Catch2_7))+((Catch2_12+Catch2_13)+(Catch2_10+Catch2_11)))+(((Catch2_16+Catch2_17)+(Cat...13009
Formula 0 simplified : G(F(!"(((((((((Catch2_8+Catch2_9)+(Catch2_6+Catch2_7))+((Catch2_12+Catch2_13)+(Catch2_10+Catch2_11)))+(((Catch2_16+Catch2_17)+(Catch...12999
Detected timeout of ITS tools.
[2024-05-29 16:10:24] [INFO ] Flatten gal took : 50 ms
[2024-05-29 16:10:24] [INFO ] Applying decomposition
[2024-05-29 16:10:24] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6625869711862516032.txt' '-o' '/tmp/graph6625869711862516032.bin' '-w' '/tmp/graph6625869711862516032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6625869711862516032.bin' '-l' '-1' '-v' '-w' '/tmp/graph6625869711862516032.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:10:25] [INFO ] Decomposing Gal with order
[2024-05-29 16:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:10:26] [INFO ] Removed a total of 594 redundant transitions.
[2024-05-29 16:10:26] [INFO ] Flatten gal took : 659 ms
[2024-05-29 16:10:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 16:10:26] [INFO ] Time to serialize gal into /tmp/LTL16048253832336829430.gal : 12 ms
[2024-05-29 16:10:26] [INFO ] Time to serialize properties into /tmp/LTL11847420118321170127.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16048253832336829430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11847420118321170127.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((gu199.Catch2_8+gu199.Catch2_9)+(gu199.Catch2_6+gu199.Catch2_7))+((gu199.Catch2_12+gu199.Catch2_13)+(gu199.Catch2_10...19809
Formula 0 simplified : G(F(!"(((((((((gu199.Catch2_8+gu199.Catch2_9)+(gu199.Catch2_6+gu199.Catch2_7))+((gu199.Catch2_12+gu199.Catch2_13)+(gu199.Catch2_10+g...19799
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12389571459500357985
[2024-05-29 16:10:41] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12389571459500357985
Running compilation step : cd /tmp/ltsmin12389571459500357985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12389571459500357985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12389571459500357985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-000200-LTLCardinality-02 finished in 138898 ms.
[2024-05-29 16:10:44] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15094429271811637755
[2024-05-29 16:10:44] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 16:10:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:10:44] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 16:10:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:10:44] [INFO ] Applying decomposition
[2024-05-29 16:10:44] [INFO ] Flatten gal took : 33 ms
[2024-05-29 16:10:44] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 16:10:44] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:10:44] [INFO ] Built C files in 308ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15094429271811637755
Running compilation step : cd /tmp/ltsmin15094429271811637755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15998201246198698675.txt' '-o' '/tmp/graph15998201246198698675.bin' '-w' '/tmp/graph15998201246198698675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15998201246198698675.bin' '-l' '-1' '-v' '-w' '/tmp/graph15998201246198698675.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:10:45] [INFO ] Decomposing Gal with order
[2024-05-29 16:10:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:10:46] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 16:10:46] [INFO ] Flatten gal took : 971 ms
[2024-05-29 16:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-29 16:10:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality17514851263789535637.gal : 20 ms
[2024-05-29 16:10:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality5660396404163430606.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17514851263789535637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5660396404163430606.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F((G("(((((((((gu0.Fork_3+gu0.Fork_2)+(gu0.Fork_5+gu0.Fork_4))+((gu0.Fork_1+gu0.Fork_18)+(gu0.Fork_19+gu0.Fork_20)))+(((gu0.Fork_...9538
Formula 0 simplified : G(F!"(((((((((gu0.Fork_3+gu0.Fork_2)+(gu0.Fork_5+gu0.Fork_4))+((gu0.Fork_1+gu0.Fork_18)+(gu0.Fork_19+gu0.Fork_20)))+(((gu0.Fork_21+g...9529
Compilation finished in 4883 ms.
Running link step : cd /tmp/ltsmin15094429271811637755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin15094429271811637755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.274: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.281: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.284: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.284: Initializing POR dependencies: labels 1005, guards 1000
pins2lts-mc-linux64( 1/ 8), 0.339: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.417: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.437: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.462: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.483: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 46.016: LTL layer: formula: [](<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 7/ 8), 46.016: "[](<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 46.018: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 47.110: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 47.149: There are 1006 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 47.149: State length is 1001, there are 1011 groups
pins2lts-mc-linux64( 0/ 8), 47.149: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 47.149: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 47.149: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 47.149: Visible groups: 0 / 1011, labels: 3 / 1006
pins2lts-mc-linux64( 0/ 8), 47.149: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 47.149: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 52.329: [Blue] ~120 levels ~960 states ~290184 transitions
pins2lts-mc-linux64( 0/ 8), 55.083: [Blue] ~240 levels ~1920 states ~517096 transitions
pins2lts-mc-linux64( 0/ 8), 59.356: [Blue] ~480 levels ~3840 states ~946728 transitions
pins2lts-mc-linux64( 0/ 8), 67.208: [Blue] ~960 levels ~7680 states ~1753968 transitions
pins2lts-mc-linux64( 2/ 8), 81.503: [Blue] ~1920 levels ~15360 states ~3230552 transitions
pins2lts-mc-linux64( 2/ 8), 103.440: [Blue] ~3840 levels ~30720 states ~5608344 transitions
pins2lts-mc-linux64( 2/ 8), 145.388: [Blue] ~7680 levels ~61440 states ~10195912 transitions
pins2lts-mc-linux64( 5/ 8), 225.847: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 230.797:
pins2lts-mc-linux64( 0/ 8), 230.797: Explored 94468 states 17877860 transitions, fanout: 189.248
pins2lts-mc-linux64( 0/ 8), 230.797: Total exploration time 183.630 sec (179.060 sec minimum, 181.440 sec on average)
pins2lts-mc-linux64( 0/ 8), 230.797: States per second: 514, Transitions per second: 97358
pins2lts-mc-linux64( 0/ 8), 230.797:
pins2lts-mc-linux64( 0/ 8), 230.797: State space has 17353951 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 230.797: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 230.797: blue states: 94468 (0.54%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 230.797: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 230.797: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 230.797:
pins2lts-mc-linux64( 0/ 8), 230.797: Total memory used for local state coloring: 1.4MB
pins2lts-mc-linux64( 0/ 8), 230.798:
pins2lts-mc-linux64( 0/ 8), 230.798: Queue width: 8B, total height: 94468, memory: 0.72MB
pins2lts-mc-linux64( 0/ 8), 230.798: Tree memory: 388.4MB, 23.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 230.798: Tree fill ratio (roots/leafs): 12.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 230.798: Stored 1049 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 230.798: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 230.798: Est. total memory use: 389.1MB (~1024.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15094429271811637755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15094429271811637755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 16:33:29] [INFO ] Applying decomposition
[2024-05-29 16:33:29] [INFO ] Flatten gal took : 37 ms
[2024-05-29 16:33:29] [INFO ] Decomposing Gal with order
[2024-05-29 16:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:33:29] [INFO ] Removed a total of 400 redundant transitions.
[2024-05-29 16:33:29] [INFO ] Flatten gal took : 74 ms
[2024-05-29 16:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 16:33:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality13220419890061418752.gal : 23 ms
[2024-05-29 16:33:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4252446099067001264.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13220419890061418752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4252446099067001264.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F((G("(((((((((gu3.Fork_3+gu2.Fork_2)+(gu5.Fork_5+gu4.Fork_4))+((gu1.Fork_1+gu18.Fork_18)+(gu19.Fork_19+gu20.Fork_20)))+(((gu21.F...10414
Formula 0 simplified : G(F!"(((((((((gu3.Fork_3+gu2.Fork_2)+(gu5.Fork_5+gu4.Fork_4))+((gu1.Fork_1+gu18.Fork_18)+(gu19.Fork_19+gu20.Fork_20)))+(((gu21.Fork_...10405
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 16:56:12] [INFO ] Flatten gal took : 43 ms
[2024-05-29 16:56:12] [INFO ] Input system was already deterministic with 1000 transitions.
[2024-05-29 16:56:12] [INFO ] Transformed 1000 places.
[2024-05-29 16:56:12] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 16:56:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality2165452947160024610.gal : 5 ms
[2024-05-29 16:56:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality16067236972471621163.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2165452947160024610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16067236972471621163.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((G("(((((((((Fork_3+Fork_2)+(Fork_5+Fork_4))+((Fork_1+Fork_18)+(Fork_19+Fork_20)))+(((Fork_21+Fork_14)+(Fork_15+Fork_16))+((For...7138
Formula 0 simplified : G(F!"(((((((((Fork_3+Fork_2)+(Fork_5+Fork_4))+((Fork_1+Fork_18)+(Fork_19+Fork_20)))+(((Fork_21+Fork_14)+(Fork_15+Fork_16))+((Fork_17...7129
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12055476 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15988600 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-000200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-PT-000200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422500327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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