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.r180-tall-171640602600082.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 FlexibleBarrier-PT-14a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K 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 51K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 10:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 10:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 169K 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 FlexibleBarrier-PT-14a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-14a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716422457163

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 00:00:58] [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-23 00:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:00:58] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-23 00:00:58] [INFO ] Transformed 171 places.
[2024-05-23 00:00:58] [INFO ] Transformed 578 transitions.
[2024-05-23 00:00:58] [INFO ] Found NUPN structural information;
[2024-05-23 00:00:58] [INFO ] Parsed PT model containing 171 places and 578 transitions and 2719 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 408/408 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 394
Applied a total of 14 rules in 27 ms. Remains 171 /171 variables (removed 0) and now considering 394/408 (removed 14) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-23 00:00:58] [INFO ] Computed 16 invariants in 20 ms
[2024-05-23 00:00:58] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-23 00:00:58] [INFO ] Invariant cache hit.
[2024-05-23 00:00:59] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-23 00:00:59] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-23 00:00:59] [INFO ] Invariant cache hit.
[2024-05-23 00:00:59] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15511 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14657 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 30460ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 30486ms
Starting structural reductions in LTL mode, iteration 1 : 171/171 places, 394/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31091 ms. Remains : 171/171 places, 394/408 transitions.
Support contains 64 out of 171 places after structural reductions.
[2024-05-23 00:01:29] [INFO ] Flatten gal took : 47 ms
[2024-05-23 00:01:29] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:01:30] [INFO ] Input system was already deterministic with 394 transitions.
Support contains 62 out of 171 places (down from 64) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 76 to 75
RANDOM walk for 40000 steps (8 resets) in 1898 ms. (21 steps per ms) remains 2/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-05-23 00:01:30] [INFO ] Invariant cache hit.
[2024-05-23 00:01:30] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp68 is UNSAT
After SMT solving in domain Real declared 63/565 variables, and 16 constraints, problems are : Problem set: 2 solved, 0 unsolved in 34 ms.
Refiners :[Domain max(s): 9/171 constraints, Positive P Invariants (semi-flows): 7/16 constraints, State Equation: 0/171 constraints, ReadFeed: 0/253 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-23 00:01:30] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:01:30] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:01:30] [INFO ] Input system was already deterministic with 394 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-23 00:01:30] [INFO ] Invariant cache hit.
[2024-05-23 00:01:31] [INFO ] Implicit Places using invariants in 155 ms returned [169, 170]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 157 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/171 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 169/171 places, 394/394 transitions.
[2024-05-23 00:01:31] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:01:31] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:01:31] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:01:31] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:01:31] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:01:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14259411268941106296.gal : 10 ms
[2024-05-23 00:01:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13375299386303943654.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/CTLFireability14259411268941106296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13375299386303943654.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.28392e+15,0.302856,16304,2,7308,5,74436,6,0,1072,44613,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U (p87==1))
=> equivalent forward existential formula: [(FwdU(Init,EX(TRUE)) * (p87==1))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.64694,98468,1,0,7,634374,11,1,5274,103118,5
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-23 00:01:34] [INFO ] Invariant cache hit.
[2024-05-23 00:01:34] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-23 00:01:34] [INFO ] Invariant cache hit.
[2024-05-23 00:01:34] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-23 00:01:34] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-23 00:01:34] [INFO ] Invariant cache hit.
[2024-05-23 00:01:34] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14876 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14319 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 29381ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 29385ms
Finished structural reductions in LTL mode , in 1 iterations and 29754 ms. Remains : 171/171 places, 394/394 transitions.
[2024-05-23 00:02:03] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:02:03] [INFO ] Flatten gal took : 27 ms
[2024-05-23 00:02:03] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:02:03] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:02:03] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16578626837353352702.gal : 4 ms
[2024-05-23 00:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12710910632317315082.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16578626837353352702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12710910632317315082.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.28392e+15,6.38838,189440,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: E(!((((E(AF((((p48==1)&&(p83==1))&&(p169==1))) U ((p23==1)&&(p169==1))) * AG((((p132==1)&&(p167==1))&&(p169==1)))) + (p34==1)) + ((((AX((...375
=> equivalent forward existential formula: [(FwdU(Init,!((((E(!(EG(!((((p48==1)&&(p83==1))&&(p169==1))))) U ((p23==1)&&(p169==1))) * !(E(TRUE U !((((p132==...451
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,8.80293,189440,1,0,6,1.02525e+06,11,0,5440,583984,4
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-01 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 : 171/171 places, 394/394 transitions.
Graph (trivial) has 140 edges and 171 vertex of which 42 / 171 are part of one of the 14 SCC in 5 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 129 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 0 with 91 rules applied. Total rules applied 120 place count 129 transition count 183
Applied a total of 120 rules in 49 ms. Remains 129 /171 variables (removed 42) and now considering 183/394 (removed 211) transitions.
[2024-05-23 00:02:12] [INFO ] Flow matrix only has 170 transitions (discarded 13 similar events)
// Phase 1: matrix 170 rows 129 cols
[2024-05-23 00:02:12] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 00:02:13] [INFO ] Implicit Places using invariants in 183 ms returned [128]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 185 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 128/171 places, 183/394 transitions.
Graph (trivial) has 167 edges and 128 vertex of which 70 / 128 are part of one of the 14 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 72 transition count 85
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 58 transition count 85
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 58 transition count 72
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 45 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 45 transition count 58
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 97 place count 31 transition count 44
Applied a total of 97 rules in 11 ms. Remains 31 /128 variables (removed 97) and now considering 44/183 (removed 139) transitions.
[2024-05-23 00:02:13] [INFO ] Flow matrix only has 31 transitions (discarded 13 similar events)
// Phase 1: matrix 31 rows 31 cols
[2024-05-23 00:02:13] [INFO ] Computed 15 invariants in 0 ms
[2024-05-23 00:02:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 00:02:13] [INFO ] Flow matrix only has 31 transitions (discarded 13 similar events)
[2024-05-23 00:02:13] [INFO ] Invariant cache hit.
[2024-05-23 00:02:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 00:02:13] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 31/171 places, 44/394 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 311 ms. Remains : 31/171 places, 44/394 transitions.
[2024-05-23 00:02:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:02:13] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:02:13] [INFO ] Input system was already deterministic with 44 transitions.
RANDOM walk for 141 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:02:13] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:02:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:02:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1931993806750748947.gal : 0 ms
[2024-05-23 00:02:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17836138708837496632.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1931993806750748947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17836138708837496632.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-23 00:02:13] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 00:02:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 00:02:13] [INFO ] Invariant cache hit.
[2024-05-23 00:02:13] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-23 00:02:13] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-23 00:02:13] [INFO ] Invariant cache hit.
[2024-05-23 00:02:13] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15377 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14399 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 29954ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 29960ms
Finished structural reductions in LTL mode , in 1 iterations and 30215 ms. Remains : 171/171 places, 394/394 transitions.
[2024-05-23 00:02:43] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:02:43] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:02:43] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:02:43] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:02:43] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:02:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6045211616735337609.gal : 2 ms
[2024-05-23 00:02:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3435951987410485753.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/CTLFireability6045211616735337609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3435951987410485753.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.28392e+15,6.40566,189276,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: EX((E((((p60==1)&&(p83==1))&&(p169==1)) U (E(!((((p23==1)&&(p156==1))&&(p169==1))) U (((p54==1)&&(p169==1))&&((p9==1)&&(p170==1)))) + (((...607
=> equivalent forward existential formula: (([((EY(Init) * E((((p60==1)&&(p83==1))&&(p169==1)) U (E(!((((p23==1)&&(p156==1))&&(p169==1))) U (((p54==1)&&(p1...1468
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 205/0/189
Hit Full ! (commute/partial/dont) 205/327/189
(forward)formula 0,1,14.6777,335836,1,0,17,2.50684e+06,43,2,6788,688262,21
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 125 edges and 171 vertex of which 24 / 171 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 144 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 118 transitions
Redundant transition composition rules discarded 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 141 place count 144 transition count 228
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 144 transition count 228
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 141 transition count 225
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 141 transition count 225
Applied a total of 150 rules in 54 ms. Remains 141 /171 variables (removed 30) and now considering 225/394 (removed 169) transitions.
[2024-05-23 00:02:58] [INFO ] Flow matrix only has 218 transitions (discarded 7 similar events)
// Phase 1: matrix 218 rows 141 cols
[2024-05-23 00:02:58] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 00:02:58] [INFO ] Implicit Places using invariants in 94 ms returned [140]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/171 places, 225/394 transitions.
Graph (trivial) has 168 edges and 140 vertex of which 52 / 140 are part of one of the 14 SCC in 0 ms
Free SCC test removed 38 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 102 transition count 151
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 82 transition count 151
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 41 place count 82 transition count 137
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 69 place count 68 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 68 transition count 129
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 93 place count 60 transition count 121
Applied a total of 93 rules in 21 ms. Remains 60 /140 variables (removed 80) and now considering 121/225 (removed 104) transitions.
[2024-05-23 00:02:58] [INFO ] Flow matrix only has 108 transitions (discarded 13 similar events)
// Phase 1: matrix 108 rows 60 cols
[2024-05-23 00:02:58] [INFO ] Computed 15 invariants in 0 ms
[2024-05-23 00:02:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 00:02:58] [INFO ] Flow matrix only has 108 transitions (discarded 13 similar events)
[2024-05-23 00:02:58] [INFO ] Invariant cache hit.
[2024-05-23 00:02:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 00:02:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/171 places, 121/394 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 261 ms. Remains : 60/171 places, 121/394 transitions.
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:02:58] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:02:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11124475754133417294.gal : 1 ms
[2024-05-23 00:02:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11471114929684581660.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/CTLFireability11124475754133417294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11471114929684581660.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,3.01181e+07,0.027359,4656,2,570,5,5325,6,0,347,3411,0


Converting to forward existential form...Done !
original formula: AF((EF(AG((((p59==0)||(p120==0))||(p169==0)))) + (((p95==1)&&(p132==1))&&((p169==1)&&(((p71==0)||(p156==0))||(p169==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(E(TRUE U !((((p59==0)||(p120==0))||(p169==0)))))) + (((p95==1)&&(p132==1))&&((p169==1)&...204
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.310365,17420,1,0,114,68891,22,75,1843,80221,85
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-23 00:02:58] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 00:02:58] [INFO ] Implicit Places using invariants in 88 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 170/171 places, 394/394 transitions.
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:02:58] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:02:58] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:02:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7431972012906884740.gal : 2 ms
[2024-05-23 00:02:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2339574594882377550.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/CTLFireability7431972012906884740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2339574594882377550.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.28392e+15,2.19551,74940,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: E(!(EG((((p59==1)&&(p144==1))&&(p169==1)))) U AX((((p96==1)&&(p143==1))&&(p169==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG((((p59==1)&&(p144==1))&&(p169==1))))) * !(EX(!((((p96==1)&&(p143==1))&&(p169==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,5.3203,142808,1,0,6,895917,11,0,5270,240937,4
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-23 00:03:04] [INFO ] Invariant cache hit.
[2024-05-23 00:03:04] [INFO ] Implicit Places using invariants in 86 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 170/171 places, 394/394 transitions.
[2024-05-23 00:03:04] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:04] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:04] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:03:04] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:04] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15015432202247149256.gal : 2 ms
[2024-05-23 00:03:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7002226373610019028.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/CTLFireability15015432202247149256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7002226373610019028.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.28392e+15,2.17778,74732,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: (AX((((p23==1)&&(p108==1))&&(p169==1))) + ((E(!((AF((p37==1)) + (p70!=1))) U A(A((p101==1) U (((p108==1)&&(p143==1))&&(p169==1))) U AF(((...359
=> equivalent forward existential formula: ([(((Init * !(!(EX(!((((p23==1)&&(p108==1))&&(p169==1))))))) * !(E(((p5!=1) + EG((p85==1))) U (p0==1)))) * !(E(!...748
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 205/0/189
Using saturation style SCC detection
(forward)formula 0,1,12.0046,359640,1,0,56,2.52342e+06,64,36,6319,1.20415e+06,57
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 130 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 139 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 0 with 121 rules applied. Total rules applied 146 place count 139 transition count 205
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 139 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 150 place count 137 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 137 transition count 203
Applied a total of 152 rules in 25 ms. Remains 137 /171 variables (removed 34) and now considering 203/394 (removed 191) transitions.
[2024-05-23 00:03:16] [INFO ] Flow matrix only has 194 transitions (discarded 9 similar events)
// Phase 1: matrix 194 rows 137 cols
[2024-05-23 00:03:16] [INFO ] Computed 16 invariants in 0 ms
[2024-05-23 00:03:16] [INFO ] Implicit Places using invariants in 66 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 136/171 places, 203/394 transitions.
Graph (trivial) has 168 edges and 136 vertex of which 58 / 136 are part of one of the 14 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 92 transition count 121
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 74 transition count 121
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 37 place count 74 transition count 107
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 60 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 60 transition count 97
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 95 place count 50 transition count 87
Applied a total of 95 rules in 8 ms. Remains 50 /136 variables (removed 86) and now considering 87/203 (removed 116) transitions.
[2024-05-23 00:03:16] [INFO ] Flow matrix only has 74 transitions (discarded 13 similar events)
// Phase 1: matrix 74 rows 50 cols
[2024-05-23 00:03:16] [INFO ] Computed 15 invariants in 0 ms
[2024-05-23 00:03:16] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 00:03:16] [INFO ] Flow matrix only has 74 transitions (discarded 13 similar events)
[2024-05-23 00:03:16] [INFO ] Invariant cache hit.
[2024-05-23 00:03:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 00:03:16] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/171 places, 87/394 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 258 ms. Remains : 50/171 places, 87/394 transitions.
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:03:16] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:03:16] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:03:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9692855930411598640.gal : 1 ms
[2024-05-23 00:03:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14748494086828878194.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/CTLFireability9692855930411598640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14748494086828878194.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.45862e+06,0.014315,3868,2,233,5,2414,6,0,273,1762,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((((p23==1)&&(p48==1))&&(p169==1))||(((p84==1)&&(p131==1))&&(p169==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((((p23==1)&&(p48==1))&&(p169==1))||(((p84==1)&&(p131==1))&&(p169==1))))...171
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.040926,4976,1,0,7,7622,23,0,1415,3056,9
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-23 00:03:16] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 00:03:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-23 00:03:17] [INFO ] Invariant cache hit.
[2024-05-23 00:03:17] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-23 00:03:17] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-23 00:03:17] [INFO ] Invariant cache hit.
[2024-05-23 00:03:17] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15166 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14637 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 29965ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 29971ms
Finished structural reductions in LTL mode , in 1 iterations and 30295 ms. Remains : 171/171 places, 394/394 transitions.
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:03:47] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:03:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8885440046461198055.gal : 2 ms
[2024-05-23 00:03:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3484944810380421804.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/CTLFireability8885440046461198055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3484944810380421804.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.28392e+15,6.39748,189312,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: (AG(((AG((p113==0)) + (((((p95==0)||(p120==0))||(p169==0))&&((p141==0)||(p170==0)))&&(p1==0))) + ((p5==0)||(p170==0)))) * E((EF((((EG((((...425
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((p5==0)||(p170==0)))) * !((((((p95==0)||(p120==0))||(p169==0))&&((p141==0)||(p170...526
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,20.2966,473104,1,0,31,3.547e+06,52,17,6460,1.09873e+06,28
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 127 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 139 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 137 place count 139 transition count 214
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 139 place count 139 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 141 place count 137 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 143 place count 137 transition count 212
Applied a total of 143 rules in 29 ms. Remains 137 /171 variables (removed 34) and now considering 212/394 (removed 182) transitions.
[2024-05-23 00:04:07] [INFO ] Flow matrix only has 195 transitions (discarded 17 similar events)
// Phase 1: matrix 195 rows 137 cols
[2024-05-23 00:04:07] [INFO ] Computed 16 invariants in 1 ms
[2024-05-23 00:04:07] [INFO ] Implicit Places using invariants in 68 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 136/171 places, 212/394 transitions.
Graph (trivial) has 163 edges and 136 vertex of which 53 / 136 are part of one of the 13 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 96 transition count 136
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 78 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 77 transition count 135
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 39 place count 77 transition count 121
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 67 place count 63 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 76 place count 63 transition count 112
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 94 place count 54 transition count 103
Applied a total of 94 rules in 8 ms. Remains 54 /136 variables (removed 82) and now considering 103/212 (removed 109) transitions.
[2024-05-23 00:04:07] [INFO ] Flow matrix only has 82 transitions (discarded 21 similar events)
// Phase 1: matrix 82 rows 54 cols
[2024-05-23 00:04:07] [INFO ] Computed 15 invariants in 0 ms
[2024-05-23 00:04:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 00:04:07] [INFO ] Flow matrix only has 82 transitions (discarded 21 similar events)
[2024-05-23 00:04:07] [INFO ] Invariant cache hit.
[2024-05-23 00:04:07] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 00:04:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/171 places, 103/394 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 215 ms. Remains : 54/171 places, 103/394 transitions.
[2024-05-23 00:04:07] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:04:07] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:04:07] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-23 00:04:07] [INFO ] Flatten gal took : 2 ms
[2024-05-23 00:04:07] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:04:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16817932450962784997.gal : 1 ms
[2024-05-23 00:04:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11824424586063502911.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/CTLFireability16817932450962784997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11824424586063502911.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,7.37587e+06,0.016703,3924,2,336,5,2662,6,0,305,1760,0


Converting to forward existential form...Done !
original formula: EG((EF(((((p13==1)||((p11==1)&&(p169==1)))&&(p12==1))&&((p95==1)&&(p169==1)))) * (((p83==0)||(p132==0))||(p169==0))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((((p13==1)||((p11==1)&&(p169==1)))&&(p12==1))&&((p95==1)&&(p169==1)))) * (((p83==0)||(p132...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.260509,15592,1,0,98,54021,21,65,1532,74304,75
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-23 00:04:08] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 00:04:08] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 00:04:08] [INFO ] Invariant cache hit.
[2024-05-23 00:04:08] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-23 00:04:08] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-23 00:04:08] [INFO ] Invariant cache hit.
[2024-05-23 00:04:08] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15480 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14533 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 30198ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Finished structural reductions in LTL mode , in 1 iterations and 30472 ms. Remains : 171/171 places, 394/394 transitions.
[2024-05-23 00:04:38] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:04:38] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:04:38] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:04:38] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:04:38] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:04:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15744957407746193321.gal : 3 ms
[2024-05-23 00:04:38] [INFO ] Time to serialize properties into /tmp/CTLFireability986700361303435000.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/CTLFireability15744957407746193321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability986700361303435000.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.28392e+15,6.43306,189468,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: AF(E(EX((((EX((((p72==1)&&(p107==1))&&(p169==1))) * (p1==1)) * ((p26==1)&&(p170==1))) * (((p60==1)&&(p119==1))&&(p169==1)))) U (!(EF(AX((...368
=> equivalent forward existential formula: [FwdG(Init,!(E(EX((((EX((((p72==1)&&(p107==1))&&(p169==1))) * (p1==1)) * ((p26==1)&&(p170==1))) * (((p60==1)&&(p...508
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 323/69/71
(forward)formula 0,1,11.6053,228936,1,0,24,1.55046e+06,45,12,6312,583984,24
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-23 00:04:50] [INFO ] Invariant cache hit.
[2024-05-23 00:04:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 00:04:50] [INFO ] Invariant cache hit.
[2024-05-23 00:04:50] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-23 00:04:50] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-23 00:04:50] [INFO ] Invariant cache hit.
[2024-05-23 00:04:50] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15050 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14390 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 29592ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 29600ms
Finished structural reductions in LTL mode , in 1 iterations and 29864 ms. Remains : 171/171 places, 394/394 transitions.
[2024-05-23 00:05:20] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:20] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:05:20] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:05:20] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:20] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1178825396325848214.gal : 1 ms
[2024-05-23 00:05:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5976751869046568959.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/CTLFireability1178825396325848214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5976751869046568959.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.28392e+15,6.33758,189528,2,9851,5,1.02525e+06,6,0,1076,583984,0


Converting to forward existential form...Done !
original formula: EX((!(E(E(!((((p11==1)&&(p60==1))&&(p169==1))) U A((p140==1) U ((p54==1)&&(p169==1)))) U (AX((((p23==1)&&(p156==1))&&(p169==1))) * !(EG((...377
=> equivalent forward existential formula: ([(EY(Init) * !(E(E(!((((p11==1)&&(p60==1))&&(p169==1))) U !((E(!(((p54==1)&&(p169==1))) U (!((p140==1)) * !(((p...830
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 209/0/185
Hit Full ! (commute/partial/dont) 205/0/189
(forward)formula 0,1,13.2936,286216,1,0,14,2.02234e+06,44,3,6410,695239,18
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-23 00:05:33] [INFO ] Invariant cache hit.
[2024-05-23 00:05:33] [INFO ] Implicit Places using invariants in 93 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 170/171 places, 394/394 transitions.
[2024-05-23 00:05:33] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:05:33] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:33] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:05:33] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:33] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18350455959704470029.gal : 2 ms
[2024-05-23 00:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14525026805632884665.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/CTLFireability18350455959704470029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14525026805632884665.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.28392e+15,2.173,75492,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: AG((((AX(EF((((p12==0)||(p95==0))||(p169==0)))) + (p24==0)) + ((p167==0)||(p169==0))) + ((((p72==0)||(p131==0))||(p169==0))&&(((p60==0)||...180
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((((p72==0)||(p131==0))||(p169==0))&&(((p60==0)||(p167==0))||(p169==0))))) * !(((p16...249
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,5.32327,144032,1,0,6,883131,14,0,5548,240937,5
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 118 edges and 171 vertex of which 21 / 171 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 147 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 106 transitions
Redundant transition composition rules discarded 106 transitions
Iterating global reduction 0 with 106 rules applied. Total rules applied 127 place count 147 transition count 249
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 147 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 138 place count 143 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 142 place count 143 transition count 245
Applied a total of 142 rules in 17 ms. Remains 143 /171 variables (removed 28) and now considering 245/394 (removed 149) transitions.
[2024-05-23 00:05:39] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
// Phase 1: matrix 233 rows 143 cols
[2024-05-23 00:05:39] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 00:05:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 00:05:39] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
[2024-05-23 00:05:39] [INFO ] Invariant cache hit.
[2024-05-23 00:05:39] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-23 00:05:39] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-23 00:05:39] [INFO ] Redundant transitions in 12 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-23 00:05:39] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
[2024-05-23 00:05:39] [INFO ] Invariant cache hit.
[2024-05-23 00:05:39] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 232/375 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 1/376 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 289 constraints, problems are : Problem set: 0 solved, 244 unsolved in 9050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 143/143 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 232/375 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 244/532 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 533 constraints, problems are : Problem set: 0 solved, 244 unsolved in 8620 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 143/143 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 17717ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 17719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 143/171 places, 245/394 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17963 ms. Remains : 143/171 places, 245/394 transitions.
[2024-05-23 00:05:57] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:05:57] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:05:57] [INFO ] Input system was already deterministic with 245 transitions.
[2024-05-23 00:05:57] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:05:57] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:05:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12534560900030329040.gal : 1 ms
[2024-05-23 00:05:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6069612264086376877.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/CTLFireability12534560900030329040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6069612264086376877.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,9.03821e+13,1.12598,43100,2,1975,5,240283,6,0,808,131530,0


Converting to forward existential form...Done !
original formula: E(AG(!((E(EF((p99==1)) U !((((p83==1)&&(p108==1))&&(p169==1)))) * !(AF((((p72==1)&&(p155==1))&&(p169==1))))))) U AG(AF(((((p11==1)&&(p36=...242
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((E(E(TRUE U (p99==1)) U !((((p83==1)&&(p108==1))&&(p169==1)))) * !(!(EG(!((((p72==1)&...330
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.53824,43100,1,0,7,240283,23,0,4153,131530,9
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-23 00:05:58] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 00:05:58] [INFO ] Implicit Places using invariants in 82 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 170/171 places, 394/394 transitions.
[2024-05-23 00:05:58] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:05:58] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:58] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-23 00:05:58] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:58] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:05:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3051616209148580311.gal : 2 ms
[2024-05-23 00:05:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13559718650917257586.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/CTLFireability3051616209148580311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13559718650917257586.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.28392e+15,2.19451,75444,2,12173,5,421813,6,0,1074,240937,0


Converting to forward existential form...Done !
original formula: AX(AX((((p132==1)&&(p143==1))&&(p169==1))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !((((p132==1)&&(p143==1))&&(p169==1))))] = FALSE
(forward)formula 0,0,2.21418,75444,1,0,10,421813,9,2,1549,240937,3
FORMULA FlexibleBarrier-PT-14a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-23 00:06:01] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:06:01] [INFO ] Flatten gal took : 7 ms
Total runtime 302767 ms.

BK_STOP 1716422761166

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-14a"
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 FlexibleBarrier-PT-14a, 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 r180-tall-171640602600082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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