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.r158-smll-171636266500274.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 FMS-PT-00002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266500274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 22:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Apr 11 22:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 22:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00002-CTLFireability-2024-00
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-01
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-02
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-03
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-04
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-05
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-06
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-07
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-08
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-09
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-10
FORMULA_NAME FMS-PT-00002-CTLFireability-2024-11
FORMULA_NAME FMS-PT-00002-CTLFireability-2023-12
FORMULA_NAME FMS-PT-00002-CTLFireability-2023-13
FORMULA_NAME FMS-PT-00002-CTLFireability-2023-14
FORMULA_NAME FMS-PT-00002-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716582365448

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 20:26:07] [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-24 20:26:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:26:07] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-05-24 20:26:07] [INFO ] Transformed 22 places.
[2024-05-24 20:26:07] [INFO ] Transformed 20 transitions.
[2024-05-24 20:26:07] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FMS-PT-00002-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 92 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 20:26:07] [INFO ] Computed 6 invariants in 5 ms
[2024-05-24 20:26:07] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-24 20:26:07] [INFO ] Invariant cache hit.
[2024-05-24 20:26:07] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-24 20:26:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 905ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 923ms
Finished structural reductions in LTL mode , in 1 iterations and 1348 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 25 ms
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 7 ms
[2024-05-24 20:26:09] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 3975 steps (0 resets) in 347 ms. (11 steps per ms) remains 0/26 properties
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 5 ms
[2024-05-24 20:26:09] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 16 place count 13 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 11 transition count 12
Applied a total of 19 rules in 35 ms. Remains 11 /22 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-24 20:26:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 20:26:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 20:26:09] [INFO ] Invariant cache hit.
[2024-05-24 20:26:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 20:26:09] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-24 20:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/22 places, 12/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 401 ms. Remains : 11/22 places, 12/20 transitions.
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:09] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13373104909569837756.gal : 2 ms
[2024-05-24 20:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2856705034356480132.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/CTLFireability13373104909569837756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2856705034356480132.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,161,0.032152,3236,2,34,5,210,6,0,58,163,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((((P1<1)||(P2wM2<1))||((M2<1)||((P2d<1)&&(P12s<1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((((P1<1)||(P2wM2<1))||((M2<1)||((P2d<1)&&(P12s<1))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.040369,3580,1,0,6,621,15,0,263,425,5
FORMULA FMS-PT-00002-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 20:26:09] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 41 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/22 places, 20/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12012393690476157084.gal : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13475770028059478171.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/CTLFireability12012393690476157084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13475770028059478171.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,3444,0.006078,3404,2,103,5,608,6,0,103,466,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(!(A((P12M3>=1) U (P12M3>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(!((E(!((P12M3>=1)) U (!((P12M3>=1)) * !((P12M3>=1)))) + EG(!((P12M3>=1))...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 18/0/2
(forward)formula 0,1,0.016198,3984,1,0,9,2024,25,2,483,1149,11
FORMULA FMS-PT-00002-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 17 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 12 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 10 transition count 10
Applied a total of 22 rules in 11 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-24 20:26:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 26 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 9/22 places, 10/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 39 ms. Remains : 9/22 places, 10/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 10 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4693568086940830393.gal : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5905997434385000881.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/CTLFireability4693568086940830393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5905997434385000881.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,90,0.003016,3336,2,26,5,167,6,0,48,131,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(!(A((P1M1>=1) U (P2M2>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(!(!((E(!((P2M2>=1)) U (!((P1M1>=1)) * !((P2M2>=1)))) + EG(!((P2M2>=1)))))))))...166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 8/0/2
(forward)formula 0,0,0.007726,3652,1,0,8,424,32,1,236,306,11
FORMULA FMS-PT-00002-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 20:26:10] [INFO ] Computed 6 invariants in 3 ms
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 50 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 20/22 places, 20/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18430406976754423303.gal : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4911453087818948719.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/CTLFireability18430406976754423303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4911453087818948719.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,3444,0.007025,3400,2,103,5,608,6,0,103,466,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((P1s>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((P1s>=1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.019827,3980,1,0,8,3378,15,1,450,2059,6
FORMULA FMS-PT-00002-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 45 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 21/22 places, 20/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8115666882755489370.gal : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17732186897658332899.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/CTLFireability8115666882755489370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17732186897658332899.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,3444,0.005755,3412,2,106,5,616,6,0,107,469,0


Converting to forward existential form...Done !
original formula: EF(AG(((EX((((P1wM1<1)||(M1<1))||(P12<1))) + E((P1<1) U ((P2s>=1)||(P1d>=1)))) + EG(((P1wP2<1)||(P2wP1<1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((EX((((P1wM1<1)||(M1<1))||(P12<1))) + E((P1<1) U ((P2s>=1)||(P1d>=1)))) + EG((...192
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 17/0/3
(forward)formula 0,1,0.022394,4256,1,0,10,3757,30,2,511,2577,12
FORMULA FMS-PT-00002-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 40 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/22 places, 20/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12979780562320032474.gal : 2 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13091433732871197502.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/CTLFireability12979780562320032474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13091433732871197502.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,3444,0.006042,3408,2,106,5,624,6,0,107,478,0


Converting to forward existential form...Done !
original formula: EF((((AG(EX((P1d>=1))) * (P2M2>=1)) * (AX((P1s<1)) * AX((P1s>=1)))) * ((EG((((((P1wP2>=1)&&(P2wP1>=1))||(P2d>=1))&&(P1d<1)) + EG((P1d>=1)...262
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * ((!(E(TRUE U !(EX((P1d>=1))))) * (P2M2>=1)) * (!(EX(!((P1s<1)))) * !(EX(!((P1s>=1)))))))...657
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 16/0/4
(forward)formula 0,0,0.03294,4516,1,0,23,5742,40,6,556,4151,18
FORMULA FMS-PT-00002-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 15 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 12 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 17 place count 12 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 11 transition count 12
Applied a total of 19 rules in 5 ms. Remains 11 /22 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-24 20:26:10] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 20:26:10] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 14 constraints, problems are : Problem set: 0 solved, 8 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/22 places, 12/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 278 ms. Remains : 11/22 places, 12/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13559300673282667253.gal : 0 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15738821942511692149.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/CTLFireability13559300673282667253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15738821942511692149.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,261,0.003097,3348,2,39,5,197,6,0,59,141,0


Converting to forward existential form...Done !
original formula: EF(AG((EG((P3<1)) + ((P1s<1)&&((P12>=1)||(P2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EG((P3<1)) + ((P1s<1)&&((P12>=1)||(P2>=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.006802,3664,1,0,9,658,23,2,268,497,9
FORMULA FMS-PT-00002-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 16 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-24 20:26:10] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 20:26:10] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 130 ms. Remains : 2/22 places, 3/20 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 0 ms
[2024-05-24 20:26:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9574995322128008172.gal : 1 ms
[2024-05-24 20:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability429892904191075952.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/CTLFireability9574995322128008172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability429892904191075952.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3,0.001616,3280,2,5,5,19,5,0,12,10,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((P2s<1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (P2s<1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002525,3596,1,0,5,29,18,0,46,16,7
FORMULA FMS-PT-00002-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 20 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 9 place count 17 transition count 16
Applied a total of 9 rules in 3 ms. Remains 17 /22 variables (removed 5) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 17 cols
[2024-05-24 20:26:10] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
[2024-05-24 20:26:10] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-24 20:26:10] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-24 20:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/17 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/33 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 22 constraints, problems are : Problem set: 0 solved, 13 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 3/17 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/33 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 316ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/22 places, 16/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 398 ms. Remains : 17/22 places, 16/20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Input system was already deterministic with 16 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14357825543210556153.gal : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12574008119313417800.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/CTLFireability14357825543210556153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12574008119313417800.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,1950,0.004385,3388,2,46,5,302,6,0,87,228,0


Converting to forward existential form...Done !
original formula: A(E(E(((((M2>=1)&&(P3M2>=1))||((P1wP2>=1)&&(P2wP1>=1)))||((P1>=1)&&(P3s>=1))) U !(AF(((P1wM1>=1)&&(M1>=1))))) U (AF(!(((P1M1>=1)||((P2wM2...243
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(!(E(TRUE U !((((P3>=1)&&(P2d>=1)) + E(TRUE U (P1s>=1)))))))))))))) * !(E(!(!(EG(!(!(!(...504
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 5/0/11
(forward)formula 0,0,0.035386,4496,1,0,29,5781,51,17,452,7504,33
FORMULA FMS-PT-00002-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 20:26:11] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 20:26:11] [INFO ] Implicit Places using invariants in 31 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 20/22 places, 20/20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17638357839775396144.gal : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability11943718434261860249.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/CTLFireability17638357839775396144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11943718434261860249.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,3444,0.005871,3404,2,103,5,608,6,0,103,466,0


Converting to forward existential form...Done !
original formula: (E(AX(!(A((P2d>=1) U (P2d>=1)))) U (!(EX(E((P12M3>=1) U (P2d>=1)))) * (P12M3>=1))) * (EX((!(A(A((P2>=1) U (P2d>=1)) U !(((M2>=1)&&(P3M2>=...241
=> equivalent forward existential formula: (((([(FwdU((FwdU(EY((Init * E(!(EX(!(!(!((E(!((P2d>=1)) U (!((P2d>=1)) * !((P2d>=1)))) + EG(!((P2d>=1))))))))) U...1165
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 17/0/3
Hit Full ! (commute/partial/dont) 18/0/2
(forward)formula 0,0,0.034761,4512,1,0,20,4069,62,7,527,2798,19
FORMULA FMS-PT-00002-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 10 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 5 transition count 6
Applied a total of 28 rules in 6 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-24 20:26:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 20:26:11] [INFO ] Implicit Places using invariants in 22 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 4/22 places, 6/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 30 ms. Remains : 4/22 places, 6/20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Input system was already deterministic with 6 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12012657052348849647.gal : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3006660392653252958.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/CTLFireability12012657052348849647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3006660392653252958.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,10,0.002815,3296,2,11,5,57,5,0,23,41,0


Converting to forward existential form...Done !
original formula: AG(EF(((P1s>=1)&&(P12M3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((P1s>=1)&&(P12M3>=1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.005088,3612,1,0,6,127,12,0,92,93,5
FORMULA FMS-PT-00002-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-24 20:26:11] [INFO ] Computed 6 invariants in 2 ms
[2024-05-24 20:26:11] [INFO ] Implicit Places using invariants in 37 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 20/22 places, 20/20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:11] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8076404685568913137.gal : 2 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14271951985022532376.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/CTLFireability8076404685568913137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14271951985022532376.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,3444,0.009611,3404,2,103,5,608,6,0,103,466,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(AF((P1s<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(EG(!((P1s<1)))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.028199,3984,1,0,6,2921,23,0,472,1811,8
FORMULA FMS-PT-00002-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 20:26:11] [INFO ] Invariant cache hit.
[2024-05-24 20:26:11] [INFO ] Implicit Places using invariants in 38 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/22 places, 20/20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:11] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16671874908792403593.gal : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8408329916313711558.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/CTLFireability16671874908792403593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8408329916313711558.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,3444,0.005994,3404,2,103,5,608,6,0,103,466,0


Converting to forward existential form...Done !
original formula: EX((AG(((P3s>=1)||(P1d>=1))) * (P12>=1)))
=> equivalent forward existential formula: [((EY(Init) * (P12>=1)) * !(E(TRUE U !(((P3s>=1)||(P1d>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.012983,3720,1,0,6,1934,15,0,453,922,5
FORMULA FMS-PT-00002-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-24 20:26:11] [INFO ] Invariant cache hit.
[2024-05-24 20:26:11] [INFO ] Implicit Places using invariants in 33 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 20/22 places, 20/20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 9 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1559136442977816395.gal : 1 ms
[2024-05-24 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9929978521323179146.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/CTLFireability1559136442977816395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9929978521323179146.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,3444,0.008878,3404,2,103,5,608,6,0,103,466,0


Converting to forward existential form...Done !
original formula: AX(E(EX(EF(((P12M3>=1)||(P2d>=1)))) U (P1M1>=1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(E(TRUE U ((P12M3>=1)||(P2d>=1)))) U (P1M1>=1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.025552,3984,1,0,7,2573,15,0,450,1446,8
FORMULA FMS-PT-00002-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 20:26:11] [INFO ] Flatten gal took : 2 ms
Total runtime 4649 ms.

BK_STOP 1716582371823

--------------------
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="FMS-PT-00002"
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 FMS-PT-00002, 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 r158-smll-171636266500274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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