fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r114-smll-171624275400146
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DLCround-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
356.544 104770.00 131660.00 625.70 TTFTFTFFFFFTTFTT normal

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.r114-smll-171624275400146.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 DLCround-PT-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275400146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 13:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 13 13:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 259K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716349882200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 03:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:51:24] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-05-22 03:51:24] [INFO ] Transformed 167 places.
[2024-05-22 03:51:24] [INFO ] Transformed 1055 transitions.
[2024-05-22 03:51:24] [INFO ] Found NUPN structural information;
[2024-05-22 03:51:24] [INFO ] Parsed PT model containing 167 places and 1055 transitions and 3985 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 181 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 112 transitions
Reduce redundant transitions removed 112 transitions.
FORMULA DLCround-PT-05a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 943/943 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 163 transition count 907
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 163 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 163 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 1 with 300 rules applied. Total rules applied 309 place count 163 transition count 606
Applied a total of 309 rules in 115 ms. Remains 163 /167 variables (removed 4) and now considering 606/943 (removed 337) transitions.
[2024-05-22 03:51:25] [INFO ] Flow matrix only has 133 transitions (discarded 473 similar events)
// Phase 1: matrix 133 rows 163 cols
[2024-05-22 03:51:25] [INFO ] Computed 88 invariants in 20 ms
[2024-05-22 03:51:25] [INFO ] Implicit Places using invariants in 628 ms returned [85, 90, 91, 93, 94, 95, 96, 97, 105, 107, 108, 109, 110, 112, 123, 124, 126, 128, 129, 130, 131, 134, 137, 142, 148, 154, 155, 157, 158, 161]
Discarding 30 places :
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Implicit Place search using SMT only with invariants took 697 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/167 places, 485/943 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 305 transitions
Redundant transition composition rules discarded 305 transitions
Iterating global reduction 0 with 305 rules applied. Total rules applied 305 place count 133 transition count 180
Applied a total of 305 rules in 18 ms. Remains 133 /133 variables (removed 0) and now considering 180/485 (removed 305) transitions.
[2024-05-22 03:51:25] [INFO ] Flow matrix only has 133 transitions (discarded 47 similar events)
// Phase 1: matrix 133 rows 133 cols
[2024-05-22 03:51:25] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 03:51:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 03:51:25] [INFO ] Flow matrix only has 133 transitions (discarded 47 similar events)
[2024-05-22 03:51:25] [INFO ] Invariant cache hit.
[2024-05-22 03:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:51:26] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/167 places, 180/943 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1128 ms. Remains : 133/167 places, 180/943 transitions.
Support contains 96 out of 133 places after structural reductions.
[2024-05-22 03:51:26] [INFO ] Flatten gal took : 51 ms
[2024-05-22 03:51:26] [INFO ] Flatten gal took : 20 ms
[2024-05-22 03:51:26] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 94 out of 133 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1677 ms. (23 steps per ms) remains 3/66 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
[2024-05-22 03:51:27] [INFO ] Flow matrix only has 133 transitions (discarded 47 similar events)
[2024-05-22 03:51:27] [INFO ] Invariant cache hit.
[2024-05-22 03:51:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/54 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/133 variables, 48/58 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/265 variables, 133/191 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/266 variables, 1/192 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/266 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 192 constraints, problems are : Problem set: 2 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 133/133 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 12/266 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/58 constraints, State Equation: 0/133 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2024-05-22 03:51:27] [INFO ] Flatten gal took : 12 ms
[2024-05-22 03:51:27] [INFO ] Flatten gal took : 14 ms
[2024-05-22 03:51:27] [INFO ] Input system was already deterministic with 180 transitions.
Computed a total of 49 stabilizing places and 1 stable transitions
Graph (complete) has 237 edges and 133 vertex of which 85 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 90 transition count 180
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 74 transition count 148
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 74 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 74 transition count 145
Applied a total of 78 rules in 11 ms. Remains 74 /133 variables (removed 59) and now considering 145/180 (removed 35) transitions.
[2024-05-22 03:51:27] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
// Phase 1: matrix 114 rows 74 cols
[2024-05-22 03:51:27] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 03:51:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 03:51:27] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:51:27] [INFO ] Invariant cache hit.
[2024-05-22 03:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:51:28] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 03:51:28] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:51:28] [INFO ] Invariant cache hit.
[2024-05-22 03:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/187 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 90 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4708 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/187 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 144/233 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/188 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 234 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4182 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 8944ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 8950ms
Starting structural reductions in LTL mode, iteration 1 : 74/133 places, 145/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9105 ms. Remains : 74/133 places, 145/180 transitions.
[2024-05-22 03:51:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 03:51:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:51:37] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 03:51:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:51:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:51:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9859729789537653319.gal : 4 ms
[2024-05-22 03:51:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2082055284236124837.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9859729789537653319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2082055284236124837.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6384e+08,0.032895,3788,2,206,5,812,6,0,396,577,0


Converting to forward existential form...Done !
original formula: EF(EG((AF(!(E(((p66==1)&&(p156==1)) U ((p46==1)&&(p104==1))))) * (AX(((p57==1)&&(p143==1))) + (((p67==1)&&(p155==1))&&(((p7==0)||(p106==0...186
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(!(E(((p66==1)&&(p156==1)) U ((p46==1)&&(p104==1))))))) * (!(EX(!(((p57==1)&&(p143=...248
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 141/4/4
Using saturation style SCC detection
(forward)formula 0,1,0.084119,5228,1,0,15,8898,31,4,1890,2979,17
FORMULA DLCround-PT-05a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Graph (trivial) has 134 edges and 133 vertex of which 52 / 133 are part of one of the 10 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 144 edges and 91 vertex of which 50 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 50 transition count 84
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 47 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 46 transition count 83
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 17 place count 39 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 24 place count 39 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 39 transition count 71
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 28 place count 38 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 32 place count 38 transition count 66
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 34 place count 38 transition count 66
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 36 place count 36 transition count 64
Iterating global reduction 5 with 2 rules applied. Total rules applied 38 place count 36 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 40 place count 36 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 42 place count 36 transition count 60
Applied a total of 42 rules in 34 ms. Remains 36 /133 variables (removed 97) and now considering 60/180 (removed 120) transitions.
[2024-05-22 03:51:37] [INFO ] Flow matrix only has 39 transitions (discarded 21 similar events)
// Phase 1: matrix 39 rows 36 cols
[2024-05-22 03:51:37] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 03:51:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 03:51:37] [INFO ] Flow matrix only has 39 transitions (discarded 21 similar events)
[2024-05-22 03:51:37] [INFO ] Invariant cache hit.
[2024-05-22 03:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:51:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-22 03:51:37] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 03:51:37] [INFO ] Flow matrix only has 39 transitions (discarded 21 similar events)
[2024-05-22 03:51:37] [INFO ] Invariant cache hit.
[2024-05-22 03:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 7/36 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 38/74 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 50 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 7/36 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 38/74 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 59/108 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/75 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 109 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 2528ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/133 places, 60/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2661 ms. Remains : 36/133 places, 60/180 transitions.
[2024-05-22 03:51:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 03:51:39] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:51:39] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-22 03:51:39] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:51:39] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5568767117764628926.gal : 7 ms
[2024-05-22 03:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11082605081193629546.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/CTLFireability5568767117764628926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11082605081193629546.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,3781,0.009362,3588,2,88,5,323,6,0,161,223,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p35==1)&&(p96==1))) + ((A((((p37==1)&&(p91==1))||((p67==1)&&(p139==1))) U AF(((p68==1)&&(p120==1)))) * (p28==1)) * (p136==1))) ...205
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((p88==1)&&(p164==1))&&((p77==1)&&(p140==1))))) * !(((!((E(!(!(EG(!(((p68==1)&&(p120==1...368
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.016591,3904,1,0,6,1548,14,0,710,405,5
FORMULA DLCround-PT-05a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Graph (trivial) has 114 edges and 133 vertex of which 37 / 133 are part of one of the 7 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 169 edges and 103 vertex of which 65 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 65 transition count 109
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 62 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 58 transition count 105
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 23 place count 51 transition count 91
Iterating global reduction 3 with 7 rules applied. Total rules applied 30 place count 51 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 51 transition count 88
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 35 place count 50 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 41 place count 50 transition count 81
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 44 place count 50 transition count 81
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 47 place count 47 transition count 78
Iterating global reduction 5 with 3 rules applied. Total rules applied 50 place count 47 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 53 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 47 transition count 74
Applied a total of 54 rules in 21 ms. Remains 47 /133 variables (removed 86) and now considering 74/180 (removed 106) transitions.
[2024-05-22 03:51:39] [INFO ] Flow matrix only has 48 transitions (discarded 26 similar events)
// Phase 1: matrix 48 rows 47 cols
[2024-05-22 03:51:39] [INFO ] Computed 20 invariants in 3 ms
[2024-05-22 03:51:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 03:51:40] [INFO ] Flow matrix only has 48 transitions (discarded 26 similar events)
[2024-05-22 03:51:40] [INFO ] Invariant cache hit.
[2024-05-22 03:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:51:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-22 03:51:40] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-22 03:51:40] [INFO ] Flow matrix only has 48 transitions (discarded 26 similar events)
[2024-05-22 03:51:40] [INFO ] Invariant cache hit.
[2024-05-22 03:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/47 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 47/94 variables, 47/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/95 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 68 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2177 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/47 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 47/94 variables, 47/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 73/140 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/95 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 3671ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3673ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/133 places, 74/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3822 ms. Remains : 47/133 places, 74/180 transitions.
[2024-05-22 03:51:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:51:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 03:51:43] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-22 03:51:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 03:51:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:51:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7115967692310550642.gal : 2 ms
[2024-05-22 03:51:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2439881301194118261.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/CTLFireability7115967692310550642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2439881301194118261.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,103681,0.011126,3660,2,120,5,405,6,0,205,273,0


Converting to forward existential form...Done !
original formula: ((EF((AG((EG(((p53==0)||(p149==0))) + (((p72==0)||(p124==0))&&((p67==0)||(p117==0))))) * ((p67==0)||(p153==0)))) + AF((EF(((p57==0)||(p15...391
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!(E(TRUE U !((EG(((p53==0)||(p149==0))) + (((p72==0)||(p124==0))&&((p67==0)||(p117==0...548
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.0337,4240,1,0,13,2801,38,3,1088,899,21
FORMULA DLCround-PT-05a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 88 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 75 transition count 154
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 75 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 75 transition count 152
Applied a total of 73 rules in 5 ms. Remains 75 /133 variables (removed 58) and now considering 152/180 (removed 28) transitions.
[2024-05-22 03:51:43] [INFO ] Flow matrix only has 118 transitions (discarded 34 similar events)
// Phase 1: matrix 118 rows 75 cols
[2024-05-22 03:51:43] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 03:51:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 03:51:43] [INFO ] Flow matrix only has 118 transitions (discarded 34 similar events)
[2024-05-22 03:51:43] [INFO ] Invariant cache hit.
[2024-05-22 03:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:51:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-22 03:51:43] [INFO ] Flow matrix only has 118 transitions (discarded 34 similar events)
[2024-05-22 03:51:43] [INFO ] Invariant cache hit.
[2024-05-22 03:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 3/75 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 117/192 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 89 constraints, problems are : Problem set: 0 solved, 151 unsolved in 5510 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 3/75 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 117/192 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 151/239 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 1/193 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 240 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4642 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
After SMT, in 10183ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 10186ms
Starting structural reductions in LTL mode, iteration 1 : 75/133 places, 152/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10327 ms. Remains : 75/133 places, 152/180 transitions.
[2024-05-22 03:51:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:51:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:51:54] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-22 03:51:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 03:51:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:51:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11404619427743307294.gal : 2 ms
[2024-05-22 03:51:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6155255094955534705.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/CTLFireability11404619427743307294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6155255094955534705.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.48832e+08,0.019193,3964,2,211,5,845,6,0,410,600,0


Converting to forward existential form...Done !
original formula: AG(!(A(!(EF(((p12==1)||((p59==1)&&(p120==1))))) U EX((((AG((p67==1)) * (p74==1)) * ((p160==1)&&(p23==1))) * (p119==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX((((!(E(TRUE U !((p67==1)))) * (p74==1)) * ((p160==1)&&(p23==1))) * (p119==1))))))...400
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.054111,5072,1,0,10,6918,19,0,1725,1119,13
FORMULA DLCround-PT-05a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 89 transition count 180
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 74 transition count 150
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 74 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 74 transition count 147
Applied a total of 77 rules in 5 ms. Remains 74 /133 variables (removed 59) and now considering 147/180 (removed 33) transitions.
[2024-05-22 03:51:54] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-22 03:51:54] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 03:51:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 03:51:54] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2024-05-22 03:51:54] [INFO ] Invariant cache hit.
[2024-05-22 03:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:51:54] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 03:51:54] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2024-05-22 03:51:54] [INFO ] Invariant cache hit.
[2024-05-22 03:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 114/188 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 89 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5370 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 114/188 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 146/234 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 235 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4397 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 9792ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 9794ms
Starting structural reductions in LTL mode, iteration 1 : 74/133 places, 147/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9901 ms. Remains : 74/133 places, 147/180 transitions.
[2024-05-22 03:52:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:52:04] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:52:04] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 03:52:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16659753460876401440.gal : 2 ms
[2024-05-22 03:52:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13658227640098617111.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/CTLFireability16659753460876401440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13658227640098617111.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,1.8432e+08,0.021454,3956,2,207,5,820,6,0,400,582,0


Converting to forward existential form...Done !
original formula: EF(AX(((AX(((p73==1)&&(p157==1))) * (p37==1)) * ((p96==1) * (AF(((p39==1)&&(p102==1))) + EG(((p67==1)&&(p119==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((!(EX(!(((p73==1)&&(p157==1))))) * (p37==1)) * ((p96==1) * (!(EG(!(((p39==1)&&(p102=...207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.064114,5328,1,0,12,8120,30,3,1654,2391,13
FORMULA DLCround-PT-05a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 87 transition count 180
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 71 transition count 148
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 71 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 81 place count 71 transition count 145
Applied a total of 81 rules in 5 ms. Remains 71 /133 variables (removed 62) and now considering 145/180 (removed 35) transitions.
[2024-05-22 03:52:04] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
// Phase 1: matrix 114 rows 71 cols
[2024-05-22 03:52:04] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 03:52:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 03:52:04] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:52:04] [INFO ] Invariant cache hit.
[2024-05-22 03:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:04] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 03:52:04] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:52:04] [INFO ] Invariant cache hit.
[2024-05-22 03:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/184 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 84 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4871 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/184 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 144/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 228 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4473 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 9381ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 9385ms
Starting structural reductions in LTL mode, iteration 1 : 71/133 places, 145/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9508 ms. Remains : 71/133 places, 145/180 transitions.
[2024-05-22 03:52:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 03:52:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:13] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 03:52:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13593477985285039323.gal : 1 ms
[2024-05-22 03:52:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4799527694064182983.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/CTLFireability13593477985285039323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4799527694064182983.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.6384e+08,0.018883,3936,2,200,5,794,6,0,393,568,0


Converting to forward existential form...Done !
original formula: EX(AG((AF(((p48==1)&&(p145==1))) + AG(EF(((p57==0)||(p107==0)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EG(!(((p48==1)&&(p145==1))))) + !(E(TRUE U !(E(TRUE U ((p57==0)||(p107==0))))))))))...166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.057579,5044,1,0,11,7032,24,3,1717,1935,11
FORMULA DLCround-PT-05a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Graph (trivial) has 134 edges and 133 vertex of which 51 / 133 are part of one of the 9 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 142 edges and 91 vertex of which 50 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 50 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 47 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 44 transition count 79
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 39 transition count 72
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 39 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 39 transition count 67
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 39 transition count 67
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 36 transition count 64
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 36 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 41 place count 36 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 36 transition count 59
Applied a total of 43 rules in 16 ms. Remains 36 /133 variables (removed 97) and now considering 59/180 (removed 121) transitions.
[2024-05-22 03:52:13] [INFO ] Flow matrix only has 37 transitions (discarded 22 similar events)
// Phase 1: matrix 37 rows 36 cols
[2024-05-22 03:52:13] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 03:52:13] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 03:52:13] [INFO ] Flow matrix only has 37 transitions (discarded 22 similar events)
[2024-05-22 03:52:13] [INFO ] Invariant cache hit.
[2024-05-22 03:52:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-22 03:52:14] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-22 03:52:14] [INFO ] Flow matrix only has 37 transitions (discarded 22 similar events)
[2024-05-22 03:52:14] [INFO ] Invariant cache hit.
[2024-05-22 03:52:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 7/36 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 36/72 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 51 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 7/36 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 36/72 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 58/108 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/73 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 109 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2477ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2478ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/133 places, 59/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2597 ms. Remains : 36/133 places, 59/180 transitions.
[2024-05-22 03:52:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:16] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-22 03:52:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9253988632102475981.gal : 1 ms
[2024-05-22 03:52:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3640257097839207365.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/CTLFireability9253988632102475981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3640257097839207365.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,5041,0.008609,3584,2,94,5,329,6,0,159,218,0


Converting to forward existential form...Done !
original formula: E(AF((EF((p51==1)) * (((p21==1)&&(p118==1))||(((!(((p18==1)&&(p125==1))||((p57==1)&&(p148==1))))&&(p46==1))&&((p104==1)&&(!((p67==1)&&(p1...238
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!((E(TRUE U (p51==1)) * (((p21==1)&&(p118==1))||(((!(((p18==1)&&(p125==1))||((p57==1)&&(p148==...308
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.01716,3900,1,0,6,1508,15,0,716,403,5
FORMULA DLCround-PT-05a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Graph (trivial) has 166 edges and 133 vertex of which 74 / 133 are part of one of the 10 SCC in 0 ms
Free SCC test removed 64 places
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Graph (complete) has 91 edges and 69 vertex of which 23 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.0 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 23 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 33
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 12 place count 14 transition count 24
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 14 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 13 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 13 transition count 20
Applied a total of 26 rules in 9 ms. Remains 13 /133 variables (removed 120) and now considering 20/180 (removed 160) transitions.
[2024-05-22 03:52:16] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
// Phase 1: matrix 13 rows 13 cols
[2024-05-22 03:52:16] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 03:52:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 03:52:16] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
[2024-05-22 03:52:16] [INFO ] Invariant cache hit.
[2024-05-22 03:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-22 03:52:16] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 03:52:16] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
[2024-05-22 03:52:16] [INFO ] Invariant cache hit.
[2024-05-22 03:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 0 solved, 19 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 12/25 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/26 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 38 constraints, problems are : Problem set: 0 solved, 19 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 537ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/133 places, 20/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 602 ms. Remains : 13/133 places, 20/180 transitions.
[2024-05-22 03:52:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 03:52:17] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:52:17] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-22 03:52:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 03:52:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 03:52:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17911554171544385871.gal : 1 ms
[2024-05-22 03:52:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2849076957160765481.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/CTLFireability17911554171544385871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2849076957160765481.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,19,0.003255,3376,2,26,5,103,6,0,58,66,0


Converting to forward existential form...Done !
original formula: EG(E((p87==1) U AG(!((((p54==1)&&(p106==1))&&((p87==1)&&(p156==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E((p87==1) U !(E(TRUE U !(!((((p54==1)&&(p106==1))&&((p87==1)&&(p156==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.006602,3692,1,0,8,268,26,0,276,151,9
FORMULA DLCround-PT-05a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 94 transition count 180
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 82 transition count 156
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 82 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 82 transition count 154
Applied a total of 65 rules in 4 ms. Remains 82 /133 variables (removed 51) and now considering 154/180 (removed 26) transitions.
[2024-05-22 03:52:17] [INFO ] Flow matrix only has 119 transitions (discarded 35 similar events)
// Phase 1: matrix 119 rows 82 cols
[2024-05-22 03:52:17] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 03:52:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 03:52:17] [INFO ] Flow matrix only has 119 transitions (discarded 35 similar events)
[2024-05-22 03:52:17] [INFO ] Invariant cache hit.
[2024-05-22 03:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-05-22 03:52:17] [INFO ] Flow matrix only has 119 transitions (discarded 35 similar events)
[2024-05-22 03:52:17] [INFO ] Invariant cache hit.
[2024-05-22 03:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 9/82 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 102 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6633 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 9/82 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 118/200 variables, 82/101 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 153/254 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 255 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4583 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints]
After SMT, in 11251ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 11253ms
Starting structural reductions in LTL mode, iteration 1 : 82/133 places, 154/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11369 ms. Remains : 82/133 places, 154/180 transitions.
[2024-05-22 03:52:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:52:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:28] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-22 03:52:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 03:52:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17314838717506378943.gal : 1 ms
[2024-05-22 03:52:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3454854279148833199.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/CTLFireability17314838717506378943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3454854279148833199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09658e+08,0.024116,3988,2,226,5,893,6,0,421,618,0


Converting to forward existential form...Done !
original formula: E(((E((((p39==1)&&(p104==1))||(!((p11==1)&&(p115==1)))) U !(((p88==1)&&(p166==1)))) + A((p77==1) U !((AF(((p77==1)&&(p160==1))) + EF(((p5...344
=> equivalent forward existential formula: [(FwdU(Init,((E((((p39==1)&&(p104==1))||(!((p11==1)&&(p115==1)))) U !(((p88==1)&&(p166==1)))) + !((E(!(!((!(EG(!...607
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.068087,5096,1,0,8,8889,16,0,1793,1818,11
FORMULA DLCround-PT-05a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Graph (trivial) has 171 edges and 133 vertex of which 78 / 133 are part of one of the 10 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 81 edges and 65 vertex of which 20 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 13 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 13 transition count 16
Applied a total of 17 rules in 4 ms. Remains 13 /133 variables (removed 120) and now considering 16/180 (removed 164) transitions.
[2024-05-22 03:52:28] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 13 cols
[2024-05-22 03:52:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 03:52:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 03:52:28] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-22 03:52:28] [INFO ] Invariant cache hit.
[2024-05-22 03:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-22 03:52:28] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 03:52:28] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-22 03:52:28] [INFO ] Invariant cache hit.
[2024-05-22 03:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 15 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/23 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/23 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 36 constraints, problems are : Problem set: 0 solved, 15 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 393ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/133 places, 16/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 455 ms. Remains : 13/133 places, 16/180 transitions.
[2024-05-22 03:52:29] [INFO ] Flatten gal took : 1 ms
[2024-05-22 03:52:29] [INFO ] Flatten gal took : 0 ms
[2024-05-22 03:52:29] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-22 03:52:29] [INFO ] Flatten gal took : 0 ms
[2024-05-22 03:52:29] [INFO ] Flatten gal took : 0 ms
[2024-05-22 03:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2864199382965013192.gal : 0 ms
[2024-05-22 03:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7092088868732221211.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/CTLFireability2864199382965013192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7092088868732221211.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,19,0.003082,3360,2,28,5,98,6,0,52,61,0


Converting to forward existential form...Done !
original formula: AF(AG((EF(((p76==0)||(p160==0))) * EG((((p85==0)||(p136==0))||((p41==0)||(p143==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U ((p76==0)||(p160==0))) * EG((((p85==0)||(p136==0))||((p41==0)||(p143==0)))))...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.00709,3940,1,0,9,292,25,3,281,195,15
FORMULA DLCround-PT-05a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 87 transition count 180
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 73 transition count 152
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 73 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 73 transition count 149
Applied a total of 77 rules in 4 ms. Remains 73 /133 variables (removed 60) and now considering 149/180 (removed 31) transitions.
[2024-05-22 03:52:29] [INFO ] Flow matrix only has 116 transitions (discarded 33 similar events)
// Phase 1: matrix 116 rows 73 cols
[2024-05-22 03:52:29] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 03:52:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 03:52:29] [INFO ] Flow matrix only has 116 transitions (discarded 33 similar events)
[2024-05-22 03:52:29] [INFO ] Invariant cache hit.
[2024-05-22 03:52:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:29] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-22 03:52:29] [INFO ] Flow matrix only has 116 transitions (discarded 33 similar events)
[2024-05-22 03:52:29] [INFO ] Invariant cache hit.
[2024-05-22 03:52:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 2/73 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 115/188 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 86 constraints, problems are : Problem set: 0 solved, 148 unsolved in 5799 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 2/73 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 115/188 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 148/233 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 234 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4284 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 10103ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 10104ms
Starting structural reductions in LTL mode, iteration 1 : 73/133 places, 149/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10220 ms. Remains : 73/133 places, 149/180 transitions.
[2024-05-22 03:52:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:52:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:52:39] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-22 03:52:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:52:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:52:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7011536608963155261.gal : 2 ms
[2024-05-22 03:52:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7954609591276330027.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/CTLFireability7011536608963155261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7954609591276330027.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.0736e+08,0.019936,3952,2,206,5,823,6,0,403,587,0


Converting to forward existential form...Done !
original formula: EF(((AG(((p44==1)&&(p144==1))) * EX((p50==0))) * (EX((p51==1)) + AX(AG(((p47==0)||(p163==0)))))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * (!(E(TRUE U !(((p44==1)&&(p144==1))))) * EX((p50==0))))) * (p51==1))] != FALSE + [((Fwd...287
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.054774,5324,1,0,10,7309,19,0,1691,1349,11
FORMULA DLCround-PT-05a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Graph (trivial) has 144 edges and 133 vertex of which 60 / 133 are part of one of the 9 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 123 edges and 82 vertex of which 39 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 64
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 37 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 36 transition count 63
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 15 place count 29 transition count 53
Iterating global reduction 3 with 7 rules applied. Total rules applied 22 place count 29 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 29 transition count 51
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 26 place count 28 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 29 place count 28 transition count 47
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 31 place count 28 transition count 47
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 33 place count 26 transition count 45
Iterating global reduction 5 with 2 rules applied. Total rules applied 35 place count 26 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 37 place count 26 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 26 transition count 42
Applied a total of 38 rules in 14 ms. Remains 26 /133 variables (removed 107) and now considering 42/180 (removed 138) transitions.
[2024-05-22 03:52:39] [INFO ] Flow matrix only has 26 transitions (discarded 16 similar events)
// Phase 1: matrix 26 rows 26 cols
[2024-05-22 03:52:39] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 03:52:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 03:52:39] [INFO ] Flow matrix only has 26 transitions (discarded 16 similar events)
[2024-05-22 03:52:39] [INFO ] Invariant cache hit.
[2024-05-22 03:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:39] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-22 03:52:39] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-22 03:52:39] [INFO ] Flow matrix only has 26 transitions (discarded 16 similar events)
[2024-05-22 03:52:39] [INFO ] Invariant cache hit.
[2024-05-22 03:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 5/26 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 38 constraints, problems are : Problem set: 0 solved, 41 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 5/26 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 41/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/52 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 79 constraints, problems are : Problem set: 0 solved, 41 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1698ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/133 places, 42/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1786 ms. Remains : 26/133 places, 42/180 transitions.
[2024-05-22 03:52:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:41] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-22 03:52:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 03:52:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2275413912738706219.gal : 1 ms
[2024-05-22 03:52:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13493891129283335613.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/CTLFireability2275413912738706219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13493891129283335613.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,421,0.005833,3496,2,66,5,232,6,0,114,152,0


Converting to forward existential form...Done !
original formula: AG((EF(((!(A((p79==1) U ((p57==1)&&(p164==1)))) * EF(((p57==0)||(p105==0)))) * (((p37==0)||(p140==0))&&((p51==0)||(p108==0))))) * EF((((p...186
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((!(!((E(!(((p57==1)&&(p164==1))) U (!((p79==1)) * !(((p57==1)&&(p164==1))))) + ...362
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 34/0/8
(forward)formula 0,1,0.017152,4076,1,0,11,1040,31,2,589,433,19
FORMULA DLCround-PT-05a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 85 transition count 180
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 70 transition count 150
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 70 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 70 transition count 148
Applied a total of 80 rules in 15 ms. Remains 70 /133 variables (removed 63) and now considering 148/180 (removed 32) transitions.
[2024-05-22 03:52:41] [INFO ] Flow matrix only has 116 transitions (discarded 32 similar events)
// Phase 1: matrix 116 rows 70 cols
[2024-05-22 03:52:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 03:52:41] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 03:52:41] [INFO ] Flow matrix only has 116 transitions (discarded 32 similar events)
[2024-05-22 03:52:41] [INFO ] Invariant cache hit.
[2024-05-22 03:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 03:52:41] [INFO ] Flow matrix only has 116 transitions (discarded 32 similar events)
[2024-05-22 03:52:41] [INFO ] Invariant cache hit.
[2024-05-22 03:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 115/185 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 81 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4784 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 115/185 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 147/227 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 1/186 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 228 constraints, problems are : Problem set: 0 solved, 147 unsolved in 3288 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 8101ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 8105ms
Starting structural reductions in LTL mode, iteration 1 : 70/133 places, 148/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8419 ms. Remains : 70/133 places, 148/180 transitions.
[2024-05-22 03:52:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 03:52:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:52:49] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-22 03:52:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:52:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 03:52:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16312567620532551590.gal : 1 ms
[2024-05-22 03:52:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16861019551613427825.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/CTLFireability16312567620532551590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16861019551613427825.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,1.96608e+08,0.021369,3952,2,218,5,933,6,0,397,679,0


Converting to forward existential form...Done !
original formula: EX((p2==0))
=> equivalent forward existential formula: [(EY(Init) * (p2==0))] != FALSE
(forward)formula 0,1,0.025559,4268,1,0,7,933,8,1,482,679,2
FORMULA DLCround-PT-05a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 89 transition count 180
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 74 transition count 150
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 74 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 74 transition count 147
Applied a total of 77 rules in 5 ms. Remains 74 /133 variables (removed 59) and now considering 147/180 (removed 33) transitions.
[2024-05-22 03:52:49] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-22 03:52:49] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 03:52:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 03:52:49] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2024-05-22 03:52:49] [INFO ] Invariant cache hit.
[2024-05-22 03:52:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:49] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 03:52:49] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2024-05-22 03:52:49] [INFO ] Invariant cache hit.
[2024-05-22 03:52:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 114/188 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 89 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 114/188 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 146/234 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 235 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 8841ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 8844ms
Starting structural reductions in LTL mode, iteration 1 : 74/133 places, 147/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8957 ms. Remains : 74/133 places, 147/180 transitions.
[2024-05-22 03:52:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 03:52:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:52:58] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 03:52:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:52:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7679058993824741136.gal : 2 ms
[2024-05-22 03:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4573359236476949569.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/CTLFireability7679058993824741136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4573359236476949569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.8432e+08,0.02108,3948,2,207,5,820,6,0,400,582,0


Converting to forward existential form...Done !
original formula: (AG(EX((((p59==1)&&(p153==1))||((p47==1)&&(p142==1))))) + AG((((p37==0)||(p93==0)) * EX(((p47==0)||(p102==0))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(E(TRUE U !(EX((((p59==1)&&(p153==1))||((p47==1)&&(p142==1))))))))),TRUE) * !(((p37==0)||(p93...307
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.067955,5056,1,0,12,8518,18,4,1824,2651,11
FORMULA DLCround-PT-05a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 180/180 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 89 transition count 180
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 73 transition count 148
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 73 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 73 transition count 145
Applied a total of 79 rules in 5 ms. Remains 73 /133 variables (removed 60) and now considering 145/180 (removed 35) transitions.
[2024-05-22 03:52:58] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
// Phase 1: matrix 114 rows 73 cols
[2024-05-22 03:52:58] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 03:52:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 03:52:58] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:52:58] [INFO ] Invariant cache hit.
[2024-05-22 03:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:52:58] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 03:52:59] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:52:59] [INFO ] Invariant cache hit.
[2024-05-22 03:52:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/73 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/186 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/187 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 88 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4248 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/73 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/186 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 144/231 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/187 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 232 constraints, problems are : Problem set: 0 solved, 144 unsolved in 3309 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 7582ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 7586ms
Starting structural reductions in LTL mode, iteration 1 : 73/133 places, 145/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7710 ms. Remains : 73/133 places, 145/180 transitions.
[2024-05-22 03:53:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 03:53:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 03:53:06] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 03:53:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 03:53:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 03:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2243537765633065764.gal : 1 ms
[2024-05-22 03:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12228893097386572921.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/CTLFireability2243537765633065764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12228893097386572921.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.6384e+08,0.035737,3940,2,204,5,806,6,0,395,574,0


Converting to forward existential form...Done !
original formula: EF(AX((((p46==0)||(p143==0))&&(((p87==1)&&(p129==1))||(((p36==1)&&(p90==1))&&((p67==1)&&(p149==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((p46==0)||(p143==0))&&(((p87==1)&&(p129==1))||(((p36==1)&&(p90==1))&&((p67==1)&&(p1...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.116781,4784,1,0,8,7814,11,2,1563,2152,4
FORMULA DLCround-PT-05a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 03:53:06] [INFO ] Flatten gal took : 8 ms
[2024-05-22 03:53:06] [INFO ] Flatten gal took : 8 ms
Total runtime 102559 ms.

BK_STOP 1716349986970

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-05a"
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 DLCround-PT-05a, 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 r114-smll-171624275400146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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