Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.4K Apr 13 10:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 13 10:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 13 09:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 13 09:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 10:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 10:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-00
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-01
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-02
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-03
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-04
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-05
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-06
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-07
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-08
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-09
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-10
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-11
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-12
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-13
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-14
FORMULA_NAME Philosophers-COL-000100-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716854280061

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-27 23:58:02] [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]
[2024-05-27 23:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:58:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 23:58:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:58:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1222 ms
[2024-05-27 23:58:04] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
[2024-05-27 23:58:04] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-05-27 23:58:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 34007 steps (331 resets) in 186 ms. (181 steps per ms) remains 0/4 properties
[2024-05-27 23:58:04] [INFO ] Flatten gal took : 28 ms
[2024-05-27 23:58:04] [INFO ] Flatten gal took : 5 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100) 100) 100)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 23:58:04] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 93 ms.
[2024-05-27 23:58:04] [INFO ] Unfolded 16 HLPN properties in 4 ms.
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2024-05-27 23:58:05] [INFO ] Computed 200 invariants in 30 ms
[2024-05-27 23:58:05] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-27 23:58:05] [INFO ] Invariant cache hit.
[2024-05-27 23:58:06] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-27 23:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Finished structural reductions in LTL mode , in 1 iterations and 61853 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2024-05-27 23:59:07] [INFO ] Flatten gal took : 127 ms
[2024-05-27 23:59:07] [INFO ] Flatten gal took : 105 ms
[2024-05-27 23:59:08] [INFO ] Input system was already deterministic with 500 transitions.
Reduction of identical properties reduced properties to check from 20 to 16
RANDOM walk for 3916 steps (0 resets) in 911 ms. (4 steps per ms) remains 0/16 properties
[2024-05-27 23:59:08] [INFO ] Flatten gal took : 52 ms
[2024-05-27 23:59:09] [INFO ] Flatten gal took : 82 ms
[2024-05-27 23:59:09] [INFO ] Input system was already deterministic with 500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-27 23:59:09] [INFO ] Invariant cache hit.
[2024-05-27 23:59:10] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-27 23:59:10] [INFO ] Invariant cache hit.
[2024-05-27 23:59:10] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-27 23:59:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:00:10] [INFO ] Flatten gal took : 46 ms
[2024-05-28 00:00:10] [INFO ] Flatten gal took : 50 ms
[2024-05-28 00:00:10] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:00:10] [INFO ] Flatten gal took : 41 ms
[2024-05-28 00:00:10] [INFO ] Flatten gal took : 40 ms
[2024-05-28 00:00:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5934283162314260876.gal : 18 ms
[2024-05-28 00:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2180647641049487453.ctl : 13 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5934283162314260876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2180647641049487453.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.451177,7728,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AX((AF(AX(((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat...12666
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!(EG(!(!(EX(!(((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(...15739
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 200/29700/300
Hit Full ! (commute/partial/dont) 200/29700/300
(forward)formula 0,1,23.2788,549856,1,0,18,3.1327e+06,40,11,15923,2.62826e+06,18
FORMULA Philosophers-COL-000100-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:00:34] [INFO ] Invariant cache hit.
[2024-05-28 00:00:34] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-28 00:00:34] [INFO ] Invariant cache hit.
[2024-05-28 00:00:35] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26152 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 56288ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 56295ms
Finished structural reductions in LTL mode , in 1 iterations and 57172 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:01:31] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:01:31] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:01:31] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:01:31] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:01:31] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:01:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6537195850592822542.gal : 6 ms
[2024-05-28 00:01:31] [INFO ] Time to serialize properties into /tmp/CTLFireability260220462781714643.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6537195850592822542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability260220462781714643.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.263814,7796,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EF(EG((((((((A((((((((((Think_17>=1)&&(Fork_17>=1))||((Think_91>=1)&&(Fork_91>=1)))||(((Think_86>=1)&&(Fork_86>=1))||((Think_96>=1)&&(For...17928
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((((!((E(!((((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)...27745
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/500
Detected timeout of ITS tools.
[2024-05-28 00:02:01] [INFO ] Flatten gal took : 25 ms
[2024-05-28 00:02:01] [INFO ] Applying decomposition
[2024-05-28 00:02:01] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2161875945060463021.txt' '-o' '/tmp/graph2161875945060463021.bin' '-w' '/tmp/graph2161875945060463021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2161875945060463021.bin' '-l' '-1' '-v' '-w' '/tmp/graph2161875945060463021.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:02:02] [INFO ] Decomposing Gal with order
[2024-05-28 00:02:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:02:02] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 00:02:02] [INFO ] Flatten gal took : 120 ms
[2024-05-28 00:02:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 31 ms.
[2024-05-28 00:02:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1500666999234714138.gal : 11 ms
[2024-05-28 00:02:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1636862464733145234.ctl : 12 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1500666999234714138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1636862464733145234.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.15378e+47,0.250174,8268,514,31,4592,241,603,3165,68,369,0


Converting to forward existential form...Done !
original formula: EF(EG((((((((A((((((((((i0.i2.u61.Think_17>=1)&&(i0.i2.u61.Fork_17>=1))||((i18.i1.u96.Think_91>=1)&&(i18.i1.u96.Fork_91>=1)))||(((i17.i0....29326
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((((!((E(!((((((((((i1.i0.u3.Eat_52>=1)||(i16.i0.u30.Eat_48>=1))||((i7.i0.u83.Eat_60>=1...45355
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 51 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:02:32] [INFO ] Invariant cache hit.
[2024-05-28 00:02:33] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-28 00:02:33] [INFO ] Invariant cache hit.
[2024-05-28 00:02:34] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:02:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in LTL mode , in 1 iterations and 61242 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:03:34] [INFO ] Flatten gal took : 19 ms
[2024-05-28 00:03:34] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:03:34] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:03:34] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:03:34] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:03:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17450968112015648216.gal : 5 ms
[2024-05-28 00:03:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7834460390514696134.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17450968112015648216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7834460390514696134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.4183,7824,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AG(AX((((((((EG(((((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||(((Fork_10>=1)&&(Catch2_11>=1))||((Fork_84>=1)&&...16342
=> equivalent forward existential formula: [((((((((EY(FwdU(Init,TRUE)) * !(((((((((Think_4>=1)&&(Fork_4>=1))||((Think_9>=1)&&(Fork_9>=1)))||(((Think_15>=1...16429
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,4.72242,107416,1,0,13,737445,25,5,13500,101722,13
FORMULA Philosophers-COL-000100-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:03:39] [INFO ] Invariant cache hit.
[2024-05-28 00:03:39] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-28 00:03:39] [INFO ] Invariant cache hit.
[2024-05-28 00:03:39] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:03:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
(s381 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in LTL mode , in 1 iterations and 60946 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:04:40] [INFO ] Flatten gal took : 25 ms
[2024-05-28 00:04:40] [INFO ] Flatten gal took : 29 ms
[2024-05-28 00:04:40] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:04:40] [INFO ] Flatten gal took : 28 ms
[2024-05-28 00:04:40] [INFO ] Flatten gal took : 28 ms
[2024-05-28 00:04:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18301605641425853937.gal : 6 ms
[2024-05-28 00:04:40] [INFO ] Time to serialize properties into /tmp/CTLFireability270688561070923201.ctl : 3 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18301605641425853937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability270688561070923201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.432442,7824,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AX(((AX((((((((((Think_1<1)||(Fork_0<1))&&((Think_75<1)||(Fork_74<1)))&&(((Think_6<1)||(Fork_5<1))&&((Think_11<1)||(Fork_10<1))))&&((((Th...7578
=> equivalent forward existential formula: [(EY(((EY(Init) * !((((((((((Think_1<1)||(Fork_0<1))&&((Think_75<1)||(Fork_74<1)))&&(((Think_6<1)||(Fork_5<1))&&...7631
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 200/29700/300
(forward)formula 0,1,22.5322,522032,1,0,14,3.01534e+06,21,7,14006,2.44003e+06,10
FORMULA Philosophers-COL-000100-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:05:02] [INFO ] Invariant cache hit.
[2024-05-28 00:05:03] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-28 00:05:03] [INFO ] Invariant cache hit.
[2024-05-28 00:05:03] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-28 00:05:03] [INFO ] Redundant transitions in 33 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-28 00:05:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60667 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:06:03] [INFO ] Flatten gal took : 19 ms
[2024-05-28 00:06:03] [INFO ] Flatten gal took : 25 ms
[2024-05-28 00:06:03] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:06:03] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:06:03] [INFO ] Flatten gal took : 25 ms
[2024-05-28 00:06:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1428832548046929732.gal : 4 ms
[2024-05-28 00:06:03] [INFO ] Time to serialize properties into /tmp/CTLFireability468496189308904259.ctl : 7 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1428832548046929732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability468496189308904259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.428783,7564,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AG((((((((A(E(((((((((((((((((((Think_17>=1)&&(Fork_17>=1))||((Think_91>=1)&&(Fork_91>=1)))||(((Think_86>=1)&&(Fork_86>=1))||((Think_96>=...36416
=> equivalent forward existential formula: ((([(FwdU((FwdU((((((((FwdU(Init,TRUE) * !(((((((((Fork_78>=1)&&(Catch1_78>=1))||((Fork_88>=1)&&(Catch1_88>=1)))...149452
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/500
(forward)formula 0,0,7.52965,148336,1,0,34,958129,37,22,14202,446591,20
FORMULA Philosophers-COL-000100-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:06:11] [INFO ] Invariant cache hit.
[2024-05-28 00:06:11] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-28 00:06:11] [INFO ] Invariant cache hit.
[2024-05-28 00:06:12] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-05-28 00:06:12] [INFO ] Redundant transitions in 19 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-28 00:06:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60974 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:07:12] [INFO ] Flatten gal took : 15 ms
[2024-05-28 00:07:12] [INFO ] Flatten gal took : 18 ms
[2024-05-28 00:07:12] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:07:12] [INFO ] Flatten gal took : 18 ms
[2024-05-28 00:07:12] [INFO ] Flatten gal took : 19 ms
[2024-05-28 00:07:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5111639365203147590.gal : 4 ms
[2024-05-28 00:07:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3912985236967674839.ctl : 3 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5111639365203147590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3912985236967674839.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.267992,7560,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: E((((((((((Fork_65>=1)&&(Catch1_65>=1))||((Fork_60>=1)&&(Catch1_60>=1)))||(((Fork_1>=1)&&(Catch1_1>=1))||((Fork_50>=1)&&(Catch1_50>=1))))...14942
=> equivalent forward existential formula: [((FwdU(Init,(((((((((Fork_65>=1)&&(Catch1_65>=1))||((Fork_60>=1)&&(Catch1_60>=1)))||(((Fork_1>=1)&&(Catch1_1>=1...15000
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 00:07:42] [INFO ] Flatten gal took : 30 ms
[2024-05-28 00:07:42] [INFO ] Applying decomposition
[2024-05-28 00:07:42] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5390432619745389349.txt' '-o' '/tmp/graph5390432619745389349.bin' '-w' '/tmp/graph5390432619745389349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5390432619745389349.bin' '-l' '-1' '-v' '-w' '/tmp/graph5390432619745389349.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:07:42] [INFO ] Decomposing Gal with order
[2024-05-28 00:07:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:07:42] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-28 00:07:42] [INFO ] Flatten gal took : 65 ms
[2024-05-28 00:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 22 ms.
[2024-05-28 00:07:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9602511802793971896.gal : 10 ms
[2024-05-28 00:07:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13057158763535176575.ctl : 5 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9602511802793971896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13057158763535176575.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.146687,8284,428,51,3489,292,600,2502,89,427,0


Converting to forward existential form...Done !
original formula: E((((((((((i12.i1.u45.Fork_65>=1)&&(i12.i1.u45.Catch1_65>=1))||((i11.i0.u85.Fork_60>=1)&&(i11.i0.u41.Catch1_60>=1)))||(((i4.i0.u0.Fork_1>...24247
=> equivalent forward existential formula: [((FwdU(Init,(((((((((i12.i1.u45.Fork_65>=1)&&(i12.i1.u45.Catch1_65>=1))||((i11.i0.u85.Fork_60>=1)&&(i11.i0.u41....24305
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:08:13] [INFO ] Invariant cache hit.
[2024-05-28 00:08:13] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-28 00:08:13] [INFO ] Invariant cache hit.
[2024-05-28 00:08:13] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 29755 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 59856ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 59863ms
Finished structural reductions in LTL mode , in 1 iterations and 60604 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:09:13] [INFO ] Flatten gal took : 13 ms
[2024-05-28 00:09:13] [INFO ] Flatten gal took : 16 ms
[2024-05-28 00:09:13] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:09:13] [INFO ] Flatten gal took : 15 ms
[2024-05-28 00:09:13] [INFO ] Flatten gal took : 16 ms
[2024-05-28 00:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17788348502358871784.gal : 3 ms
[2024-05-28 00:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1461492091110190626.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17788348502358871784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1461492091110190626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.421892,7564,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EX(E(AG((EG((((((((((Fork_65>=1)&&(Catch1_65>=1))||((Fork_60>=1)&&(Catch1_60>=1)))||(((Fork_1>=1)&&(Catch1_1>=1))||((Fork_50>=1)&&(Catch1...10081
=> equivalent forward existential formula: [(FwdU(FwdU(EY(Init),!(E(TRUE U !((EG((((((((((Fork_65>=1)&&(Catch1_65>=1))||((Fork_60>=1)&&(Catch1_60>=1)))||((...10164
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.87569,98360,1,0,7,668564,15,1,12203,25540,5
FORMULA Philosophers-COL-000100-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:09:17] [INFO ] Invariant cache hit.
[2024-05-28 00:09:18] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-28 00:09:18] [INFO ] Invariant cache hit.
[2024-05-28 00:09:18] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in LTL mode , in 1 iterations and 60827 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:10:18] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:10:18] [INFO ] Flatten gal took : 28 ms
[2024-05-28 00:10:18] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:10:18] [INFO ] Flatten gal took : 26 ms
[2024-05-28 00:10:18] [INFO ] Flatten gal took : 27 ms
[2024-05-28 00:10:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12869297889463263776.gal : 4 ms
[2024-05-28 00:10:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3955106783053588227.ctl : 3 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12869297889463263776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3955106783053588227.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.425083,7824,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: (AG(!(E(A((((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||(((Fork_10>=1)&&(Catch2_11>=1))||((Fork_84>=1)&&(Catch2...15048
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(E(!((E(!((((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||...21907
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/22875/500
Hit Full ! (commute/partial/dont) 0/22875/500
Detected timeout of ITS tools.
[2024-05-28 00:10:48] [INFO ] Flatten gal took : 27 ms
[2024-05-28 00:10:48] [INFO ] Applying decomposition
[2024-05-28 00:10:48] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph56652833233377919.txt' '-o' '/tmp/graph56652833233377919.bin' '-w' '/tmp/graph56652833233377919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph56652833233377919.bin' '-l' '-1' '-v' '-w' '/tmp/graph56652833233377919.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:10:49] [INFO ] Decomposing Gal with order
[2024-05-28 00:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:10:49] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-28 00:10:49] [INFO ] Flatten gal took : 66 ms
[2024-05-28 00:10:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 18 ms.
[2024-05-28 00:10:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2364022646916175004.gal : 8 ms
[2024-05-28 00:10:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17414358403036729237.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2364022646916175004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17414358403036729237.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.291053,8296,952,51,9169,287,617,6084,89,406,0


Converting to forward existential form...Done !
original formula: (AG(!(E(A((((((((((i7.i0.u68.Fork_15>=1)&&(i7.i0.u68.Catch2_16>=1))||((i18.i1.u94.Fork_89>=1)&&(i19.i1.u95.Catch2_90>=1)))||(((i6.i0.u21....24411
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(E(!((E(!((((((((((i7.i0.u68.Fork_15>=1)&&(i7.i0.u68.Catch2_16>=1))||((i18.i1.u94....35432
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 16 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:11:19] [INFO ] Invariant cache hit.
[2024-05-28 00:11:19] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-28 00:11:19] [INFO ] Invariant cache hit.
[2024-05-28 00:11:20] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2024-05-28 00:11:20] [INFO ] Redundant transitions in 6 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-28 00:11:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61276 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:12:20] [INFO ] Flatten gal took : 19 ms
[2024-05-28 00:12:20] [INFO ] Flatten gal took : 21 ms
[2024-05-28 00:12:20] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:12:20] [INFO ] Flatten gal took : 21 ms
[2024-05-28 00:12:20] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability223490214665885969.gal : 4 ms
[2024-05-28 00:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2892887337212868629.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability223490214665885969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2892887337212868629.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.407695,7820,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat...4896
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_...4952
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/500
Detected timeout of ITS tools.
[2024-05-28 00:12:50] [INFO ] Flatten gal took : 14 ms
[2024-05-28 00:12:50] [INFO ] Applying decomposition
[2024-05-28 00:12:50] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11198561397155740340.txt' '-o' '/tmp/graph11198561397155740340.bin' '-w' '/tmp/graph11198561397155740340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11198561397155740340.bin' '-l' '-1' '-v' '-w' '/tmp/graph11198561397155740340.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:12:50] [INFO ] Decomposing Gal with order
[2024-05-28 00:12:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:12:51] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 00:12:51] [INFO ] Flatten gal took : 37 ms
[2024-05-28 00:12:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 8 ms.
[2024-05-28 00:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15608791866907736168.gal : 6 ms
[2024-05-28 00:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6041762436748428901.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15608791866907736168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6041762436748428901.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.271463,8248,782,31,7418,239,626,4987,74,389,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((((((((((i3.i0.u57.Eat_52>=1)||(i3.i1.u38.Eat_48>=1))||((i18.i1.u86.Eat_60>=1)||(i8.i0.u8.Eat_56>=1)))||(((i16.i1.u69.Eat_7>=1)|...7962
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((((((((((i3.i0.u57.Eat_52>=1)||(i3.i1.u38.Eat_48>=1))||((i18.i1.u86.Eat_60>=1)||(i8...8018
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:13:21] [INFO ] Invariant cache hit.
[2024-05-28 00:13:21] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-28 00:13:21] [INFO ] Invariant cache hit.
[2024-05-28 00:13:21] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:13:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60760 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:14:21] [INFO ] Flatten gal took : 21 ms
[2024-05-28 00:14:21] [INFO ] Flatten gal took : 27 ms
[2024-05-28 00:14:22] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:14:22] [INFO ] Flatten gal took : 26 ms
[2024-05-28 00:14:22] [INFO ] Flatten gal took : 26 ms
[2024-05-28 00:14:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17701014209281628039.gal : 5 ms
[2024-05-28 00:14:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1413932296856859907.ctl : 3 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17701014209281628039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1413932296856859907.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.417564,7560,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AF(((AX(((((((((((Think_17<1)||(Fork_17<1))&&((Think_91<1)||(Fork_91<1)))&&(((Think_86<1)||(Fork_86<1))&&((Think_96<1)||(Fork_96<1))))&&(...12753
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(((((((((((Think_17<1)||(Fork_17<1))&&((Think_91<1)||(Fork_91<1)))&&(((Think_86<1)||(Fork_8...12816
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/22889/500
Detected timeout of ITS tools.
[2024-05-28 00:14:52] [INFO ] Flatten gal took : 16 ms
[2024-05-28 00:14:52] [INFO ] Applying decomposition
[2024-05-28 00:14:52] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12403776405246952251.txt' '-o' '/tmp/graph12403776405246952251.bin' '-w' '/tmp/graph12403776405246952251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12403776405246952251.bin' '-l' '-1' '-v' '-w' '/tmp/graph12403776405246952251.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:14:52] [INFO ] Decomposing Gal with order
[2024-05-28 00:14:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:14:52] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-28 00:14:52] [INFO ] Flatten gal took : 33 ms
[2024-05-28 00:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 13 ms.
[2024-05-28 00:14:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15430196353100978678.gal : 5 ms
[2024-05-28 00:14:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15039103371176007197.ctl : 3 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15430196353100978678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15039103371176007197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,5.15378e+47,0.195044,8264,476,51,4179,272,581,2890,86,394,0


Converting to forward existential form...Done !
original formula: AF(((AX(((((((((((i14.i0.u64.Think_17<1)||(i14.i0.u64.Fork_17<1))&&((i11.i0.u13.Think_91<1)||(i11.i0.u13.Fork_91<1)))&&(((i18.i0.u91.Thin...21045
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(((((((((((i14.i0.u64.Think_17<1)||(i14.i0.u64.Fork_17<1))&&((i11.i0.u13.Think_91<1)||(i11....21108
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:15:22] [INFO ] Invariant cache hit.
[2024-05-28 00:15:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 00:15:22] [INFO ] Invariant cache hit.
[2024-05-28 00:15:22] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:15:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 0)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 0)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 0)
(s105 1)
(s106 1)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 0)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 0)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in LTL mode , in 1 iterations and 60597 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:16:23] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:16:23] [INFO ] Flatten gal took : 28 ms
[2024-05-28 00:16:23] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:16:23] [INFO ] Flatten gal took : 31 ms
[2024-05-28 00:16:23] [INFO ] Flatten gal took : 26 ms
[2024-05-28 00:16:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16220185461332968439.gal : 4 ms
[2024-05-28 00:16:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17746016778306172013.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16220185461332968439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17746016778306172013.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.430512,7820,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: (AG(A((((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat_15...16348
=> equivalent forward existential formula: ([((FwdU(FwdU((Init * !(EG(!(E(!(EG((((((((((Fork_65>=1)&&(Catch1_65>=1))||((Fork_60>=1)&&(Catch1_60>=1)))||(((F...29531
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 00:16:53] [INFO ] Flatten gal took : 17 ms
[2024-05-28 00:16:53] [INFO ] Applying decomposition
[2024-05-28 00:16:53] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5771325659224488423.txt' '-o' '/tmp/graph5771325659224488423.bin' '-w' '/tmp/graph5771325659224488423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5771325659224488423.bin' '-l' '-1' '-v' '-w' '/tmp/graph5771325659224488423.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:16:53] [INFO ] Decomposing Gal with order
[2024-05-28 00:16:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:16:53] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 00:16:53] [INFO ] Flatten gal took : 67 ms
[2024-05-28 00:16:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 9 ms.
[2024-05-28 00:16:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6196802829632265046.gal : 7 ms
[2024-05-28 00:16:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12517098033693243369.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6196802829632265046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12517098033693243369.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.138901,8248,398,31,3403,233,594,2412,71,393,0


Converting to forward existential form...Done !
original formula: (AG(A((((((((((i12.i0.u46.Eat_52>=1)||(i11.i0.u43.Eat_48>=1))||((i13.i0.u50.Eat_60>=1)||(i13.i1.u49.Eat_56>=1)))||(((i6.i2.u68.Eat_7>=1)|...26728
=> equivalent forward existential formula: ([((FwdU(FwdU((Init * !(EG(!(E(!(EG((((((((((i18.i0.u54.Fork_65>=1)&&(i14.i1.u63.Catch1_65>=1))||((i14.i0.u51.Fo...48214
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
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:17:23] [INFO ] Invariant cache hit.
[2024-05-28 00:17:24] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-28 00:17:24] [INFO ] Invariant cache hit.
[2024-05-28 00:17:24] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2024-05-28 00:17:24] [INFO ] Redundant transitions in 3 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-28 00:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 1)
(s47 0)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 0)
(s53 1)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 0)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 0)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61167 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:18:24] [INFO ] Flatten gal took : 20 ms
[2024-05-28 00:18:24] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:18:24] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:18:24] [INFO ] Flatten gal took : 27 ms
[2024-05-28 00:18:25] [INFO ] Flatten gal took : 22 ms
[2024-05-28 00:18:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17446590266396550841.gal : 4 ms
[2024-05-28 00:18:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13872639276990566076.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17446590266396550841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13872639276990566076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.434082,7820,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EF(EG((((((((((Think_1>=1)&&(Fork_0>=1))||((Think_75>=1)&&(Fork_74>=1)))||(((Think_6>=1)&&(Fork_5>=1))||((Think_11>=1)&&(Fork_10>=1))))||...3302
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((((((Think_1>=1)&&(Fork_0>=1))||((Think_75>=1)&&(Fork_74>=1)))||(((Think_6>=1)&&(Fork_...3352
Hit Full ! (commute/partial/dont) 0/0/500
(forward)formula 0,1,4.6585,97200,1,0,8,676181,19,2,12507,47420,8
FORMULA Philosophers-COL-000100-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:18:29] [INFO ] Invariant cache hit.
[2024-05-28 00:18:29] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-28 00:18:29] [INFO ] Invariant cache hit.
[2024-05-28 00:18:30] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 60880 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:19:30] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:19:30] [INFO ] Flatten gal took : 31 ms
[2024-05-28 00:19:30] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:19:30] [INFO ] Flatten gal took : 19 ms
[2024-05-28 00:19:30] [INFO ] Flatten gal took : 20 ms
[2024-05-28 00:19:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3117340613912081742.gal : 4 ms
[2024-05-28 00:19:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2536184280026843668.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3117340613912081742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2536184280026843668.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.415816,7564,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AG(EX(((AF((((((((((Think_17<1)||(Fork_17<1))&&((Think_91<1)||(Fork_91<1)))&&(((Think_86<1)||(Fork_86<1))&&((Think_96<1)||(Fork_96<1))))&...28654
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((!(EG(!((((((((((Think_17<1)||(Fork_17<1))&&((Think_91<1)||(Fork_91<1)))&&(((Think_86<...28714
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/22950/500
(forward)formula 0,0,10.3509,257672,1,0,20,1.50811e+06,28,9,15065,1.1714e+06,13
FORMULA Philosophers-COL-000100-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:19:41] [INFO ] Invariant cache hit.
[2024-05-28 00:19:41] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-28 00:19:41] [INFO ] Invariant cache hit.
[2024-05-28 00:19:42] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:19:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 0)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 0)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 0)
(s105 1)
(s106 1)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 0)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 0)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in LTL mode , in 1 iterations and 61142 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:20:42] [INFO ] Flatten gal took : 19 ms
[2024-05-28 00:20:42] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:20:42] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:20:42] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:20:42] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:20:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3407493890944210007.gal : 4 ms
[2024-05-28 00:20:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15624848172713149431.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3407493890944210007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15624848172713149431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.421978,7560,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AX(AX(EF((EX((((((((((Fork_15<1)||(Catch2_16<1))&&((Fork_89<1)||(Catch2_90<1)))&&(((Fork_10<1)||(Catch2_11<1))&&((Fork_84<1)||(Catch2_85<...4601
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (EX((((((((((Fork_15<1)||(Catch2_16<1))&&((Fork_89<1)||(Catch2_90<1)))&&(((Fork_10<1...4654
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,4.83848,107952,1,0,10,751336,15,2,12301,113006,7
FORMULA Philosophers-COL-000100-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:20:47] [INFO ] Invariant cache hit.
[2024-05-28 00:20:47] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-28 00:20:47] [INFO ] Invariant cache hit.
[2024-05-28 00:20:48] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:20:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
(s300 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Finished structural reductions in LTL mode , in 1 iterations and 61172 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:21:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 00:21:48] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:21:48] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:21:48] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:21:48] [INFO ] Flatten gal took : 25 ms
[2024-05-28 00:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability924587002009461930.gal : 4 ms
[2024-05-28 00:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13421073280285496955.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability924587002009461930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13421073280285496955.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.430065,7560,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EF(((E(AF(AX(((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((...11174
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||(((Fork_10>=1)...11242
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 200/29700/300
(forward)formula 0,1,7.18768,158964,1,0,27,1.03312e+06,32,15,14400,606247,20
FORMULA Philosophers-COL-000100-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-28 00:21:55] [INFO ] Invariant cache hit.
[2024-05-28 00:21:56] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-28 00:21:56] [INFO ] Invariant cache hit.
[2024-05-28 00:21:56] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-28 00:21:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 700 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 100/500 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 500/1000 variables, 500/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 300/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 500/500 places, 500/500 transitions.
[2024-05-28 00:22:56] [INFO ] Flatten gal took : 23 ms
[2024-05-28 00:22:56] [INFO ] Flatten gal took : 24 ms
[2024-05-28 00:22:56] [INFO ] Input system was already deterministic with 500 transitions.
[2024-05-28 00:22:57] [INFO ] Flatten gal took : 25 ms
[2024-05-28 00:22:57] [INFO ] Flatten gal took : 26 ms
[2024-05-28 00:22:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15064645485067892196.gal : 4 ms
[2024-05-28 00:22:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12149942318010533818.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15064645485067892196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12149942318010533818.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.15378e+47,0.416915,7560,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AX(!(A(((A((((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||(((Fork_10>=1)&&(Catch2_11>=1))||((Fork_84>=1)&&(Catch...13061
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=...22701
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/22894/500
Hit Full ! (commute/partial/dont) 0/22894/500
Detected timeout of ITS tools.
[2024-05-28 00:23:27] [INFO ] Flatten gal took : 15 ms
[2024-05-28 00:23:27] [INFO ] Applying decomposition
[2024-05-28 00:23:27] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17481769195735108094.txt' '-o' '/tmp/graph17481769195735108094.bin' '-w' '/tmp/graph17481769195735108094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17481769195735108094.bin' '-l' '-1' '-v' '-w' '/tmp/graph17481769195735108094.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:23:27] [INFO ] Decomposing Gal with order
[2024-05-28 00:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:23:27] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 00:23:27] [INFO ] Flatten gal took : 30 ms
[2024-05-28 00:23:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 7 ms.
[2024-05-28 00:23:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8539156155134172091.gal : 11 ms
[2024-05-28 00:23:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4927435394206052049.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8539156155134172091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4927435394206052049.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.15378e+47,0.209839,8288,522,31,4700,242,641,3264,68,375,0


Converting to forward existential form...Done !
original formula: AX(!(A(((A((((((((((i5.i0.u68.Fork_15>=1)&&(i6.i0.u19.Catch2_16>=1))||((i19.i0.u97.Fork_89>=1)&&(i19.i0.u47.Catch2_90>=1)))||(((i4.i2.u65...21404
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(((((((((i1.i0.u4.Eat_52>=1)||(i9.i0.u3.Eat_48>=1))||((i10.i1.u57.Eat_60>=1)||(i1.i1.u5...37300
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
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 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
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
(forward)formula 0,1,19.1212,520180,1,0,1.39159e+06,454,3712,851080,262,1999,967744
FORMULA Philosophers-COL-000100-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-28 00:23:46] [INFO ] Flatten gal took : 29 ms
[2024-05-28 00:23:46] [INFO ] Flatten gal took : 29 ms
[2024-05-28 00:23:46] [INFO ] Applying decomposition
[2024-05-28 00:23:46] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10536400995318875620.txt' '-o' '/tmp/graph10536400995318875620.bin' '-w' '/tmp/graph10536400995318875620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10536400995318875620.bin' '-l' '-1' '-v' '-w' '/tmp/graph10536400995318875620.weights' '-q' '0' '-e' '0.001'
[2024-05-28 00:23:46] [INFO ] Decomposing Gal with order
[2024-05-28 00:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:23:46] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 00:23:46] [INFO ] Flatten gal took : 54 ms
[2024-05-28 00:23:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 7 ms.
[2024-05-28 00:23:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7790181131345949954.gal : 4 ms
[2024-05-28 00:23:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9996549307754665727.ctl : 10 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7790181131345949954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9996549307754665727.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 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,5.15378e+47,0.145302,8288,418,31,3647,244,642,2610,71,398,0


Converting to forward existential form...Done !
original formula: EF(EG((((((((A((((((((((i13.i2.u68.Think_17>=1)&&(i13.i2.u1.Fork_17>=1))||((i11.i0.u10.Think_91>=1)&&(i11.i2.u48.Fork_91>=1)))||(((i10.i1...29404
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((((!((E(!((((((((((i6.i0.u34.Eat_52>=1)||(i5.i1.u31.Eat_48>=1))||((i18.i0.u82.Eat_60>=...45477
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 00:52:21] [INFO ] Applying decomposition
[2024-05-28 00:52:21] [INFO ] Flatten gal took : 35 ms
[2024-05-28 00:52:21] [INFO ] Decomposing Gal with order
[2024-05-28 00:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 00:52:21] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 00:52:22] [INFO ] Flatten gal took : 94 ms
[2024-05-28 00:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 8 ms.
[2024-05-28 00:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14907872343168585259.gal : 7 ms
[2024-05-28 00:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15766100664386607874.ctl : 14 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14907872343168585259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15766100664386607874.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 6 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,5.15378e+47,0.343263,7796,402,19,2882,250,813,1598,30,169,0


Converting to forward existential form...Done !
original formula: EF(EG((((((((A((((((((((Philo17.Think_17>=1)&&(Philo17.Fork_17>=1))||((Philo91.Think_91>=1)&&(Philo91.Fork_91>=1)))||(((Philo86.Think_86>...26618
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((((!((E(!((((((((((Philo52.Eat_52>=1)||(Philo48.Eat_48>=1))||((Philo60.Eat_60>=1)||(Ph...41175
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-COL-000100"
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-5568"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000100, 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 r268-smll-171654407600410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000100.tgz
mv Philosophers-COL-000100 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;