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.r136-tall-171631132600426.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 DiscoveryGPU-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 02:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:42 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 DiscoveryGPU-PT-10a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716376904242

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 11:21:45] [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-22 11:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:21:45] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-22 11:21:45] [INFO ] Transformed 103 places.
[2024-05-22 11:21:45] [INFO ] Transformed 141 transitions.
[2024-05-22 11:21:45] [INFO ] Found NUPN structural information;
[2024-05-22 11:21:45] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 71 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 96 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 96 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 24 place count 96 transition count 124
Applied a total of 24 rules in 26 ms. Remains 96 /103 variables (removed 7) and now considering 124/141 (removed 17) transitions.
// Phase 1: matrix 124 rows 96 cols
[2024-05-22 11:21:45] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 11:21:45] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 11:21:45] [INFO ] Invariant cache hit.
[2024-05-22 11:21:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:21:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 11:21:45] [INFO ] Invariant cache hit.
[2024-05-22 11:21:45] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/220 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 176 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/220 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 78/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 123/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 299 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 5021ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 5036ms
Starting structural reductions in LTL mode, iteration 1 : 96/103 places, 124/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5387 ms. Remains : 96/103 places, 124/141 transitions.
Support contains 71 out of 96 places after structural reductions.
[2024-05-22 11:21:51] [INFO ] Flatten gal took : 26 ms
[2024-05-22 11:21:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:21:51] [INFO ] Input system was already deterministic with 124 transitions.
Reduction of identical properties reduced properties to check from 77 to 75
RANDOM walk for 40000 steps (371 resets) in 1288 ms. (31 steps per ms) remains 5/75 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (33 resets) in 100 ms. (396 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (31 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (39 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-05-22 11:21:51] [INFO ] Invariant cache hit.
[2024-05-22 11:21:51] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/44 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 50/94 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 9 (OVERLAPS) 42/136 variables, 18/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 13/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 12 (OVERLAPS) 24/160 variables, 10/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 8/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/180 variables, 10/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 8/147 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/203 variables, 9/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/203 variables, 7/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/203 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 9/212 variables, 5/168 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/212 variables, 2/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/212 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/214 variables, 1/171 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/214 variables, 1/172 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/214 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/216 variables, 1/173 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/216 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/218 variables, 1/174 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/218 variables, 1/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/218 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/220 variables, 1/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/220 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/220 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 176 constraints, problems are : Problem set: 2 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 54/220 variables, and 35 constraints, problems are : Problem set: 3 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/96 constraints, ReadFeed: 8/78 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 11:21:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:21:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:21:52] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:21:52] [INFO ] Input system was already deterministic with 124 transitions.
Support contains 65 out of 96 places (down from 68) after GAL structural reductions.
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 275 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Graph (complete) has 275 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 91 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 76 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 76 transition count 104
Applied a total of 31 rules in 19 ms. Remains 76 /96 variables (removed 20) and now considering 104/124 (removed 20) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:21:52] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 124 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/96 places, 104/124 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 104
Applied a total of 1 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 75 cols
[2024-05-22 11:21:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 75/96 places, 104/124 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 259 ms. Remains : 75/96 places, 104/124 transitions.
[2024-05-22 11:21:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:21:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:21:52] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 11:21:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:21:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:21:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3865794894754084131.gal : 3 ms
[2024-05-22 11:21:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4331610036711211747.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/CTLFireability3865794894754084131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4331610036711211747.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,2.85213e+09,0.369885,18416,2,6080,5,100912,6,0,394,52996,0


Converting to forward existential form...Done !
original formula: AG(!(E(((p90==1)&&(p101==1)) U ((((AG((p44==1)) + EF(((p49==1)&&(p101==1)))) + ((p84!=1)&&(!((p20==1)&&(p101==1))))) * (p22==1)) * (p101=...162
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),((p90==1)&&(p101==1))) * (p101==1)) * (p22==1)) * !(E(TRUE U !((p44==1)))))] = FALSE ...400
Hit Full ! (commute/partial/dont) 50/52/54
(forward)formula 0,0,0.497477,18668,1,0,11,100912,17,3,814,52996,6
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Graph (complete) has 275 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 100 edges and 88 vertex of which 71 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Graph (trivial) has 80 edges and 71 vertex of which 40 / 71 are part of one of the 20 SCC in 4 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 91
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 45 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 101 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 6 transition count 11
Applied a total of 114 rules in 20 ms. Remains 6 /96 variables (removed 90) and now considering 11/124 (removed 113) transitions.
[2024-05-22 11:21:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 11:21:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 11:21:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-22 11:21:52] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 11:21:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 46 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 46 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/96 places, 11/124 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 150 ms. Remains : 6/96 places, 11/124 transitions.
[2024-05-22 11:21:53] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:21:53] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:21:53] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 95 steps (1 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 11:21:53] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:21:53] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:21:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4279679294503569797.gal : 1 ms
[2024-05-22 11:21:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality779626806467939940.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4279679294503569797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality779626806467939940.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 84 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 84 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 82 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 82 transition count 110
Applied a total of 28 rules in 7 ms. Remains 82 /96 variables (removed 14) and now considering 110/124 (removed 14) transitions.
// Phase 1: matrix 110 rows 82 cols
[2024-05-22 11:21:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:21:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:21:53] [INFO ] Invariant cache hit.
[2024-05-22 11:21:53] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 11:21:53] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-22 11:21:53] [INFO ] Invariant cache hit.
[2024-05-22 11:21:53] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 110/192 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 73/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 157 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 110/192 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 73/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 109/266 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 266 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 3585ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 3586ms
Starting structural reductions in LTL mode, iteration 1 : 82/96 places, 110/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3728 ms. Remains : 82/96 places, 110/124 transitions.
[2024-05-22 11:21:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:21:56] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:21:56] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-22 11:21:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:21:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:21:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5927735079031514661.gal : 2 ms
[2024-05-22 11:21:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5530037912028832227.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/CTLFireability5927735079031514661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5530037912028832227.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,1.19651e+10,1.15907,43536,2,9489,5,246981,6,0,425,160133,0


Converting to forward existential form...Done !
original formula: (!(E(A(AG(AX(((p20==1)&&(p101==1)))) U (AF(((p62==1)&&(p101==1))) * E((p4==1) U ((p29==1)&&(p101==1))))) U EX(((p50==1)&&(p101==1))))) + ...330
=> equivalent forward existential formula: [(EY(FwdU((Init * !((E(TRUE U (p43==1)) * E(TRUE U (((!(!((E(!((((p58==1)&&(p102==1))&&(p33==1))) U (!((((p68==1...675
Reverse transition relation is NOT exact ! Due to transitions t12, t15, t23, t27, t29, t31, t35, t37, t44, t92, t93, t96, t99, t100, t101, t102, t103, t104...286
Detected timeout of ITS tools.
[2024-05-22 11:22:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:22:26] [INFO ] Applying decomposition
[2024-05-22 11:22:26] [INFO ] Flatten gal took : 8 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/graph8226801589860682308.txt' '-o' '/tmp/graph8226801589860682308.bin' '-w' '/tmp/graph8226801589860682308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8226801589860682308.bin' '-l' '-1' '-v' '-w' '/tmp/graph8226801589860682308.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:22:26] [INFO ] Decomposing Gal with order
[2024-05-22 11:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:22:27] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-22 11:22:27] [INFO ] Flatten gal took : 33 ms
[2024-05-22 11:22:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 7 ms.
[2024-05-22 11:22:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2378607410644693811.gal : 3 ms
[2024-05-22 11:22:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4877082175032796966.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/CTLFireability2378607410644693811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4877082175032796966.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,1.19651e+10,0.148682,10664,531,78,14437,1001,242,30690,32,4893,0


Converting to forward existential form...Done !
original formula: (!(E(A(AG(AX(((i2.u8.p20==1)&&(i5.u0.p101==1)))) U (AF(((i7.u22.p62==1)&&(i5.u0.p101==1))) * E((i1.u3.p4==1) U ((i3.i1.u12.p29==1)&&(i5.u...479
=> equivalent forward existential formula: [(EY(FwdU((Init * !((E(TRUE U (i0.u1.p43==1)) * E(TRUE U (((!(!((E(!((((i6.u21.p58==1)&&(i0.u2.p102==1))&&(i0.u1...932
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t35, t37, t44, t92, t93, t96, i0.t23, i0.u1.t12, i0.u1.t15, i1.u4.t104, i2.u7....378
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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
(forward)formula 0,1,7.68498,241136,1,0,437787,4166,1439,770076,162,23929,325791
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 84 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 84 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 81 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 81 transition count 109
Applied a total of 30 rules in 15 ms. Remains 81 /96 variables (removed 15) and now considering 109/124 (removed 15) transitions.
// Phase 1: matrix 109 rows 81 cols
[2024-05-22 11:22:34] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 11:22:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:22:34] [INFO ] Invariant cache hit.
[2024-05-22 11:22:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:22:34] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-22 11:22:34] [INFO ] Invariant cache hit.
[2024-05-22 11:22:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 155 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 108/263 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 263 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 3565ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 3569ms
Starting structural reductions in LTL mode, iteration 1 : 81/96 places, 109/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3717 ms. Remains : 81/96 places, 109/124 transitions.
[2024-05-22 11:22:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:22:38] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:38] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-22 11:22:38] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:38] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2937743458927741470.gal : 1 ms
[2024-05-22 11:22:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15241011537626513713.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2937743458927741470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15241011537626513713.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,1.08406e+10,0.717027,31812,2,4153,5,206978,6,0,419,98582,0


Converting to forward existential form...Done !
original formula: EX((E((EF(((p56==1)&&(p101==1))) * (p41==1)) U A((((((p56==1)&&(p43==1))&&(p102==1))||(p38==1))||(p73==1)) U EF((p74==1)))) * AG(((EF((p8...226
=> equivalent forward existential formula: [((EY(Init) * E((E(TRUE U ((p56==1)&&(p101==1))) * (p41==1)) U !((E(!(E(TRUE U (p74==1))) U (!((((((p56==1)&&(p4...366
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t22, t26, t30, t32, t34, t36, t37, t41, t97, t98, t99, t100, t101, t102, t103, t104, ...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,17.6795,498828,1,0,637,2.85821e+06,257,423,2665,3.43372e+06,687
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 115
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 80 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 80 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 76 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 76 transition count 104
Applied a total of 40 rules in 15 ms. Remains 76 /96 variables (removed 20) and now considering 104/124 (removed 20) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:22:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:22:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:22:56] [INFO ] Invariant cache hit.
[2024-05-22 11:22:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:22:56] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-22 11:22:56] [INFO ] Invariant cache hit.
[2024-05-22 11:22:56] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3265ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3266ms
Starting structural reductions in LTL mode, iteration 1 : 76/96 places, 104/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3400 ms. Remains : 76/96 places, 104/124 transitions.
[2024-05-22 11:22:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:59] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 11:22:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:22:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6187032648006724344.gal : 0 ms
[2024-05-22 11:22:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16491297707820027683.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6187032648006724344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16491297707820027683.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,7.61686e+09,0.652657,28120,2,3271,5,151470,6,0,395,95498,0


Converting to forward existential form...Done !
original formula: EF((((EX(((p38==1)&&(p102==1))) * (p44==1)) * (AG(((p86==1)&&(p101==1))) * AF(((p59==1)&&(p101==1))))) * (AF(((p56==0)&&(((((p94==1)&&(p4...237
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((EX(((p38==1)&&(p102==1))) * (p44==1)) * (!(E(TRUE U !(((p86==1)&&(p101==1))))) * !(EG(!(...465
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t36, t38, t40, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,0,22.9921,672204,1,0,1006,3.87147e+06,246,527,2468,4.8309e+06,1209
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-04 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 : 96/96 places, 124/124 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 116
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 82 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 82 transition count 110
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 78 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 78 transition count 106
Applied a total of 36 rules in 8 ms. Remains 78 /96 variables (removed 18) and now considering 106/124 (removed 18) transitions.
// Phase 1: matrix 106 rows 78 cols
[2024-05-22 11:23:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:23:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 11:23:22] [INFO ] Invariant cache hit.
[2024-05-22 11:23:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:23:23] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/96 places, 106/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 77/96 places, 106/124 transitions.
[2024-05-22 11:23:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:23:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:23:23] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-22 11:23:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16295441363305014193.gal : 1 ms
[2024-05-22 11:23:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17781801366421405840.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/CTLFireability16295441363305014193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17781801366421405840.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,8.86886e+09,1.42521,55636,2,14980,5,333319,6,0,403,194127,0


Converting to forward existential form...Done !
original formula: E(!((EF(EX((p3==1))) + AX((EG(((p37==1)&&(p101==1))) * E((p24==1) U (p64==1)))))) U ((p2==1)&&(p101==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((E(TRUE U EX((p3==1))) + !(EX(!((EG(((p37==1)&&(p101==1))) * E((p24==1) U (p64==1))))))))) * ((p2=...181
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t32, t35, t37, t39, t41, t88, t90, t95, t96, t97, t98, t99, t100, t101, t...277
(forward)formula 0,0,17.9314,523992,1,0,340,2.9892e+06,250,190,2479,3.06258e+06,459
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Graph (complete) has 275 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 91 transition count 113
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 85 transition count 113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 22 place count 76 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 31 place count 76 transition count 104
Applied a total of 31 rules in 9 ms. Remains 76 /96 variables (removed 20) and now considering 104/124 (removed 20) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:23:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:23:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 11:23:41] [INFO ] Invariant cache hit.
[2024-05-22 11:23:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:23:41] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-22 11:23:41] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-22 11:23:41] [INFO ] Invariant cache hit.
[2024-05-22 11:23:41] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3178ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3184ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/96 places, 104/124 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3303 ms. Remains : 76/96 places, 104/124 transitions.
[2024-05-22 11:23:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:23:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:23:44] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 11:23:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:44] [INFO ] Time to serialize gal into /tmp/CTLFireability819660687749345614.gal : 1 ms
[2024-05-22 11:23:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2878692986072719628.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability819660687749345614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2878692986072719628.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,3.0199e+09,0.322643,17184,2,3630,5,85484,6,0,396,45530,0


Converting to forward existential form...Done !
original formula: AG((!(A((((p98==1)&&(p102==1))&&(p83==1)) U (((p34==1)&&(p58==1))&&(p102==1)))) + (p93==0)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p93==0))) * !(EG(!((((p34==1)&&(p58==1))&&(p102==1)))))) * !(E(!((((p34==1)&&(p58==1))&...259
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t26, t28, t30, t32, t34, t35, t37, t39, t93, t94, t95, t96, t97, t98, t99, t100, t101...268
(forward)formula 0,0,11.2449,338916,1,0,497,1.92656e+06,237,283,2376,2.30759e+06,614
FORMULA DiscoveryGPU-PT-10a-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 : 96/96 places, 124/124 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 84 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 84 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 82 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 82 transition count 110
Applied a total of 28 rules in 3 ms. Remains 82 /96 variables (removed 14) and now considering 110/124 (removed 14) transitions.
// Phase 1: matrix 110 rows 82 cols
[2024-05-22 11:23:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:23:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:23:55] [INFO ] Invariant cache hit.
[2024-05-22 11:23:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 11:23:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-22 11:23:55] [INFO ] Invariant cache hit.
[2024-05-22 11:23:55] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 110/192 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 73/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 157 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 110/192 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 73/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 109/266 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 266 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 3535ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 3536ms
Starting structural reductions in LTL mode, iteration 1 : 82/96 places, 110/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3645 ms. Remains : 82/96 places, 110/124 transitions.
[2024-05-22 11:23:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:23:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:59] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-22 11:23:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:23:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6613864056791768881.gal : 1 ms
[2024-05-22 11:23:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1209111655627158681.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6613864056791768881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1209111655627158681.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,1.15368e+10,0.803469,33088,2,6100,5,190885,6,0,424,111939,0


Converting to forward existential form...Done !
original formula: E(AF((p21==1)) U E(!(E((((p42==1)&&(p101==1))||((p53==1)&&(p102==1))) U EF(((p88==1)&&(p102==1))))) U !(EF(AX(((p35==1)&&(p101==1)))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(EG(!((p21==1))))),!(E((((p42==1)&&(p101==1))||((p53==1)&&(p102==1))) U E(TRUE U ((p88==1)&&(p...225
Reverse transition relation is NOT exact ! Due to transitions t9, t22, t26, t28, t32, t34, t36, t41, t43, t91, t94, t98, t99, t100, t101, t102, t103, t104,...285
(forward)formula 0,0,28.7836,795012,1,0,292,4.79906e+06,242,171,2559,4.21572e+06,402
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Graph (complete) has 275 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 91 transition count 113
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 85 transition count 113
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 78 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 78 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 77 transition count 105
Applied a total of 29 rules in 19 ms. Remains 77 /96 variables (removed 19) and now considering 105/124 (removed 19) transitions.
// Phase 1: matrix 105 rows 77 cols
[2024-05-22 11:24:28] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:24:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:24:28] [INFO ] Invariant cache hit.
[2024-05-22 11:24:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:24:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 76/96 places, 105/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 152 ms. Remains : 76/96 places, 105/124 transitions.
[2024-05-22 11:24:28] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:24:28] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:24:28] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-22 11:24:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:24:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11019056715020094024.gal : 0 ms
[2024-05-22 11:24:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8433490300006522865.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11019056715020094024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8433490300006522865.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,3.18767e+09,0.625048,28612,2,9684,5,156445,6,0,399,98389,0


Converting to forward existential form...Done !
original formula: (AF(((p34==1) + (((((p46==0)||(p101==0))||((p100==0)||(p101==0)))||((p22==0)||(p101==0))) * AG((p33==0))))) + AG(((p60==0)||(p101==0))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(((p34==1) + (((((p46==0)||(p101==0))||((p100==0)||(p101==0)))||((p22==0)||(p101==0))) * ...229
Reverse transition relation is NOT exact ! Due to transitions t13, t24, t30, t32, t35, t37, t39, t87, t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t...271
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.87524,275036,1,0,220,1.49373e+06,245,146,2661,1.43096e+06,300
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 115
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 80 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 80 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 77 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 77 transition count 105
Applied a total of 38 rules in 3 ms. Remains 77 /96 variables (removed 19) and now considering 105/124 (removed 19) transitions.
// Phase 1: matrix 105 rows 77 cols
[2024-05-22 11:24:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:24:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:24:37] [INFO ] Invariant cache hit.
[2024-05-22 11:24:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:24:37] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 11:24:37] [INFO ] Invariant cache hit.
[2024-05-22 11:24:37] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 71/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 150 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 71/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 104/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 254 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3280ms
Starting structural reductions in LTL mode, iteration 1 : 77/96 places, 105/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3396 ms. Remains : 77/96 places, 105/124 transitions.
[2024-05-22 11:24:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:24:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:40] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-22 11:24:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2161611781136666094.gal : 1 ms
[2024-05-22 11:24:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12653481057181606136.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2161611781136666094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12653481057181606136.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,8.31835e+09,0.633568,28356,2,3308,5,154779,6,0,400,95777,0


Converting to forward existential form...Done !
original formula: E(EF(EX(EX(AG((p26==1))))) U ((p13==1)&&(p102==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U EX(EX(!(E(TRUE U !((p26==1)))))))) * ((p13==1)&&(p102==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t20, t24, t26, t28, t30, t34, t35, t37, t39, t41, t94, t95, t96, t97, t98, t99, t100, t1...276
(forward)formula 0,0,2.11641,64708,1,0,152,326137,237,98,2387,322549,224
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 119
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 89 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 88 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 88 transition count 116
Applied a total of 16 rules in 2 ms. Remains 88 /96 variables (removed 8) and now considering 116/124 (removed 8) transitions.
// Phase 1: matrix 116 rows 88 cols
[2024-05-22 11:24:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:24:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:24:43] [INFO ] Invariant cache hit.
[2024-05-22 11:24:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 11:24:43] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-22 11:24:43] [INFO ] Invariant cache hit.
[2024-05-22 11:24:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/204 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 75/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 165 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/204 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 75/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 115/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 280 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 3984ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 3986ms
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 116/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4090 ms. Remains : 88/96 places, 116/124 transitions.
[2024-05-22 11:24:47] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:24:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:24:47] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-22 11:24:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15337020458584321204.gal : 0 ms
[2024-05-22 11:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7223052255148417669.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15337020458584321204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7223052255148417669.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,1.64257e+10,0.556068,26064,2,3440,5,140905,6,0,453,97682,0


Converting to forward existential form...Done !
original formula: A(((AG(AX(((p33==1)&&(p102==1)))) * (p86==1)) * ((p101==1) * (!(((AG((p78==1)) + !(((p50==1)&&(p101==1)))) + ((p17==1)&&(p101==1)))) + E(...319
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(((p48==1) + (E(TRUE U (p38==1)) * ((p3==1)||(!((p82==1)&&(p101==1)))))))))))) * !(E(...606
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t25, t31, t33, t42, t44, t96, t97, t101, t103, t104, t105, t106, t107, t108, t109, ...290
(forward)formula 0,1,2.64673,83244,1,0,171,416031,264,110,2726,465316,255
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Graph (complete) has 275 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 91 transition count 111
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 83 transition count 111
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 26 place count 74 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 74 transition count 102
Applied a total of 35 rules in 8 ms. Remains 74 /96 variables (removed 22) and now considering 102/124 (removed 22) transitions.
// Phase 1: matrix 102 rows 74 cols
[2024-05-22 11:24:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:24:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:24:49] [INFO ] Invariant cache hit.
[2024-05-22 11:24:49] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:24:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-22 11:24:50] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-22 11:24:50] [INFO ] Invariant cache hit.
[2024-05-22 11:24:50] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 147 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 101/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 248 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3089ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3090ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/96 places, 102/124 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3205 ms. Remains : 74/96 places, 102/124 transitions.
[2024-05-22 11:24:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:24:53] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:24:53] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-22 11:24:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:24:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17423564717216022326.gal : 1 ms
[2024-05-22 11:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2278235809375837765.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17423564717216022326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2278235809375837765.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,2.41592e+09,0.302938,16740,2,2099,5,80307,6,0,386,45950,0


Converting to forward existential form...Done !
original formula: EF((EG((AF(((p46==1)&&(p101==1))) + ((p29==1)&&(p101==1)))) * EG(((p84==1)&&(p102==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * EG((!(EG(!(((p46==1)&&(p101==1))))) + ((p29==1)&&(p101==1))))),((p84==1)&&(p102==1)))] ...163
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t30, t32, t33, t35, t37, t39, t91, t92, t93, t94, t95, t96, t97, t98, t99...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 79/22/23
(forward)formula 0,1,5.04897,163892,1,0,538,950810,242,307,2502,1.1078e+06,643
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 81 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 81 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 77 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 77 transition count 105
Applied a total of 38 rules in 2 ms. Remains 77 /96 variables (removed 19) and now considering 105/124 (removed 19) transitions.
// Phase 1: matrix 105 rows 77 cols
[2024-05-22 11:24:58] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 11:24:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:24:58] [INFO ] Invariant cache hit.
[2024-05-22 11:24:58] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:24:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 11:24:58] [INFO ] Invariant cache hit.
[2024-05-22 11:24:58] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 71/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 150 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 71/150 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 104/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 254 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3282ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3283ms
Starting structural reductions in LTL mode, iteration 1 : 77/96 places, 105/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3391 ms. Remains : 77/96 places, 105/124 transitions.
[2024-05-22 11:25:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:25:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:25:01] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-22 11:25:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:25:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:25:01] [INFO ] Time to serialize gal into /tmp/CTLFireability906495969475053999.gal : 1 ms
[2024-05-22 11:25:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11551306101683218362.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability906495969475053999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11551306101683218362.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,8.31835e+09,1.13227,42060,2,6959,5,255919,6,0,400,129401,0


Converting to forward existential form...Done !
original formula: EF((((AX(((p96==1)&&(p83==1))) * (p75==1)) * ((p101==1)&&(p54==1))) * (p102==1)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p102==1)) * ((p101==1)&&(p54==1))) * (p75==1)) * !(EX(!(((p96==1)&&(p83==1))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t24, t26, t28, t30, t32, t34, t35, t37, t39, t94, t95, t96, t97, t98, t99, t100, t10...275
(forward)formula 0,0,3.64865,102348,1,0,155,499846,230,102,2356,650815,220
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 84 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 84 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 81 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 81 transition count 109
Applied a total of 30 rules in 2 ms. Remains 81 /96 variables (removed 15) and now considering 109/124 (removed 15) transitions.
// Phase 1: matrix 109 rows 81 cols
[2024-05-22 11:25:05] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:25:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:25:05] [INFO ] Invariant cache hit.
[2024-05-22 11:25:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:25:05] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-22 11:25:05] [INFO ] Invariant cache hit.
[2024-05-22 11:25:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 155 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/155 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 108/263 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 263 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 3673ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 3674ms
Starting structural reductions in LTL mode, iteration 1 : 81/96 places, 109/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3780 ms. Remains : 81/96 places, 109/124 transitions.
[2024-05-22 11:25:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:25:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:25:09] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-22 11:25:09] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:25:09] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:25:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2205578318223136015.gal : 1 ms
[2024-05-22 11:25:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5583417947767777070.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2205578318223136015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5583417947767777070.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,1.08406e+10,1.04533,40432,2,7713,5,236665,6,0,419,134665,0


Converting to forward existential form...Done !
original formula: (E(EX((AG((((p76==1)&&(p101==1))||(p54==1))) + EX(((p41==1)||((p89==1)&&(p101==1)))))) U (p14==1)) + AG((((!(A(((p4==1)&&(p102==1)) U ((p...330
=> equivalent forward existential formula: ((([((FwdU((Init * !(E(EX((!(E(TRUE U !((((p76==1)&&(p101==1))||(p54==1))))) + EX(((p41==1)||((p89==1)&&(p101==1...924
Reverse transition relation is NOT exact ! Due to transitions t9, t15, t22, t26, t28, t34, t36, t37, t41, t43, t97, t98, t99, t100, t101, t102, t103, t104,...279
Detected timeout of ITS tools.
[2024-05-22 11:25:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:25:39] [INFO ] Applying decomposition
[2024-05-22 11:25:39] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14388361616128740855.txt' '-o' '/tmp/graph14388361616128740855.bin' '-w' '/tmp/graph14388361616128740855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14388361616128740855.bin' '-l' '-1' '-v' '-w' '/tmp/graph14388361616128740855.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:25:39] [INFO ] Decomposing Gal with order
[2024-05-22 11:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:25:39] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-22 11:25:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2024-05-22 11:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7941279914670357995.gal : 2 ms
[2024-05-22 11:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4266667963064270506.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/CTLFireability7941279914670357995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4266667963064270506.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,1.08406e+10,1.22986,48928,271,114,33590,30957,221,244015,39,365038,0


Converting to forward existential form...Done !
original formula: (E(EX((AG((((i8.u24.p76==1)&&(i0.u1.p101==1))||(i6.u17.p54==1))) + EX(((i5.u13.p41==1)||((i9.u28.p89==1)&&(i0.u1.p101==1)))))) U (i1.u3.p...478
=> equivalent forward existential formula: ((([((FwdU((Init * !(E(EX((!(E(TRUE U !((((i8.u24.p76==1)&&(i0.u1.p101==1))||(i6.u17.p54==1))))) + EX(((i5.u13.p...1236
Reverse transition relation is NOT exact ! Due to transitions t26, t28, t34, t36, t37, t41, t43, i0.u1.t102, i1.u4.t101, i2.u7.t104, i3.t22, i3.u9.t9, i3.u...374
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
(forward)formula 0,1,11.9872,289372,1,0,182509,79346,1263,2.11476e+06,211,1.53556e+06,75189
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 124/124 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 115
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 80 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 80 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 76 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 76 transition count 104
Applied a total of 40 rules in 2 ms. Remains 76 /96 variables (removed 20) and now considering 104/124 (removed 20) transitions.
// Phase 1: matrix 104 rows 76 cols
[2024-05-22 11:25:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:25:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 11:25:51] [INFO ] Invariant cache hit.
[2024-05-22 11:25:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-22 11:25:51] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-22 11:25:51] [INFO ] Invariant cache hit.
[2024-05-22 11:25:51] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3274ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3275ms
Starting structural reductions in LTL mode, iteration 1 : 76/96 places, 104/124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3393 ms. Remains : 76/96 places, 104/124 transitions.
[2024-05-22 11:25:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:25:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:25:54] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 11:25:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:25:54] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:25:54] [INFO ] Time to serialize gal into /tmp/CTLFireability888264238087556175.gal : 1 ms
[2024-05-22 11:25:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8668665818330356902.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability888264238087556175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8668665818330356902.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,7.61686e+09,0.646346,28136,2,3271,5,151470,6,0,395,95498,0


Converting to forward existential form...Done !
original formula: AG(E(((p18==1)&&(p102==1)) U AX((!(AG(((p55==1)&&(p101==1)))) + E(((p35==1)&&(p101==1)) U (p86==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p18==1)&&(p102==1)) U !(EX(!((!(!(E(TRUE U !(((p55==1)&&(p101==1)))))) + E(((p35==1)&&...193
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t36, t38, t40, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,1,2.2407,68104,1,0,177,351281,239,115,2398,373590,257
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 11:25:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:25:56] [INFO ] Flatten gal took : 3 ms
Total runtime 251636 ms.

BK_STOP 1716377157038

--------------------
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="DiscoveryGPU-PT-10a"
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 DiscoveryGPU-PT-10a, 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 r136-tall-171631132600426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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