Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253400130.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Philosophers-PT-000050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253400130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 465K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 304K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 681K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 598K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 109K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-00
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-01
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-02
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-03
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-04
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-05
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-06
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-07
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-08
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-09
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-10
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-11
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-12
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-13
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-14
FORMULA_NAME Philosophers-PT-000050-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748866190339

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 12:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:09:51] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-06-02 12:09:51] [INFO ] Transformed 250 places.
[2025-06-02 12:09:51] [INFO ] Transformed 250 transitions.
[2025-06-02 12:09:51] [INFO ] Found NUPN structural information;
[2025-06-02 12:09:51] [INFO ] Parsed PT model containing 250 places and 250 transitions and 800 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2025-06-02 12:09:52] [INFO ] Computed 100 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:52] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-02 12:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:52] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9961 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12986 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23006ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 23025ms
Finished structural reductions in LTL mode , in 1 iterations and 23712 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2025-06-02 12:10:15] [INFO ] Flatten gal took : 61 ms
[2025-06-02 12:10:16] [INFO ] Flatten gal took : 42 ms
[2025-06-02 12:10:16] [INFO ] Input system was already deterministic with 250 transitions.
Reduction of identical properties reduced properties to check from 70 to 65
RANDOM walk for 40000 steps (13 resets) in 1139 ms. (35 steps per ms) remains 1/65 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1117 ms. (35 steps per ms) remains 1/1 properties
[2025-06-02 12:10:17] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 150/500 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Domain max(s): 0/250 constraints, Positive P Invariants (semi-flows): 0/100 constraints, State Equation: 0/250 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-02 12:10:17] [INFO ] Flatten gal took : 24 ms
[2025-06-02 12:10:17] [INFO ] Flatten gal took : 34 ms
[2025-06-02 12:10:17] [INFO ] Input system was already deterministic with 250 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:10:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 12:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:10:18] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9098 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13103 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22225ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 22227ms
Finished structural reductions in LTL mode , in 1 iterations and 22520 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:10:40] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:10:40] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:10:40] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:10:40] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:10:40] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2706579206267997915.gal : 5 ms
[2025-06-02 12:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15381735134285498270.ctl : 18 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2706579206267997915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15381735134285498270.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.076017,5744,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: A(E(((((((((Fork_28==1)&&(Think_28==1))||((Fork_42==1)&&(Think_42==1)))||(((Fork_23==1)&&(Think_23==1))||((Fork_13==1)&&(Think_13==1))))|...23617
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EG(!(!((!(EG(!(((((((((Fork_28==1)&&(Think_28==1))||((Fork_42==1)&&(Think_42==1)))||(((Fork...74369
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/5697/250
Hit Full ! (commute/partial/dont) 0/5697/250
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 100/0/150
Hit Full ! (commute/partial/dont) 0/0/250
(forward)formula 0,0,23.9082,717112,1,0,106,3.63923e+06,52,69,8755,5.26996e+06,87
FORMULA Philosophers-PT-000050-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:11:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:04] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 12:11:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:04] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:11:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9086 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12411 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21519ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21520ms
Finished structural reductions in LTL mode , in 1 iterations and 21829 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:11:26] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:11:26] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:11:26] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:11:26] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:11:26] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:11:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2740963572015938641.gal : 3 ms
[2025-06-02 12:11:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5512457437808995239.ctl : 4 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2740963572015938641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5512457437808995239.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.066473,5788,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: AX((E((EG(AG(((((((((Fork_47==1)&&(Think_48==1))||((Fork_5==1)&&(Think_6==1)))||(((Fork_8==1)&&(Think_9==1))||((Fork_39==1)&&(Think_40==1...20321
=> equivalent forward existential formula: ([(EY(Init) * !(E((EG(!(E(TRUE U !(((((((((Fork_47==1)&&(Think_48==1))||((Fork_5==1)&&(Think_6==1)))||(((Fork_8=...193284
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/250
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 100/0/150
Hit Full ! (commute/partial/dont) 100/7350/150
Using saturation style SCC detection
(forward)formula 0,1,12.6771,276728,1,0,197,1.57686e+06,76,129,8876,1.49521e+06,148
FORMULA Philosophers-PT-000050-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:39] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 12:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:11:39] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9061 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12759 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21837ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21837ms
Finished structural reductions in LTL mode , in 1 iterations and 22192 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:12:01] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:12:01] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:12:01] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:12:01] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:12:01] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4523310686853513337.gal : 2 ms
[2025-06-02 12:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2032280536874070206.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4523310686853513337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2032280536874070206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.063766,5796,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: EG(((A(((EG((((((((Eat_2==1)||(Eat_4==1))||((Eat_6==1)||(Eat_8==1)))||(((Eat_10==1)||(Eat_12==1))||((Eat_15==1)||(Eat_17==1))))||((((Eat_...15563
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(EG(!(!(EX(!(((((((((Fork_15==1)&&(Catch1_15==1))||((Fork_9==1)&&(Catch1_9==1)))||(((Fork_2...19085
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 12:12:31] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:12:31] [INFO ] Applying decomposition
[2025-06-02 12:12:31] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7174087131843288504.txt' '-o' '/tmp/graph7174087131843288504.bin' '-w' '/tmp/graph7174087131843288504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7174087131843288504.bin' '-l' '-1' '-v' '-w' '/tmp/graph7174087131843288504.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:12:31] [INFO ] Decomposing Gal with order
[2025-06-02 12:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:12:32] [INFO ] Removed a total of 50 redundant transitions.
[2025-06-02 12:12:32] [INFO ] Flatten gal took : 109 ms
[2025-06-02 12:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 29 ms.
[2025-06-02 12:12:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16554488587794920188.gal : 8 ms
[2025-06-02 12:12:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7127147256894248189.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16554488587794920188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7127147256894248189.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.056007,6160,215,37,1703,258,365,1320,65,400,0


Converting to forward existential form...Done !
original formula: EG(((A(((EG((((((((i8.u24.Eat_2==1)||(i0.i1.u26.Eat_4==1))||((i0.i0.u2.Eat_6==1)||(i12.i1.u46.Eat_8==1)))||(((i12.i0.u28.Eat_10==1)||(i1....24502
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(EG(!(!(EX(!(((((((((i1.i1.u31.Fork_15==1)&&(i1.i1.u31.Catch1_15==1))||((i12.i0.u28.Fork_9=...29904
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:13:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 12:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:13:02] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9333 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12885 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22233ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 22234ms
Finished structural reductions in LTL mode , in 1 iterations and 22530 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:13:24] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:13:24] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:13:24] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:13:24] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:13:24] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:13:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17152616564134316185.gal : 2 ms
[2025-06-02 12:13:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8087675135906793535.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17152616564134316185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8087675135906793535.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.061954,5784,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: !(E((!(EX(!(((((((((Fork_15==1)&&(Catch1_15==1))||((Fork_9==1)&&(Catch1_9==1)))||(((Fork_20==1)&&(Catch1_20==1))||((Fork_24==1)&&(Catch1_...14056
=> equivalent forward existential formula: (([((FwdU(Init,(!(EX(!(((((((((Fork_15==1)&&(Catch1_15==1))||((Fork_9==1)&&(Catch1_9==1)))||(((Fork_20==1)&&(Cat...24130
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/250
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 0/5619/250
Detected timeout of ITS tools.
[2025-06-02 12:13:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:13:55] [INFO ] Applying decomposition
[2025-06-02 12:13:55] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6832277264756861386.txt' '-o' '/tmp/graph6832277264756861386.bin' '-w' '/tmp/graph6832277264756861386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6832277264756861386.bin' '-l' '-1' '-v' '-w' '/tmp/graph6832277264756861386.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:13:55] [INFO ] Decomposing Gal with order
[2025-06-02 12:13:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:13:55] [INFO ] Removed a total of 50 redundant transitions.
[2025-06-02 12:13:55] [INFO ] Flatten gal took : 21 ms
[2025-06-02 12:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 6 ms.
[2025-06-02 12:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9513096989511299081.gal : 4 ms
[2025-06-02 12:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14665083064483838539.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9513096989511299081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14665083064483838539.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.044356,6080,200,29,1480,203,353,1116,61,306,0


Converting to forward existential form...Done !
original formula: !(E((!(EX(!(((((((((i1.i1.u6.Fork_15==1)&&(i1.i0.u5.Catch1_15==1))||((i11.i0.u3.Fork_9==1)&&(i11.i0.u3.Catch1_9==1)))||(((i2.i1.u33.Fork_...21756
=> equivalent forward existential formula: (([((FwdU(Init,(!(EX(!(((((((((i1.i1.u6.Fork_15==1)&&(i1.i0.u5.Catch1_15==1))||((i11.i0.u3.Fork_9==1)&&(i11.i0.u...37266
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,21.9903,371520,1,0,681618,452,2573,1.23172e+06,256,1354,330908
FORMULA Philosophers-PT-000050-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 12:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:17] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9365 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12921 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22300ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 22301ms
Finished structural reductions in LTL mode , in 1 iterations and 22671 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:14:40] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:14:40] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:14:40] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:14:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:14:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:14:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7794699340110405334.gal : 2 ms
[2025-06-02 12:14:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15363570204535741870.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7794699340110405334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15363570204535741870.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.067633,5804,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: ((EX(EX(EG(((((((((Fork_47==1)&&(Think_48==1))||((Fork_5==1)&&(Think_6==1)))||(((Fork_8==1)&&(Think_9==1))||((Fork_39==1)&&(Think_40==1))...9037
=> equivalent forward existential formula: [(EY((Init * (EX(EX(EG(((((((((Fork_47==1)&&(Think_48==1))||((Fork_5==1)&&(Think_6==1)))||(((Fork_8==1)&&(Think_...9088
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.14392,39616,1,0,15,223397,24,6,7051,65058,13
FORMULA Philosophers-PT-000050-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:41] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 12:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:14:41] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9097 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12634 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21744ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21745ms
Finished structural reductions in LTL mode , in 1 iterations and 22082 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:15:03] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:15:03] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:03] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:15:03] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:15:03] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9838303874234292196.gal : 1 ms
[2025-06-02 12:15:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17037275727454446399.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9838303874234292196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17037275727454446399.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.067738,5712,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: AX((AF(AG((((((((((Fork_15==0)||(Catch1_15==0))&&((Fork_9==0)||(Catch1_9==0)))&&(((Fork_20==0)||(Catch1_20==0))&&((Fork_24==0)||(Catch1_2...4977
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!(E(TRUE U !((((((((((Fork_15==0)||(Catch1_15==0))&&((Fork_9==0)||(Catch1_9==0)))&&(((Fork_20=...5060
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.88119,62576,1,0,61,340164,22,104,7054,298546,112
FORMULA Philosophers-PT-000050-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 23 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:05] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 12:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:05] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:15:05] [INFO ] Redundant transitions in 10 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-02 12:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9095 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12309 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21418ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21418ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21824 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:15:27] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:15:27] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:15:27] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:15:27] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:27] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17856121959707021541.gal : 2 ms
[2025-06-02 12:15:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8365611637025485603.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17856121959707021541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8365611637025485603.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.069032,5788,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: EG(((((((((Fork_28==1)&&(Think_28==1))||((Fork_42==1)&&(Think_42==1)))||(((Fork_23==1)&&(Think_23==1))||((Fork_13==1)&&(Think_13==1))))||...1650
=> equivalent forward existential formula: [FwdG(Init,((((((((Fork_28==1)&&(Think_28==1))||((Fork_42==1)&&(Think_42==1)))||(((Fork_23==1)&&(Think_23==1))||...1693
Hit Full ! (commute/partial/dont) 0/0/250
(forward)formula 0,1,2.0276,70636,1,0,8,369218,19,3,6357,296603,8
FORMULA Philosophers-PT-000050-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 12:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:29] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:15:29] [INFO ] Redundant transitions in 3 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-02 12:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9324 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12386 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21724ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21725ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22138 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:15:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:15:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:51] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:15:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:15:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15327825998478613409.gal : 2 ms
[2025-06-02 12:15:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15012882899665478144.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15327825998478613409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15012882899665478144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.06338,5788,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: AF(AG(((((((((Fork_49==1)&&(Catch2_50==1))||((Fork_8==1)&&(Catch2_9==1)))||(((Fork_21==1)&&(Catch2_22==1))||((Fork_29==1)&&(Catch2_30==1)...1704
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((Fork_49==1)&&(Catch2_50==1))||((Fork_8==1)&&(Catch2_9==1)))||(((Fork_21==1)&&(...1761
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.704864,28748,1,0,8,169859,19,5,6949,16455,10
FORMULA Philosophers-PT-000050-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 209 transition count 209
Applied a total of 82 rules in 34 ms. Remains 209 /250 variables (removed 41) and now considering 209/250 (removed 41) transitions.
// Phase 1: matrix 209 rows 209 cols
[2025-06-02 12:15:52] [INFO ] Computed 100 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:52] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 12:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:15:52] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-02 12:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 50/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 50/209 variables, 50/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 50/309 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 209/418 variables, 209/518 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 518 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5284 ms.
Refiners :[Domain max(s): 209/209 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 50/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 50/209 variables, 50/259 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 50/309 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 209/418 variables, 209/518 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 109/627 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/418 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 627 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5956 ms.
Refiners :[Domain max(s): 209/209 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11252ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 11253ms
Starting structural reductions in SI_CTL mode, iteration 1 : 209/250 places, 209/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11693 ms. Remains : 209/250 places, 209/250 transitions.
[2025-06-02 12:16:03] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:16:03] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:16:03] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-02 12:16:03] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:16:03] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:16:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4511383241585823949.gal : 2 ms
[2025-06-02 12:16:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14312154473542593717.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4511383241585823949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14312154473542593717.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.994e+21,0.047797,5568,2,880,5,3728,6,0,1048,2631,0


Converting to forward existential form...Done !
original formula: AG((EF(((((Fork_24==1)&&(Catch1_24==1))&&((Fork_36==1)&&(Think_37==1)))||(Eat_4==0))) + ((EG(((Fork_43==1)&&(Think_43==1))) * (Fork_40==1...177
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((EG(((Fork_43==1)&&(Think_43==1))) * (Fork_40==1)) * (Catch2_41==1)))) * !(E(TRUE U ((((...240
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.316002,17540,1,0,7,98272,14,1,4987,7351,5
FORMULA Philosophers-PT-000050-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 214 transition count 214
Applied a total of 72 rules in 25 ms. Remains 214 /250 variables (removed 36) and now considering 214/250 (removed 36) transitions.
// Phase 1: matrix 214 rows 214 cols
[2025-06-02 12:16:04] [INFO ] Computed 100 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:16:04] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 12:16:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:16:04] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:16:04] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2025-06-02 12:16:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 50/214 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 50/214 variables, 50/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 50/314 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 214/428 variables, 214/528 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 528 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5705 ms.
Refiners :[Domain max(s): 214/214 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 50/214 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 50/214 variables, 50/264 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 50/314 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 214/428 variables, 214/528 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 114/642 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/428 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 642 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6271 ms.
Refiners :[Domain max(s): 214/214 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11988ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11988ms
Starting structural reductions in SI_CTL mode, iteration 1 : 214/250 places, 214/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12424 ms. Remains : 214/250 places, 214/250 transitions.
[2025-06-02 12:16:16] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:16:16] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:16:16] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-02 12:16:16] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:16:16] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:16:16] [INFO ] Time to serialize gal into /tmp/CTLFireability147757338918687893.gal : 1 ms
[2025-06-02 12:16:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9036843676897557570.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability147757338918687893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9036843676897557570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.2922e+21,0.057123,5548,2,930,5,3876,6,0,1073,2733,0


Converting to forward existential form...Done !
original formula: (!(A(((Eat_23==1)||((Fork_36==1)&&(Think_36==1))) U A(((!((Fork_30==1)&&(Think_30==1)))||((Fork_3==1)&&(Catch2_4==1))) U AF(((Fork_44==1)...263
=> equivalent forward existential formula: ((([FwdG((FwdU((FwdU(Init,!(!((E(!(!(EG(!(((Fork_44==1)&&(Think_44==1)))))) U (!(((!((Fork_30==1)&&(Think_30==1)...1196
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 207/0/7
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 200/39/14
(forward)formula 0,1,22.2118,620372,1,0,570,2.98514e+06,53,456,5979,4.99638e+06,470
FORMULA Philosophers-PT-000050-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2025-06-02 12:16:39] [INFO ] Computed 100 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:16:39] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-02 12:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:16:39] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9391 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12332 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21742ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21745ms
Finished structural reductions in LTL mode , in 1 iterations and 22228 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:17:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:17:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:17:01] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:17:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:17:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:17:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11729268607403792430.gal : 2 ms
[2025-06-02 12:17:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4351274106074599940.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11729268607403792430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4351274106074599940.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.070673,5784,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: (AF(AX(((((Fork_40==1)&&(Think_41==1)) + A(((Fork_4==1)&&(Catch2_5==1)) U (Eat_35==1))) * (((A(((Fork_1==1)&&(Think_1==1)) U (Eat_39==1))...376
=> equivalent forward existential formula: [FwdG((Init * !(EG(((Eat_42==1)||(((Fork_41==0)||(Catch2_42==0))&&((Fork_31==0)||(Catch1_31==0))))))),!(!(EX(!((...583
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/15
Hit Full ! (commute/partial/dont) 247/0/3
Hit Full ! (commute/partial/dont) 247/0/3
Hit Full ! (commute/partial/dont) 247/0/3
Hit Full ! (commute/partial/dont) 247/0/3
Hit Full ! (commute/partial/dont) 247/0/3
Hit Full ! (commute/partial/dont) 247/0/3
(forward)formula 0,1,1.38322,48900,1,0,34,288293,65,21,6854,138612,34
FORMULA Philosophers-PT-000050-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:02] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 12:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:03] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9366 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12638 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22024ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 22024ms
Finished structural reductions in LTL mode , in 1 iterations and 22483 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:17:25] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:17:25] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:17:25] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:17:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:17:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16170287167748341170.gal : 1 ms
[2025-06-02 12:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14928570180754090929.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16170287167748341170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14928570180754090929.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.065834,5792,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: A((!(((Fork_28==1)&&(Catch2_29==1))) * EF((((Fork_12==1)&&(Catch2_13==1)) + AX(((Fork_28==1)&&(Catch1_28==1)))))) U E(!((!(((Fork_19==1)&...317
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(((Fork_19==1)&&(Think_20==1))) * !(((!(E(TRUE U !(((Fork_4==1)&&(Catch1_4==1))))) + ((Fo...824
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 12:17:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:17:55] [INFO ] Applying decomposition
[2025-06-02 12:17:55] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11625040110817365577.txt' '-o' '/tmp/graph11625040110817365577.bin' '-w' '/tmp/graph11625040110817365577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11625040110817365577.bin' '-l' '-1' '-v' '-w' '/tmp/graph11625040110817365577.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:17:55] [INFO ] Decomposing Gal with order
[2025-06-02 12:17:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:17:55] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-02 12:17:55] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:17:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 4 ms.
[2025-06-02 12:17:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1863649605167398085.gal : 3 ms
[2025-06-02 12:17:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11483270191613993994.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1863649605167398085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11483270191613993994.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.047809,6184,308,53,2306,280,399,1683,87,425,0


Converting to forward existential form...Done !
original formula: A((!(((i13.i1.u28.Fork_28==1)&&(i13.i1.u28.Catch2_29==1))) * EF((((i2.i0.u4.Fork_12==1)&&(i9.u20.Catch2_13==1)) + AX(((i13.i1.u28.Fork_28...459
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((!(((i5.u5.Fork_19==1)&&(i5.u25.Think_20==1))) * !(((!(E(TRUE U !(((i0.i1.u42.Fork_4==1)&&(...1130
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:25] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 12:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:25] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8989 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12021 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21045ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21045ms
Finished structural reductions in LTL mode , in 1 iterations and 21540 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:18:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:18:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:18:47] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:18:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:18:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:18:47] [INFO ] Time to serialize gal into /tmp/CTLFireability4108024495029501658.gal : 2 ms
[2025-06-02 12:18:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6944915854490678690.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4108024495029501658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6944915854490678690.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.069286,5792,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: EF(!(A((AF(((Fork_42==1)&&(Catch1_42==1))) * (EG(((Fork_28==1)&&(Think_29==1))) + !(((Fork_48==1)&&(Catch1_48==1))))) U ((AF(((Fork_25==1...292
=> equivalent forward existential formula: ((([FwdG((FwdU(FwdU(Init,TRUE),!(((!(EG(!(((Fork_25==1)&&(Think_26==1))))) * EX(((Fork_16==1)&&(Think_17==1)))) ...1684
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/0/7
Hit Full ! (commute/partial/dont) 243/0/7
Hit Full ! (commute/partial/dont) 243/0/7
(forward)formula 0,1,1.14479,42276,1,0,36,259834,52,22,6812,105689,30
FORMULA Philosophers-PT-000050-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:18:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:48] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 12:18:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:48] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:18:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8893 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12408 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21325ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21325ms
Finished structural reductions in LTL mode , in 1 iterations and 21798 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:19:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:10] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:19:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:10] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11053964216522970972.gal : 2 ms
[2025-06-02 12:19:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7265500569256215426.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11053964216522970972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7265500569256215426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.065722,5788,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: E(((!((A((AG(((Fork_14==1)&&(Think_15==1))) + ((Fork_21==1)&&(Think_22==1))) U ((Fork_2==1)&&(Catch2_3==1))) + ((Fork_16==1)&&(Catch2_17=...530
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((!((!((E(!(((Fork_2==1)&&(Catch2_3==1))) U (!((!(E(TRUE U !(((Fork_14==1)&&(Think_15==1))))) +...899
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 243/6/7
Hit Full ! (commute/partial/dont) 243/0/7
Hit Full ! (commute/partial/dont) 243/0/7
Hit Full ! (commute/partial/dont) 243/5/7
(forward)formula 0,1,1.44571,54084,1,0,46,315111,68,28,7351,169515,46
FORMULA Philosophers-PT-000050-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:11] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 12:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:12] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:19:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9158 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12680 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21852ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21854ms
Finished structural reductions in LTL mode , in 1 iterations and 22340 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:19:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:19:33] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:33] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:19:33] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:33] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6608710524644596278.gal : 1 ms
[2025-06-02 12:19:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1639861453704621828.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6608710524644596278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1639861453704621828.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.077475,5796,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: EG(((A(!(((Fork_24==1)&&(Catch2_25==1))) U EG(AG(((Fork_7==1)&&(Think_7==1))))) + AX((A(((Fork_44==1)&&(Think_45==1)) U (Eat_24==1)) + ((...284
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(EG(!(E(TRUE U !(((Fork_7==1)&&(Think_7==1))))))) U (!(!(((Fork_24==1)&&(Catch2_25==1)))) * !...519
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 247/0/3
Hit Full ! (commute/partial/dont) 247/0/3
(forward)formula 0,1,4.04805,127372,1,0,122,600282,43,115,6509,924893,127
FORMULA Philosophers-PT-000050-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 12:19:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 12:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:38] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-02 12:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/500 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 600 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9078 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 50/250 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 250/500 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 150/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 750 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12515 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21617ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21617ms
Finished structural reductions in LTL mode , in 1 iterations and 22072 ms. Remains : 250/250 places, 250/250 transitions.
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:20:00] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17165767135235144602.gal : 2 ms
[2025-06-02 12:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3504531724330735353.ctl : 0 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17165767135235144602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3504531724330735353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.068721,5792,2,1312,5,5619,6,0,1253,4190,0


Converting to forward existential form...Done !
original formula: AF((EX(((((((AG(((Fork_17==1)&&(Catch1_17==1))) * (Fork_17==1)) * ((Think_17==1)&&(Fork_14==1))) * (Catch2_15==1)) + EG(((Fork_47==1)&&(T...220
=> equivalent forward existential formula: [FwdG(Init,!((EX(((((((!(E(TRUE U !(((Fork_17==1)&&(Catch1_17==1))))) * (Fork_17==1)) * ((Think_17==1)&&(Fork_14...277
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.698566,29432,1,0,21,187500,34,8,6321,34814,16
FORMULA Philosophers-PT-000050-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2025-06-02 12:20:00] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:20:00] [INFO ] Applying decomposition
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10322156035832217171.txt' '-o' '/tmp/graph10322156035832217171.bin' '-w' '/tmp/graph10322156035832217171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10322156035832217171.bin' '-l' '-1' '-v' '-w' '/tmp/graph10322156035832217171.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:20:00] [INFO ] Decomposing Gal with order
[2025-06-02 12:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:20:00] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-02 12:20:00] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:20:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 4 ms.
[2025-06-02 12:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10231771361739604074.gal : 3 ms
[2025-06-02 12:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9807546051538204112.ctl : 4 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10231771361739604074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9807546051538204112.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.047717,6216,272,51,2354,263,391,1651,83,388,0


Converting to forward existential form...Done !
original formula: EG(((A(((EG((((((((i7.i0.u18.Eat_2==1)||(i0.i0.u0.Eat_4==1))||((i0.i1.u20.Eat_6==1)||(i0.i1.u2.Eat_8==1)))||(((i9.u3.Eat_10==1)||(i1.i1.u...24447
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(EG(!(!(EX(!(((((((((i1.i0.u5.Fork_15==1)&&(i1.i0.u5.Catch1_15==1))||((i9.u22.Fork_9==1)&&(...29839
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 12:43:24] [INFO ] Applying decomposition
[2025-06-02 12:43:24] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:43:24] [INFO ] Decomposing Gal with order
[2025-06-02 12:43:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:43:24] [INFO ] Removed a total of 100 redundant transitions.
[2025-06-02 12:43:24] [INFO ] Flatten gal took : 30 ms
[2025-06-02 12:43:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:43:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15664840199376790399.gal : 3 ms
[2025-06-02 12:43:24] [INFO ] Time to serialize properties into /tmp/CTLFireability258546471419763884.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15664840199376790399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability258546471419763884.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.103326,8036,1631,20,7016,337,719,3318,30,247,0


Converting to forward existential form...Done !
original formula: EG(((A(((EG((((((((u1.Eat_2==1)||(u3.Eat_4==1))||((u5.Eat_6==1)||(u7.Eat_8==1)))||(((u9.Eat_10==1)||(u11.Eat_12==1))||((u15.Eat_15==1)||(...19229
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(EG(!(!(EX(!(((((((((u15.Fork_15==1)&&(u14.Catch1_15==1))||((u9.Fork_9==1)&&(u8.Catch1_9==1...23515
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Detected timeout of ITS tools.
[2025-06-02 13:06:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:06:47] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 13:06:47] [INFO ] Transformed 250 places.
[2025-06-02 13:06:47] [INFO ] Transformed 250 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
[2025-06-02 13:06:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2250904598402171917.gal : 1 ms
[2025-06-02 13:06:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6353535418523248046.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2250904598402171917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6353535418523248046.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17898e+23,0.064297,5788,2,1280,5,6324,6,0,1253,4366,0


Converting to forward existential form...Done !
original formula: EG(((A(((EG((((((((Eat_2==1)||(Eat_4==1))||((Eat_6==1)||(Eat_8==1)))||(((Eat_10==1)||(Eat_12==1))||((Eat_15==1)||(Eat_17==1))))||((((Eat_...15563
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(EG(!(!(EX(!(((((((((Fork_15==1)&&(Catch1_15==1))||((Fork_9==1)&&(Catch1_9==1)))||(((Fork_2...19085
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-000050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253400130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;