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.r356-tall-171683761500626.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 ShieldPPPt-PT-020A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761500626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717011248257

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 19:34:09] [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-29 19:34:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:34:09] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-29 19:34:09] [INFO ] Transformed 503 places.
[2024-05-29 19:34:09] [INFO ] Transformed 363 transitions.
[2024-05-29 19:34:09] [INFO ] Found NUPN structural information;
[2024-05-29 19:34:09] [INFO ] Parsed PT model containing 503 places and 363 transitions and 1446 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-020A-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 130 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 49 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 19:34:09] [INFO ] Computed 221 invariants in 22 ms
[2024-05-29 19:34:10] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-29 19:34:10] [INFO ] Invariant cache hit.
[2024-05-29 19:34:10] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:34:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22102 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30027 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 52254ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 52274ms
Finished structural reductions in LTL mode , in 1 iterations and 53168 ms. Remains : 503/503 places, 362/362 transitions.
Support contains 130 out of 503 places after structural reductions.
[2024-05-29 19:35:02] [INFO ] Flatten gal took : 72 ms
[2024-05-29 19:35:03] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:35:03] [INFO ] Input system was already deterministic with 362 transitions.
Support contains 128 out of 503 places (down from 130) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1462 ms. (27 steps per ms) remains 30/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
[2024-05-29 19:35:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 73/133 variables, 57/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 73/190 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 370/503 variables, 164/354 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 370/724 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1308 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 73/133 variables, 57/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 73/190 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 370/503 variables, 164/354 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 370/724 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 30/1257 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/865 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1257 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2865 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 4188ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 4867 ms.
Support contains 60 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Partial Free-agglomeration rule applied 60 times.
Drop transitions (Partial Free agglomeration) removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 64 place count 501 transition count 360
Applied a total of 64 rules in 104 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 501/503 places, 360/362 transitions.
RANDOM walk for 40000 steps (8 resets) in 771 ms. (51 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
// Phase 1: matrix 360 rows 501 cols
[2024-05-29 19:35:13] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 19:35:13] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 40/66 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 435/501 variables, 194/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 435/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 360/861 variables, 501/1223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 18/1241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/861 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 1241 constraints, problems are : Problem set: 0 solved, 8 unsolved in 512 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 501/501 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 40/66 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 435/501 variables, 194/287 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 435/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 360/861 variables, 501/1223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 18/1241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 8/1249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/861 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 1249 constraints, problems are : Problem set: 0 solved, 8 unsolved in 874 ms.
Refiners :[Domain max(s): 501/501 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 501/501 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1399ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 5269 ms.
Support contains 14 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 360/360 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 501 transition count 360
Applied a total of 14 rules in 45 ms. Remains 501 /501 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 501/501 places, 360/360 transitions.
RANDOM walk for 37365 steps (8 resets) in 288 ms. (129 steps per ms) remains 0/4 properties
[2024-05-29 19:35:20] [INFO ] Flatten gal took : 28 ms
[2024-05-29 19:35:20] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:35:20] [INFO ] Input system was already deterministic with 362 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 361
Applied a total of 2 rules in 23 ms. Remains 502 /503 variables (removed 1) and now considering 361/362 (removed 1) transitions.
// Phase 1: matrix 361 rows 502 cols
[2024-05-29 19:35:20] [INFO ] Computed 221 invariants in 3 ms
[2024-05-29 19:35:20] [INFO ] Implicit Places using invariants in 247 ms returned [495]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 250 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 501/503 places, 361/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 501 transition count 359
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 499 transition count 359
Applied a total of 4 rules in 22 ms. Remains 499 /501 variables (removed 2) and now considering 359/361 (removed 2) transitions.
// Phase 1: matrix 359 rows 499 cols
[2024-05-29 19:35:21] [INFO ] Computed 220 invariants in 4 ms
[2024-05-29 19:35:21] [INFO ] Implicit Places using invariants in 247 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 497/503 places, 359/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 357
Applied a total of 4 rules in 25 ms. Remains 495 /497 variables (removed 2) and now considering 357/359 (removed 2) transitions.
// Phase 1: matrix 357 rows 495 cols
[2024-05-29 19:35:21] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 19:35:21] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-29 19:35:21] [INFO ] Invariant cache hit.
[2024-05-29 19:35:21] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 495/503 places, 357/362 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1198 ms. Remains : 495/503 places, 357/362 transitions.
[2024-05-29 19:35:21] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:35:21] [INFO ] Flatten gal took : 20 ms
[2024-05-29 19:35:21] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-29 19:35:22] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:35:22] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:35:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6475426085445710032.gal : 7 ms
[2024-05-29 19:35:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17704110398970865742.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/CTLFireability6475426085445710032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17704110398970865742.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.75922e+71,1.15238,43004,2,1381,5,169428,6,0,2339,257633,0


Converting to forward existential form...Done !
original formula: AF(E(((p211==1)&&(p221==1)) U EG(!((EF(((p231==1)&&(p246==1))) + (((p490==1)&&(p463==1))&&(p477==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((p211==1)&&(p221==1)) U EG(!((E(TRUE U ((p231==1)&&(p246==1))) + (((p490==1)&&(p463==1))&&(p477=...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.35302,84572,1,0,9,422911,30,2,12402,311230,13
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-00 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 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 12 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 19:35:25] [INFO ] Computed 221 invariants in 6 ms
[2024-05-29 19:35:25] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-29 19:35:25] [INFO ] Invariant cache hit.
[2024-05-29 19:35:26] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21596 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30020 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51675ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51678ms
Finished structural reductions in LTL mode , in 1 iterations and 52317 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:36:17] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:36:17] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:36:17] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:36:17] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:36:17] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:36:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6684491316314682709.gal : 4 ms
[2024-05-29 19:36:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8857858650851723865.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/CTLFireability6684491316314682709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8857858650851723865.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.19902e+72,1.16765,44372,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: EF((((p161==1)&&(p171==1)) * (!(E(((p79==1)&&(p98==1)) U !(((p179==1)&&(p198==1))))) * !(E(!((((p474==1)&&(p111==1))&&(p121==1))) U EX(((...181
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p161==1)&&(p171==1))) * !(E(((p79==1)&&(p98==1)) U !(((p179==1)&&(p198==1)))))) * !(E(!(...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 352/0/10
Hit Full ! (commute/partial/dont) 357/4/5
(forward)formula 0,1,2.51605,59512,1,0,17,329753,28,5,11706,266496,12
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:36:20] [INFO ] Invariant cache hit.
[2024-05-29 19:36:20] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-29 19:36:20] [INFO ] Invariant cache hit.
[2024-05-29 19:36:21] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:36:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22307 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 52384ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 52387ms
Finished structural reductions in LTL mode , in 1 iterations and 53001 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:37:13] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:37:13] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:37:13] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:37:13] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:37:13] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4535086006553893959.gal : 2 ms
[2024-05-29 19:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3100052692530449873.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/CTLFireability4535086006553893959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3100052692530449873.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.19902e+72,1.17398,44116,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: AF(AX((((EG(EF(((p112==1)&&(p114==1)))) + EF(((p218==1)&&(p225==1)))) + (A(AG(((p355==1)&&(p372==1))) U EG(((p103==1)&&(p126==1)))) + ((p...230
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((EG(E(TRUE U ((p112==1)&&(p114==1)))) + E(TRUE U ((p218==1)&&(p225==1)))) + (!((E(!(EG(((p...386
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,2.71893,61072,1,0,15,332714,38,6,12610,266496,23
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:37:16] [INFO ] Invariant cache hit.
[2024-05-29 19:37:16] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 19:37:16] [INFO ] Invariant cache hit.
[2024-05-29 19:37:16] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:37:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21732 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30018 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51815ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51818ms
Finished structural reductions in LTL mode , in 1 iterations and 52473 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:38:08] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:38:08] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:38:08] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:38:08] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:38:08] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7922876405028312410.gal : 2 ms
[2024-05-29 19:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3154557452628520919.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/CTLFireability7922876405028312410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3154557452628520919.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.19902e+72,1.17841,44116,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: (AG(((p158==1)&&(p175==1))) + EX(EF((p26==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(E(TRUE U (p26==1))))),TRUE) * !(((p158==1)&&(p175==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.28916,49596,1,0,8,266027,16,1,11403,266496,6
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:38:11] [INFO ] Invariant cache hit.
[2024-05-29 19:38:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 19:38:11] [INFO ] Invariant cache hit.
[2024-05-29 19:38:11] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:38:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21840 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30018 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51916ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51920ms
Finished structural reductions in LTL mode , in 1 iterations and 52551 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:39:03] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:39:03] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:39:03] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:39:03] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:39:03] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:39:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5235222686571955180.gal : 4 ms
[2024-05-29 19:39:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17816919722655736003.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/CTLFireability5235222686571955180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17816919722655736003.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.19902e+72,1.17945,44376,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(EG(((p353==0)||(p376==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(EG(((p353==0)||(p376==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.38099,45432,1,0,7,244856,21,0,11943,266496,8
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:39:06] [INFO ] Invariant cache hit.
[2024-05-29 19:39:06] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-29 19:39:06] [INFO ] Invariant cache hit.
[2024-05-29 19:39:06] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:39:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21908 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30013 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51979ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51983ms
Finished structural reductions in LTL mode , in 1 iterations and 52630 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:39:58] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:39:58] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:39:58] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:39:58] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:39:58] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:39:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13185304012069939436.gal : 3 ms
[2024-05-29 19:39:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15416040591292896828.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/CTLFireability13185304012069939436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15416040591292896828.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,2.19902e+72,1.11954,44140,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: E((!(((E(AX(((p240==1)&&(p274==1))) U (((p411==1)&&(p421==1))||((p131==1)&&(p146==1)))) * E(((p481==1)&&(p496==1)) U ((p412==1)&&(p414==1...489
=> equivalent forward existential formula: [FwdG((FwdU(Init,(!(((E(!(EX(!(((p240==1)&&(p274==1))))) U (((p411==1)&&(p421==1))||((p131==1)&&(p146==1)))) * E...688
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 357/4/5
Detected timeout of ITS tools.
[2024-05-29 19:40:29] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:40:29] [INFO ] Applying decomposition
[2024-05-29 19:40:29] [INFO ] Flatten gal took : 12 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/graph4846698870782172933.txt' '-o' '/tmp/graph4846698870782172933.bin' '-w' '/tmp/graph4846698870782172933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4846698870782172933.bin' '-l' '-1' '-v' '-w' '/tmp/graph4846698870782172933.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:40:29] [INFO ] Decomposing Gal with order
[2024-05-29 19:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:40:29] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 19:40:29] [INFO ] Flatten gal took : 60 ms
[2024-05-29 19:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 30 ms.
[2024-05-29 19:40:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17852624605441571654.gal : 8 ms
[2024-05-29 19:40:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14640977982996550270.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/CTLFireability17852624605441571654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14640977982996550270.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19902e+72,18.8623,579960,166,15,1.12954e+06,483,676,3.59432e+06,33,2683,0


Converting to forward existential form...Done !
original formula: E((!(((E(AX(((i9.i0.i0.u76.p240==1)&&(i9.i0.i0.u87.p274==1))) U (((i15.u131.p411==1)&&(i15.u133.p421==1))||((i5.i0.i1.u42.p131==1)&&(i5.i...799
=> equivalent forward existential formula: [FwdG((FwdU(Init,(!(((E(!(EX(!(((i9.i0.i0.u76.p240==1)&&(i9.i0.i0.u87.p274==1))))) U (((i15.u131.p411==1)&&(i15....1054
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:40:59] [INFO ] Invariant cache hit.
[2024-05-29 19:40:59] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 19:40:59] [INFO ] Invariant cache hit.
[2024-05-29 19:41:00] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:41:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21458 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30016 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51532ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51535ms
Finished structural reductions in LTL mode , in 1 iterations and 52190 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:41:51] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:41:51] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:41:51] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:41:51] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:41:51] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5285796624208386913.gal : 3 ms
[2024-05-29 19:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11670440653487331716.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/CTLFireability5285796624208386913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11670440653487331716.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.19902e+72,1.17701,44152,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: EX(AG((((p416==0)||(p427==0)) + AX((((p142==0)||(p144==0))||((p367==0)||(p369==0)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((((p416==0)||(p427==0)) + !(EX(!((((p142==0)||(p144==0))||((p367==0)||(p369==0))))))))...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.38651,54912,1,0,11,300138,16,3,11411,266496,7
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 360
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 500 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 498 transition count 358
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 9 place count 497 transition count 357
Applied a total of 9 rules in 40 ms. Remains 497 /503 variables (removed 6) and now considering 357/362 (removed 5) transitions.
// Phase 1: matrix 357 rows 497 cols
[2024-05-29 19:41:54] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 19:41:54] [INFO ] Implicit Places using invariants in 234 ms returned [480, 484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 235 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 495/503 places, 357/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 493 transition count 355
Applied a total of 4 rules in 15 ms. Remains 493 /495 variables (removed 2) and now considering 355/357 (removed 2) transitions.
// Phase 1: matrix 355 rows 493 cols
[2024-05-29 19:41:54] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 19:41:54] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-29 19:41:54] [INFO ] Invariant cache hit.
[2024-05-29 19:41:54] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 493/503 places, 355/362 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 896 ms. Remains : 493/503 places, 355/362 transitions.
[2024-05-29 19:41:54] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:41:54] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:41:54] [INFO ] Input system was already deterministic with 355 transitions.
[2024-05-29 19:41:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:41:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:41:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15450351085615339863.gal : 14 ms
[2024-05-29 19:41:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6168112059745506765.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15450351085615339863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6168112059745506765.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 32824 steps (6 resets) in 282 ms. (115 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 19:41:55] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 19:41:55] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-29 19:41:55] [INFO ] Invariant cache hit.
[2024-05-29 19:41:55] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:41:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21760 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51839ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51843ms
Finished structural reductions in LTL mode , in 1 iterations and 52470 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:42:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:42:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:42:47] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:42:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:42:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:42:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16797911771963773351.gal : 2 ms
[2024-05-29 19:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6878462276495325447.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/CTLFireability16797911771963773351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6878462276495325447.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.19902e+72,1.15891,44408,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: EX(E(AF(((p106==1)&&(p121==1))) U (AX(!(AF(((p454==1)&&(p473==1))))) * EF(((p266==1)&&(p277==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(EY(Init),!(EG(!(((p106==1)&&(p121==1)))))) * !(EX(!(!(!(EG(!(((p454==1)&&(p473==1)))))))))),TRUE) *...189
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.18484,82492,1,0,15,418422,33,6,12278,299234,17
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 23 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2024-05-29 19:42:50] [INFO ] Computed 221 invariants in 5 ms
[2024-05-29 19:42:51] [INFO ] Implicit Places using invariants in 253 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 15 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2024-05-29 19:42:51] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:42:51] [INFO ] Implicit Places using invariants in 236 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 15 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2024-05-29 19:42:51] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 19:42:51] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-29 19:42:51] [INFO ] Invariant cache hit.
[2024-05-29 19:42:52] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 494/503 places, 356/362 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1169 ms. Remains : 494/503 places, 356/362 transitions.
[2024-05-29 19:42:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:42:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:42:52] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-29 19:42:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:42:52] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:42:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16440565581715109738.gal : 3 ms
[2024-05-29 19:42:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3602967506979865572.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/CTLFireability16440565581715109738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3602967506979865572.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.40737e+71,1.11809,42812,2,1376,5,169148,6,0,2334,257234,0


Converting to forward existential form...Done !
original formula: EF(((A((((!((p462==1)&&(p464==1)))||((p392==1)&&(p394==1)))||((p306==1)&&(p321==1))) U (p24!=1)) * !(A(E(((p107==1)&&(p109==1)) U ((p45==...289
=> equivalent forward existential formula: [(FwdU(((FwdU((FwdU(Init,TRUE) * (!((E(!((p24!=1)) U (!((((!((p462==1)&&(p464==1)))||((p392==1)&&(p394==1)))||((...479
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 353/2/3
Hit Full ! (commute/partial/dont) 353/2/3
Hit Full ! (commute/partial/dont) 352/0/4
(forward)formula 0,1,2.89782,66940,1,0,22,348261,44,8,12995,257234,25
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 19:42:55] [INFO ] Computed 221 invariants in 4 ms
[2024-05-29 19:42:55] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-29 19:42:55] [INFO ] Invariant cache hit.
[2024-05-29 19:42:55] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:42:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21445 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51511ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51514ms
Finished structural reductions in LTL mode , in 1 iterations and 52126 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:43:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:43:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:43:47] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:43:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:43:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:43:47] [INFO ] Time to serialize gal into /tmp/CTLFireability13787648786490675550.gal : 2 ms
[2024-05-29 19:43:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15722394865587482745.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/CTLFireability13787648786490675550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15722394865587482745.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,2.19902e+72,1.1287,44148,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: EF(EX(((p166==1)&&(p177==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p166==1)&&(p177==1)))] != FALSE
(forward)formula 0,1,1.17976,44412,1,0,8,175319,8,1,4246,266496,2
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:43:48] [INFO ] Invariant cache hit.
[2024-05-29 19:43:48] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-29 19:43:48] [INFO ] Invariant cache hit.
[2024-05-29 19:43:49] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:43:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 20996 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51060ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51064ms
Finished structural reductions in LTL mode , in 1 iterations and 51694 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:44:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:44:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:44:40] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:44:40] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:44:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:44:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6458154597477209106.gal : 2 ms
[2024-05-29 19:44:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11821616859128157024.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/CTLFireability6458154597477209106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11821616859128157024.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.19902e+72,1.15587,44156,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: AG(((!(E(EX((((p355==1)&&(p372==1))&&((p211==1)&&(p221==1)))) U ((p206==1)&&(p221==1)))) + (p2==0)) + (p10==0)))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((p10==0))) * !((p2==0))),EX((((p355==1)&&(p372==1))&&((p211==1)&&(p221==1))))) * ((...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,12.7387,410892,1,0,227,1.88843e+06,19,149,11947,3.54324e+06,223
FORMULA ShieldPPPt-PT-020A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 12 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2024-05-29 19:44:53] [INFO ] Invariant cache hit.
[2024-05-29 19:44:53] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-29 19:44:53] [INFO ] Invariant cache hit.
[2024-05-29 19:44:53] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:44:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21571 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30022 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51648ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51655ms
Finished structural reductions in LTL mode , in 1 iterations and 52295 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:45:45] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:45:45] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:45:45] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:45:45] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:45:45] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:45:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13469575371593891858.gal : 2 ms
[2024-05-29 19:45:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1554054119782207497.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/CTLFireability13469575371593891858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1554054119782207497.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.19902e+72,1.3061,44404,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: EF((((p254==1)&&(p273==1)) + ((p201==1) * (!(A(AX(((p87==1)&&(p89==1))) U ((p265==1)&&(p299==1)))) + ((((p7==0)||(p9==0)) * (!(E((p397==1...261
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p254==1)&&(p273==1)))] != FALSE + (([(EY((FwdU((FwdU(Init,TRUE) * (p201==1)),!(((p265==1)...606
(forward)formula 0,1,1.30834,44404,1,0,7,175319,8,1,2382,266496,1
FORMULA ShieldPPPt-PT-020A-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 20 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2024-05-29 19:45:46] [INFO ] Computed 221 invariants in 1 ms
[2024-05-29 19:45:46] [INFO ] Implicit Places using invariants in 255 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 11 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2024-05-29 19:45:46] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:45:47] [INFO ] Implicit Places using invariants in 249 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 250 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 14 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2024-05-29 19:45:47] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 19:45:47] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-29 19:45:47] [INFO ] Invariant cache hit.
[2024-05-29 19:45:47] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 494/503 places, 356/362 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1183 ms. Remains : 494/503 places, 356/362 transitions.
[2024-05-29 19:45:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:45:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:45:47] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-29 19:45:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:45:47] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:45:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1173307306186869835.gal : 2 ms
[2024-05-29 19:45:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12264788250103782221.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/CTLFireability1173307306186869835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12264788250103782221.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.40737e+71,1.1259,42820,2,1376,5,169148,6,0,2334,257234,0


Converting to forward existential form...Done !
original formula: EF((EG(((EF((p247==0)) + (p180==0)) + (p197==0))) + (p145==1)))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((E(TRUE U (p247==0)) + (p180==0)) + (p197==0)))] != FALSE + [(FwdU(Init,TRUE) * (p145==1...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.32422,44404,1,0,9,231162,20,2,12368,257234,13
FORMULA ShieldPPPt-PT-020A-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 19:45:50] [INFO ] Computed 221 invariants in 2 ms
[2024-05-29 19:45:50] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-29 19:45:50] [INFO ] Invariant cache hit.
[2024-05-29 19:45:50] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:45:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21416 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 221/723 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/865 variables, 361/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/865 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1588 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 51494ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51498ms
Finished structural reductions in LTL mode , in 1 iterations and 52128 ms. Remains : 503/503 places, 362/362 transitions.
[2024-05-29 19:46:42] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:46:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:46:42] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-29 19:46:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:46:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:46:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9696490267763887818.gal : 2 ms
[2024-05-29 19:46:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14833992322017333615.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/CTLFireability9696490267763887818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14833992322017333615.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.19902e+72,1.22897,44420,2,1406,5,175319,6,0,2376,266496,0


Converting to forward existential form...Done !
original formula: (AG((EX(A((p226==1) U ((p245==1)&&(p260==1)))) * ((EF(((p216==1)&&(p227==1))) + EG((p401==1))) + ((p195==1)&&(p210==1))))) + EX((p197==1)...157
=> equivalent forward existential formula: ([(FwdU((Init * !(EX((p197==1)))),TRUE) * !(EX(!((E(!(((p245==1)&&(p260==1))) U (!((p226==1)) * !(((p245==1)&&(p...353
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 356/0/6
(forward)formula 0,0,3.70609,91704,1,0,15,460552,31,5,12772,351901,18
FORMULA ShieldPPPt-PT-020A-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 19:46:46] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:46:46] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:46:46] [INFO ] Applying decomposition
[2024-05-29 19:46:46] [INFO ] Flatten gal took : 21 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/graph5357382009357387549.txt' '-o' '/tmp/graph5357382009357387549.bin' '-w' '/tmp/graph5357382009357387549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5357382009357387549.bin' '-l' '-1' '-v' '-w' '/tmp/graph5357382009357387549.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:46:46] [INFO ] Decomposing Gal with order
[2024-05-29 19:46:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:46:46] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 19:46:46] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:46:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 21 ms.
[2024-05-29 19:46:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15331024690431972128.gal : 5 ms
[2024-05-29 19:46:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7540020893475654191.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/CTLFireability15331024690431972128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7540020893475654191.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19902e+72,7.91525,257848,178,15,467487,1011,663,1.59798e+06,33,9681,0


Converting to forward existential form...Done !
original formula: E((!(((E(AX(((i7.i1.i2.u76.p240==1)&&(i7.i1.i2.u87.p274==1))) U (((i17.u131.p411==1)&&(i17.u133.p421==1))||((i6.u42.p131==1)&&(i6.u45.p14...825
=> equivalent forward existential formula: [FwdG((FwdU(Init,(!(((E(!(EX(!(((i7.i1.i2.u76.p240==1)&&(i7.i1.i2.u87.p274==1))))) U (((i17.u131.p411==1)&&(i17....1104
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
[2024-05-29 20:10:58] [INFO ] Applying decomposition
[2024-05-29 20:10:58] [INFO ] Flatten gal took : 12 ms
[2024-05-29 20:10:58] [INFO ] Decomposing Gal with order
[2024-05-29 20:10:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:10:58] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 20:10:58] [INFO ] Flatten gal took : 22 ms
[2024-05-29 20:10:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 20:10:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13391533299339994068.gal : 5 ms
[2024-05-29 20:10:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15900533319234695218.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/CTLFireability13391533299339994068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15900533319234695218.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19902e+72,1.14685,48700,332,5,101805,562,995,136050,12,436,0


Converting to forward existential form...Done !
original formula: E((!(((E(AX(((i76.u316.p240==1)&&(u154.p274==1))) U (((i131.u231.p411==1)&&(u236.p421==1))||((i42.u74.p131==1)&&(u82.p146==1)))) * E(((i1...722
=> equivalent forward existential formula: [FwdG((FwdU(Init,(!(((E(!(EX(!(((i76.u316.p240==1)&&(u154.p274==1))))) U (((i131.u231.p411==1)&&(u236.p421==1))|...973
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 122
Fast SCC detection found an SCC at level 123
Fast SCC detection found an SCC at level 124
Fast SCC detection found an SCC at level 125
Fast SCC detection found an SCC at level 126
Fast SCC detection found an SCC at level 127
Fast SCC detection found an SCC at level 128
Fast SCC detection found an SCC at level 129
Fast SCC detection found an SCC at level 130
Fast SCC detection found an SCC at level 131
Fast SCC detection found an SCC at level 132
Fast SCC detection found an SCC at level 133
Fast SCC detection found an SCC at level 134
Fast SCC detection found an SCC at level 135
Fast SCC detection found an SCC at level 136
Fast SCC detection found an SCC at level 137
Fast SCC detection found an SCC at level 138
Fast SCC detection found an SCC at level 139
Fast SCC detection found an SCC at level 140
Fast SCC detection found an SCC at level 141
Fast SCC detection found an SCC at level 142
Fast SCC detection found an SCC at level 143
Fast SCC detection found an SCC at level 144
Fast SCC detection found an SCC at level 145
Fast SCC detection found an SCC at level 146
Fast SCC detection found an SCC at level 147
Fast SCC detection found an SCC at level 148
Fast SCC detection found an SCC at level 149
Fast SCC detection found an SCC at level 150
Fast SCC detection found an SCC at level 151
Fast SCC detection found an SCC at level 152
Fast SCC detection found an SCC at level 153
Fast SCC detection found an SCC at level 154
Fast SCC detection found an SCC at level 155
Fast SCC detection found an SCC at level 156
Fast SCC detection found an SCC at level 157
Fast SCC detection found an SCC at level 158
Fast SCC detection found an SCC at level 159
Fast SCC detection found an SCC at level 160
Fast SCC detection found an SCC at level 161

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPt-PT-020A"
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 ShieldPPPt-PT-020A, 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 r356-tall-171683761500626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020A.tgz
mv ShieldPPPt-PT-020A 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 ;