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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 09:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 09:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 13 09:45 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 94K 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-10a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716418514177

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 22:55:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:55:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:55:15] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 22:55:15] [INFO ] Transformed 123 places.
[2024-05-22 22:55:15] [INFO ] Transformed 334 transitions.
[2024-05-22 22:55:15] [INFO ] Found NUPN structural information;
[2024-05-22 22:55:15] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
Support contains 65 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 21 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:55:15] [INFO ] Computed 12 invariants in 18 ms
[2024-05-22 22:55:15] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 22:55:15] [INFO ] Invariant cache hit.
[2024-05-22 22:55:15] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:55:16] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:55:16] [INFO ] Invariant cache hit.
[2024-05-22 22:55:16] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6828 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6467 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 13503ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 13518ms
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13971 ms. Remains : 123/123 places, 242/252 transitions.
Support contains 65 out of 123 places after structural reductions.
[2024-05-22 22:55:29] [INFO ] Flatten gal took : 36 ms
[2024-05-22 22:55:29] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:55:29] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 80 to 76
RANDOM walk for 40000 steps (8 resets) in 1723 ms. (23 steps per ms) remains 5/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
[2024-05-22 22:55:30] [INFO ] Invariant cache hit.
[2024-05-22 22:55:30] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
After SMT solving in domain Real declared 87/365 variables, and 25 constraints, problems are : Problem set: 5 solved, 0 unsolved in 45 ms.
Refiners :[Domain max(s): 16/123 constraints, Positive P Invariants (semi-flows): 9/12 constraints, State Equation: 0/123 constraints, ReadFeed: 0/141 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:55:30] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:55:30] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:55:30] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 76 edges and 123 vertex of which 6 / 123 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 113 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 37 place count 113 transition count 208
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 113 transition count 208
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 109 transition count 204
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 109 transition count 204
Applied a total of 50 rules in 65 ms. Remains 109 /123 variables (removed 14) and now considering 204/242 (removed 38) transitions.
[2024-05-22 22:55:30] [INFO ] Flow matrix only has 203 transitions (discarded 1 similar events)
// Phase 1: matrix 203 rows 109 cols
[2024-05-22 22:55:30] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 22:55:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 22:55:30] [INFO ] Flow matrix only has 203 transitions (discarded 1 similar events)
[2024-05-22 22:55:30] [INFO ] Invariant cache hit.
[2024-05-22 22:55:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-22 22:55:30] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-22 22:55:30] [INFO ] Redundant transitions in 9 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-22 22:55:30] [INFO ] Flow matrix only has 203 transitions (discarded 1 similar events)
[2024-05-22 22:55:30] [INFO ] Invariant cache hit.
[2024-05-22 22:55:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 202/311 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 119/240 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 1/312 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 241 constraints, problems are : Problem set: 0 solved, 203 unsolved in 6170 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 109/109 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 202/311 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 119/240 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 203/443 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 444 constraints, problems are : Problem set: 0 solved, 203 unsolved in 6084 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 109/109 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 12316ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 12319ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/123 places, 204/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12570 ms. Remains : 109/123 places, 204/242 transitions.
[2024-05-22 22:55:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:55:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:55:43] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-22 22:55:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:55:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:55:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2899775336898957006.gal : 7 ms
[2024-05-22 22:55:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9715975203043340238.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/CTLFireability2899775336898957006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9715975203043340238.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.72196e+10,0.459579,21668,2,1817,5,105047,6,0,636,60275,0


Converting to forward existential form...Done !
original formula: A(EF((((!((((p93==1)&&(p122==1))&&((p84==1)&&(p107==1)))&&(p121==1)))&&(p96==1))&&((p107==1)&&(p121==1)))) U EF((((AG((((p24==1)&&(p47==1...319
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (((!(E(TRUE U !((((p24==1)&&(p47==1))&&(p121==1))))) * !((((p71==1)&&(p108==1))&&(p121...838
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.916888,28680,1,0,12,152245,23,1,3441,60275,15
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 93 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 98 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 77 place count 98 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 98 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 97 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 97 transition count 137
Applied a total of 80 rules in 34 ms. Remains 97 /123 variables (removed 26) and now considering 137/242 (removed 105) transitions.
[2024-05-22 22:55:44] [INFO ] Flow matrix only has 130 transitions (discarded 7 similar events)
// Phase 1: matrix 130 rows 97 cols
[2024-05-22 22:55:44] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 22:55:44] [INFO ] Implicit Places using invariants in 62 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 96/123 places, 137/242 transitions.
Graph (trivial) has 117 edges and 96 vertex of which 39 / 96 are part of one of the 9 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 66 transition count 80
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 53 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 53 transition count 70
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 47 place count 43 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 43 transition count 63
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 36 transition count 56
Applied a total of 68 rules in 11 ms. Remains 36 /96 variables (removed 60) and now considering 56/137 (removed 81) transitions.
[2024-05-22 22:55:44] [INFO ] Flow matrix only has 47 transitions (discarded 9 similar events)
// Phase 1: matrix 47 rows 36 cols
[2024-05-22 22:55:44] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 22:55:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 22:55:44] [INFO ] Flow matrix only has 47 transitions (discarded 9 similar events)
[2024-05-22 22:55:44] [INFO ] Invariant cache hit.
[2024-05-22 22:55:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 22:55:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/123 places, 56/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 202 ms. Remains : 36/123 places, 56/242 transitions.
[2024-05-22 22:55:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:55:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:55:44] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-22 22:55:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:55:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:55:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8710822665402485322.gal : 1 ms
[2024-05-22 22:55:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9010154104302928938.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/CTLFireability8710822665402485322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9010154104302928938.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,37633,0.007185,3624,2,126,5,863,6,0,190,700,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF(!((((p35==1)&&(p48==1))&&(p121==1)))) U EF((p13==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!(!((((p35==1)&&(p48==1))&&(p121==1)))))) U E(TRUE U (p13==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.018776,4204,1,0,9,3651,26,3,930,1622,12
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:55:44] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 22:55:44] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 22:55:44] [INFO ] Invariant cache hit.
[2024-05-22 22:55:44] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:55:44] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:55:44] [INFO ] Invariant cache hit.
[2024-05-22 22:55:44] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6521 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6199 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12791ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12797ms
Finished structural reductions in LTL mode , in 1 iterations and 12995 ms. Remains : 123/123 places, 242/242 transitions.
[2024-05-22 22:55:57] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:55:57] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:55:57] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1321479225539509520.gal : 2 ms
[2024-05-22 22:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7192829917949100861.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/CTLFireability1321479225539509520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7192829917949100861.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,6.19174e+10,0.528396,25456,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: (AG((((AX(EX(((p81==1)&&(p122==1)))) * AF(EX((p73==1)))) + EX(A(((p38==1)&&(p122==1)) U ((p5==1)&&(p122==1))))) + (EF(AX((((p72==1)&&(p11...365
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !((((!(EX(!(EX(((p81==1)&&(p122==1)))))) * !(EG(!(EX((p73==1)))))) + EX(!((E(!(((p5==1...526
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.11759,36532,1,0,6,246528,14,0,3685,65272,5
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:55:58] [INFO ] Invariant cache hit.
[2024-05-22 22:55:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 22:55:58] [INFO ] Invariant cache hit.
[2024-05-22 22:55:58] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:55:58] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:55:58] [INFO ] Invariant cache hit.
[2024-05-22 22:55:58] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6444 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6358 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12865ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12868ms
Finished structural reductions in LTL mode , in 1 iterations and 13038 ms. Remains : 123/123 places, 242/242 transitions.
[2024-05-22 22:56:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:56:11] [INFO ] Flatten gal took : 17 ms
[2024-05-22 22:56:11] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:56:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:56:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1504570296962763397.gal : 6 ms
[2024-05-22 22:56:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16498501914975892286.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1504570296962763397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16498501914975892286.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,6.19174e+10,0.504402,25432,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: E((!(AX((p65==1))) * ((A(!(EX((p72==1))) U AF(EX(((p101==1)&&(p122==1))))) + !((EG((p83==1)) + ((EX((((p48==1)&&(p119==1))&&(p121==1))) *...377
=> equivalent forward existential formula: [((FwdU(Init,(!(!(EX(!((p65==1))))) * ((!((E(!(!(EG(!(EX(((p101==1)&&(p122==1))))))) U (!(!(EX((p72==1)))) * !(!...560
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,2.28441,79116,1,0,40,507030,54,22,4344,216824,43
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:56:14] [INFO ] Invariant cache hit.
[2024-05-22 22:56:14] [INFO ] Implicit Places using invariants in 58 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:56:14] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:56:14] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:14] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:14] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11671449884126854427.gal : 2 ms
[2024-05-22 22:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12542783964091246996.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/CTLFireability11671449884126854427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12542783964091246996.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,6.19174e+10,0.1933,12168,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: EF((AX(E(!(((((p48==1)&&(p83==1))&&(p121==1))||(((p35==1)&&(p72==1))&&(p121==1)))) U !(A((((p12==1)&&(p95==1))&&(p121==1)) U (p83==1)))))...201
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!(E(!(((((p48==1)&&(p83==1))&&(p121==1))||(((p35==1)&&(p72==1))&&(p121==1)))) U !(...314
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 223/0/19
Hit Full ! (commute/partial/dont) 140/5/102
(forward)formula 0,0,0.728826,30392,1,0,14,170865,42,3,4072,66727,17
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 86 edges and 123 vertex of which 15 / 123 are part of one of the 5 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 65 place count 106 transition count 165
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 68 place count 106 transition count 165
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 103 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 103 transition count 162
Applied a total of 74 rules in 20 ms. Remains 103 /123 variables (removed 20) and now considering 162/242 (removed 80) transitions.
[2024-05-22 22:56:15] [INFO ] Flow matrix only has 154 transitions (discarded 8 similar events)
// Phase 1: matrix 154 rows 103 cols
[2024-05-22 22:56:15] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 22:56:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 22:56:15] [INFO ] Flow matrix only has 154 transitions (discarded 8 similar events)
[2024-05-22 22:56:15] [INFO ] Invariant cache hit.
[2024-05-22 22:56:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 22:56:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-22 22:56:15] [INFO ] Redundant transitions in 7 ms returned []
Running 161 sub problems to find dead transitions.
[2024-05-22 22:56:15] [INFO ] Flow matrix only has 154 transitions (discarded 8 similar events)
[2024-05-22 22:56:15] [INFO ] Invariant cache hit.
[2024-05-22 22:56:15] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 153/256 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 77/192 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/257 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 193 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4488 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 153/256 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 77/192 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 161/353 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/257 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 354 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 8523ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 8525ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/123 places, 162/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8698 ms. Remains : 103/123 places, 162/242 transitions.
[2024-05-22 22:56:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:56:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:23] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-22 22:56:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:56:23] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:56:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13477782431561215647.gal : 1 ms
[2024-05-22 22:56:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5625018035585942617.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/CTLFireability13477782431561215647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5625018035585942617.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.5099e+09,0.199834,12340,2,1003,5,49702,6,0,567,33132,0


Converting to forward existential form...Done !
original formula: E(!((((p59==1)&&(p72==1))&&(p121==1))) U AG(((((p48==1)&&(p119==1))&&(p121==1)) + ((EF(((p28==1)&&(p122==1))) * (p11==1)) * ((p60==1)&&(p...167
=> equivalent forward existential formula: [(FwdU(Init,!((((p59==1)&&(p72==1))&&(p121==1)))) * !(E(TRUE U !(((((p48==1)&&(p119==1))&&(p121==1)) + ((E(TRUE ...231
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.373776,15000,1,0,12,81538,17,4,2629,33132,10
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:56:24] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 22:56:24] [INFO ] Implicit Places using invariants in 61 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:56:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:24] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14111302629126575635.gal : 1 ms
[2024-05-22 22:56:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13274799427059093115.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/CTLFireability14111302629126575635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13274799427059093115.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,6.19174e+10,0.200206,12168,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: (EG(E(((((E((((p23==1)&&(p48==1))&&(p121==1)) U (((p47==1)&&(p96==1))&&(p121==1))) + !((((p24==1)&&(p35==1))&&(p121==1)))) + ((p109==1)||...460
=> equivalent forward existential formula: [(FwdU((Init * !(EG(E(((((E((((p23==1)&&(p48==1))&&(p121==1)) U (((p47==1)&&(p96==1))&&(p121==1))) + !((((p24==1...796
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.7371,31316,1,0,9,191100,24,1,3831,60025,12
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:56:25] [INFO ] Invariant cache hit.
[2024-05-22 22:56:25] [INFO ] Implicit Places using invariants in 65 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:56:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:56:25] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:56:25] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:56:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7642768065343817620.gal : 1 ms
[2024-05-22 22:56:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11037399377554926171.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/CTLFireability7642768065343817620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11037399377554926171.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,6.19174e+10,0.216047,12172,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(((p30==0)||(p121==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(((p30==0)||(p121==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.636701,26280,1,0,7,149185,16,0,3620,46114,7
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:56:25] [INFO ] Invariant cache hit.
[2024-05-22 22:56:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 22:56:25] [INFO ] Invariant cache hit.
[2024-05-22 22:56:25] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:56:26] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:56:26] [INFO ] Invariant cache hit.
[2024-05-22 22:56:26] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6486 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6415 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12965ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12968ms
Finished structural reductions in LTL mode , in 1 iterations and 13154 ms. Remains : 123/123 places, 242/242 transitions.
[2024-05-22 22:56:38] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:56:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:39] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:56:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9995227233139197157.gal : 2 ms
[2024-05-22 22:56:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5851473478636336291.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/CTLFireability9995227233139197157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5851473478636336291.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,6.19174e+10,0.509886,25440,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: A(A(!(((!((((p12==1)&&(p83==1))&&((p121==1)&&(p77==1)))&&(p122==1)))&&(!(((p40==1)&&(p122==1))&&((p16==1)&&(p122==1)))))) U (p27==1)) U (...508
=> equivalent forward existential formula: [((Init * !(EG(!(((((p12==1)&&(p59==1))&&(p121==1)) + (E(TRUE U (E((((p96==1)&&(p119==1))&&(p121==1)) U (p53==1)...1372
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 149/92/93
Hit Full ! (commute/partial/dont) 145/167/97
Hit Full ! (commute/partial/dont) 145/167/97
Hit Full ! (commute/partial/dont) 239/0/3
Using saturation style SCC detection
(forward)formula 0,1,2.42149,85480,1,0,35,601964,70,14,4874,236441,39
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:56:41] [INFO ] Invariant cache hit.
[2024-05-22 22:56:41] [INFO ] Implicit Places using invariants in 72 ms returned [122]
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 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:56:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:41] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13033844803431786031.gal : 2 ms
[2024-05-22 22:56:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5166853248865008241.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/CTLFireability13033844803431786031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5166853248865008241.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,6.19174e+10,0.203046,12164,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: E(EF(((((p83==1)&&(p96==1))&&((p121==1)&&(p35==1)))&&(p108==1))) U !((AX(A((p46==1) U ((((p24==1)&&(p71==1))&&((p121==1)&&(p60==1)))&&((p...382
=> equivalent forward existential formula: ([(FwdU(EY((FwdU(Init,E(TRUE U ((((p83==1)&&(p96==1))&&((p121==1)&&(p35==1)))&&(p108==1)))) * !(E(TRUE U (((((((...918
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 145/159/97
(forward)formula 0,0,0.91999,36280,1,0,15,232496,41,3,4099,75478,15
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:56:42] [INFO ] Invariant cache hit.
[2024-05-22 22:56:42] [INFO ] Implicit Places using invariants in 65 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:56:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:56:42] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:56:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:56:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:56:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9962321533207810731.gal : 3 ms
[2024-05-22 22:56:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3540352419001743319.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/CTLFireability9962321533207810731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3540352419001743319.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,6.19174e+10,0.191084,12172,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: EF(EX((AX((((p12==0)||(p47==0))||(p121==0))) + (((p36==1)&&(p95==1))&&((p121==1)&&(p99==1))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(!((((p12==0)||(p47==0))||(p121==0))))))] != FALSE + [(EY(FwdU(Init,TRUE)) * (((p36...206
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.577105,24548,1,0,10,131116,11,2,3624,42008,5
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-12 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 : 123/123 places, 242/242 transitions.
Graph (trivial) has 80 edges and 123 vertex of which 15 / 123 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
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 0 with 16 rules applied. Total rules applied 17 place count 105 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 68 place count 105 transition count 167
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 105 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 103 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 103 transition count 165
Applied a total of 76 rules in 18 ms. Remains 103 /123 variables (removed 20) and now considering 165/242 (removed 77) transitions.
[2024-05-22 22:56:43] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
// Phase 1: matrix 158 rows 103 cols
[2024-05-22 22:56:43] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 22:56:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 22:56:43] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
[2024-05-22 22:56:43] [INFO ] Invariant cache hit.
[2024-05-22 22:56:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-22 22:56:43] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 22:56:43] [INFO ] Redundant transitions in 1 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-22 22:56:43] [INFO ] Flow matrix only has 158 transitions (discarded 7 similar events)
[2024-05-22 22:56:43] [INFO ] Invariant cache hit.
[2024-05-22 22:56:43] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 157/260 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 83/198 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 1/261 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 199 constraints, problems are : Problem set: 0 solved, 164 unsolved in 4516 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 157/260 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 83/198 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 164/362 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 1/261 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/261 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 363 constraints, problems are : Problem set: 0 solved, 164 unsolved in 4237 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 103/103 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 8775ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 8776ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/123 places, 165/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8938 ms. Remains : 103/123 places, 165/242 transitions.
[2024-05-22 22:56:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:56:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:56:52] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-22 22:56:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:56:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:56:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11298042200334976437.gal : 1 ms
[2024-05-22 22:56:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14380446959550055372.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/CTLFireability11298042200334976437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14380446959550055372.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,9.5099e+09,0.116213,8684,2,584,5,29191,6,0,570,18022,0


Converting to forward existential form...Done !
original formula: EF((AF(((E((((p12==1)&&(p47==1))&&(p121==1)) U (((p24==1)&&(p35==1))&&(p121==1))) * (p83==1)) * ((p31==0)||(p122==0)))) + EG(AF(((E(((p79...223
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(((E((((p12==1)&&(p47==1))&&(p121==1)) U (((p24==1)&&(p35==1))&&(p121==1))) * (p83==1...316
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 126/57/39
Using saturation style SCC detection
(forward)formula 0,1,0.270238,13172,1,0,15,56495,26,5,3109,21783,12
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:56:52] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 22:56:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 22:56:52] [INFO ] Invariant cache hit.
[2024-05-22 22:56:52] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:56:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:56:52] [INFO ] Invariant cache hit.
[2024-05-22 22:56:52] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6425 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6356 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12852ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12855ms
Finished structural reductions in LTL mode , in 1 iterations and 13031 ms. Remains : 123/123 places, 242/242 transitions.
[2024-05-22 22:57:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:57:05] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:57:05] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:57:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:57:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14189732191200634871.gal : 1 ms
[2024-05-22 22:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1928812416803993976.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/CTLFireability14189732191200634871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1928812416803993976.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,6.19174e+10,0.505489,25432,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: EF((((EX(AX((((p12==1)&&(p47==1))&&(p121==1)))) * (p11==1)) * ((p72==1)&&(p121==1))) * (EF(((p41==1)||(p20==1))) + ((p81==1)&&(p122==1)))...157
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * ((EX(!(EX(!((((p12==1)&&(p47==1))&&(p121==1)))))) * (p11==1)) * ((p72==1)&&(p121==1))...344
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.8469,26716,1,0,12,157281,15,0,3514,65272,8
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:57:06] [INFO ] Invariant cache hit.
[2024-05-22 22:57:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 22:57:06] [INFO ] Invariant cache hit.
[2024-05-22 22:57:06] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:57:06] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:57:06] [INFO ] Invariant cache hit.
[2024-05-22 22:57:06] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6323 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6307 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12697ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12701ms
Finished structural reductions in LTL mode , in 1 iterations and 12878 ms. Remains : 123/123 places, 242/242 transitions.
[2024-05-22 22:57:19] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:57:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:57:19] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:57:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:57:19] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:57:19] [INFO ] Time to serialize gal into /tmp/CTLFireability15866326723843821631.gal : 1 ms
[2024-05-22 22:57:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17659095260451927318.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/CTLFireability15866326723843821631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17659095260451927318.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,6.19174e+10,0.507315,25504,2,2140,5,117376,6,0,732,65272,0


Converting to forward existential form...Done !
original formula: AX((AX((((p47==1)&&(p84==1))&&(p121==1))) + ((p88==1)&&(p122==1))))
=> equivalent forward existential formula: [(EY((EY(Init) * !(((p88==1)&&(p122==1))))) * !((((p47==1)&&(p84==1))&&(p121==1))))] = FALSE
(forward)formula 0,0,0.516934,25504,1,0,12,117376,11,4,1066,65272,4
FORMULA FlexibleBarrier-PT-10a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 22:57:19] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:57:19] [INFO ] Flatten gal took : 5 ms
Total runtime 124562 ms.

BK_STOP 1716418639921

--------------------
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-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640602500050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;